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-167903714900107.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-020B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 7.3K Feb 25 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 16:36 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.9K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:37 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 332K 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-020B-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679265907439

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:45:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 22:45:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:45:10] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-19 22:45:10] [INFO ] Transformed 1203 places.
[2023-03-19 22:45:10] [INFO ] Transformed 1183 transitions.
[2023-03-19 22:45:10] [INFO ] Found NUPN structural information;
[2023-03-19 22:45:10] [INFO ] Parsed PT model containing 1203 places and 1183 transitions and 3566 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Discarding 134 places :
Symmetric choice reduction at 0 with 134 rule applications. Total rules 134 place count 1069 transition count 1049
Iterating global reduction 0 with 134 rules applied. Total rules applied 268 place count 1069 transition count 1049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 269 place count 1068 transition count 1048
Iterating global reduction 0 with 1 rules applied. Total rules applied 270 place count 1068 transition count 1048
Applied a total of 270 rules in 268 ms. Remains 1068 /1203 variables (removed 135) and now considering 1048/1183 (removed 135) transitions.
// Phase 1: matrix 1048 rows 1068 cols
[2023-03-19 22:45:10] [INFO ] Computed 181 place invariants in 25 ms
[2023-03-19 22:45:11] [INFO ] Implicit Places using invariants in 730 ms returned []
[2023-03-19 22:45:11] [INFO ] Invariant cache hit.
[2023-03-19 22:45:13] [INFO ] Implicit Places using invariants and state equation in 1774 ms returned []
Implicit Place search using SMT with State Equation took 2544 ms to find 0 implicit places.
[2023-03-19 22:45:13] [INFO ] Invariant cache hit.
[2023-03-19 22:45:14] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1068/1203 places, 1048/1183 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3570 ms. Remains : 1068/1203 places, 1048/1183 transitions.
Support contains 30 out of 1068 places after structural reductions.
[2023-03-19 22:45:14] [INFO ] Flatten gal took : 97 ms
[2023-03-19 22:45:14] [INFO ] Flatten gal took : 50 ms
[2023-03-19 22:45:14] [INFO ] Input system was already deterministic with 1048 transitions.
Finished random walk after 3913 steps, including 1 resets, run visited all 18 properties in 144 ms. (steps per millisecond=27 )
FORMULA ShieldIIPs-PT-020B-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 242 stabilizing places and 242 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 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 410 place count 859 transition count 839
Iterating global reduction 2 with 6 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 416 place count 859 transition count 838
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 418 place count 858 transition count 838
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 218 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-19 22:45:15] [INFO ] Computed 180 place invariants in 16 ms
[2023-03-19 22:45:15] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-19 22:45:15] [INFO ] Invariant cache hit.
[2023-03-19 22:45:16] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-19 22:45:16] [INFO ] Redundant transitions in 111 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-19 22:45:16] [INFO ] Computed 180 place invariants in 6 ms
[2023-03-19 22:45:17] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 27 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2008 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-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:(NEQ s303 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 96 reset in 715 ms.
Product exploration explored 100000 steps with 95 reset in 719 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 196 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=65 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 29 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-19 22:45:19] [INFO ] Invariant cache hit.
[2023-03-19 22:45:19] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-19 22:45:19] [INFO ] Invariant cache hit.
[2023-03-19 22:45:20] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
[2023-03-19 22:45:21] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-19 22:45:21] [INFO ] Invariant cache hit.
[2023-03-19 22:45:21] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2382 ms. Remains : 500/500 places, 480/480 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 289 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=144 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 96 reset in 508 ms.
Product exploration explored 100000 steps with 96 reset in 587 ms.
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2023-03-19 22:45:23] [INFO ] Invariant cache hit.
[2023-03-19 22:45:24] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-19 22:45:24] [INFO ] Invariant cache hit.
[2023-03-19 22:45:24] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1124 ms to find 0 implicit places.
[2023-03-19 22:45:24] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-19 22:45:24] [INFO ] Invariant cache hit.
[2023-03-19 22:45:25] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1621 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-02 finished in 10048 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 1 out of 1068 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 1067 transition count 946
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 966 transition count 946
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 202 place count 966 transition count 845
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 860 transition count 840
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 414 place count 860 transition count 839
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 859 transition count 839
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 1 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 2 with 712 rules applied. Total rules applied 1128 place count 503 transition count 483
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1130 place count 501 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1131 place count 500 transition count 481
Applied a total of 1131 rules in 88 ms. Remains 500 /1068 variables (removed 568) and now considering 481/1048 (removed 567) transitions.
// Phase 1: matrix 481 rows 500 cols
[2023-03-19 22:45:25] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-19 22:45:25] [INFO ] Implicit Places using invariants in 264 ms returned []
[2023-03-19 22:45:25] [INFO ] Invariant cache hit.
[2023-03-19 22:45:26] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
[2023-03-19 22:45:26] [INFO ] Redundant transitions in 136 ms returned [480]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 480 rows 500 cols
[2023-03-19 22:45:26] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-19 22:45:26] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/1068 places, 480/1048 transitions.
Applied a total of 0 rules in 24 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1355 ms. Remains : 500/1068 places, 480/1048 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s271 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 1044 steps with 0 reset in 6 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-06 finished in 1433 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((!p0||(p1 U X(p2)))) U X(p2)) U X(G(p3))))'
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 41 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-19 22:45:26] [INFO ] Computed 181 place invariants in 6 ms
[2023-03-19 22:45:27] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-19 22:45:27] [INFO ] Invariant cache hit.
[2023-03-19 22:45:28] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2023-03-19 22:45:28] [INFO ] Invariant cache hit.
[2023-03-19 22:45:29] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2306 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 901 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 9}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(OR (EQ s975 0) (EQ s531 1)), p1:(OR (EQ s539 0) (EQ s556 1)), p2:(OR (EQ s200 0) (EQ s966 1)), p3:(OR (EQ s96 0) (EQ s771 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 40015 reset in 947 ms.
Product exploration explored 100000 steps with 39951 reset in 789 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 3606 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 708 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 22:45:36] [INFO ] Invariant cache hit.
[2023-03-19 22:45:37] [INFO ] After 333ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 22:45:37] [INFO ] [Nat]Absence check using 181 positive place invariants in 59 ms returned sat
[2023-03-19 22:45:38] [INFO ] After 1040ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 22:45:39] [INFO ] Deduced a trap composed of 28 places in 377 ms of which 4 ms to minimize.
[2023-03-19 22:45:39] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-19 22:45:39] [INFO ] Deduced a trap composed of 19 places in 405 ms of which 1 ms to minimize.
[2023-03-19 22:45:40] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 1 ms to minimize.
[2023-03-19 22:45:40] [INFO ] Deduced a trap composed of 21 places in 291 ms of which 13 ms to minimize.
[2023-03-19 22:45:40] [INFO ] Deduced a trap composed of 16 places in 402 ms of which 1 ms to minimize.
[2023-03-19 22:45:41] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 14 ms to minimize.
[2023-03-19 22:45:41] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 1 ms to minimize.
[2023-03-19 22:45:42] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 2 ms to minimize.
[2023-03-19 22:45:42] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 0 ms to minimize.
[2023-03-19 22:45:42] [INFO ] Deduced a trap composed of 24 places in 348 ms of which 1 ms to minimize.
[2023-03-19 22:45:43] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 0 ms to minimize.
[2023-03-19 22:45:43] [INFO ] Deduced a trap composed of 21 places in 305 ms of which 0 ms to minimize.
[2023-03-19 22:45:43] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 1 ms to minimize.
[2023-03-19 22:45:44] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 1 ms to minimize.
[2023-03-19 22:45:44] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 2 ms to minimize.
[2023-03-19 22:45:44] [INFO ] Deduced a trap composed of 36 places in 294 ms of which 0 ms to minimize.
[2023-03-19 22:45:45] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 1 ms to minimize.
[2023-03-19 22:45:45] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 1 ms to minimize.
[2023-03-19 22:45:45] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 1 ms to minimize.
[2023-03-19 22:45:46] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 1 ms to minimize.
[2023-03-19 22:45:46] [INFO ] Deduced a trap composed of 34 places in 316 ms of which 1 ms to minimize.
[2023-03-19 22:45:46] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 0 ms to minimize.
[2023-03-19 22:45:47] [INFO ] Deduced a trap composed of 35 places in 380 ms of which 1 ms to minimize.
[2023-03-19 22:45:47] [INFO ] Deduced a trap composed of 29 places in 237 ms of which 0 ms to minimize.
[2023-03-19 22:45:47] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 26 ms to minimize.
[2023-03-19 22:45:48] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 1 ms to minimize.
[2023-03-19 22:45:48] [INFO ] Deduced a trap composed of 37 places in 199 ms of which 1 ms to minimize.
[2023-03-19 22:45:48] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 1 ms to minimize.
[2023-03-19 22:45:48] [INFO ] Deduced a trap composed of 32 places in 244 ms of which 1 ms to minimize.
[2023-03-19 22:45:49] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 0 ms to minimize.
[2023-03-19 22:45:49] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 1 ms to minimize.
[2023-03-19 22:45:49] [INFO ] Deduced a trap composed of 28 places in 303 ms of which 0 ms to minimize.
[2023-03-19 22:45:49] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 26 ms to minimize.
[2023-03-19 22:45:50] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 1 ms to minimize.
[2023-03-19 22:45:50] [INFO ] Deduced a trap composed of 37 places in 506 ms of which 3 ms to minimize.
[2023-03-19 22:45:51] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2023-03-19 22:45:51] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2023-03-19 22:45:51] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 1 ms to minimize.
[2023-03-19 22:45:51] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 13 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Deduced a trap composed of 45 places in 214 ms of which 1 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 0 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 14 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 0 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Deduced a trap composed of 47 places in 144 ms of which 1 ms to minimize.
[2023-03-19 22:45:52] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 14291 ms
[2023-03-19 22:45:53] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2023-03-19 22:45:53] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 0 ms to minimize.
[2023-03-19 22:45:53] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 0 ms to minimize.
[2023-03-19 22:45:53] [INFO ] Deduced a trap composed of 48 places in 143 ms of which 0 ms to minimize.
[2023-03-19 22:45:54] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 1 ms to minimize.
[2023-03-19 22:45:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1100 ms
[2023-03-19 22:45:54] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 1 ms to minimize.
[2023-03-19 22:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2023-03-19 22:45:55] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 0 ms to minimize.
[2023-03-19 22:45:55] [INFO ] Deduced a trap composed of 49 places in 146 ms of which 1 ms to minimize.
[2023-03-19 22:45:55] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 1 ms to minimize.
[2023-03-19 22:45:55] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2023-03-19 22:45:55] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 14 ms to minimize.
[2023-03-19 22:45:56] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 1 ms to minimize.
[2023-03-19 22:45:56] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2023-03-19 22:45:56] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2023-03-19 22:45:56] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 0 ms to minimize.
[2023-03-19 22:45:57] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 0 ms to minimize.
[2023-03-19 22:45:57] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 1 ms to minimize.
[2023-03-19 22:45:57] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 1 ms to minimize.
[2023-03-19 22:45:57] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 13 ms to minimize.
[2023-03-19 22:45:58] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 0 ms to minimize.
[2023-03-19 22:45:58] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3340 ms
[2023-03-19 22:45:58] [INFO ] Deduced a trap composed of 17 places in 225 ms of which 27 ms to minimize.
[2023-03-19 22:45:58] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 0 ms to minimize.
[2023-03-19 22:45:59] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 0 ms to minimize.
[2023-03-19 22:45:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2023-03-19 22:45:59] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 20 ms to minimize.
[2023-03-19 22:45:59] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 14 ms to minimize.
[2023-03-19 22:45:59] [INFO ] Deduced a trap composed of 27 places in 232 ms of which 0 ms to minimize.
[2023-03-19 22:46:00] [INFO ] Deduced a trap composed of 15 places in 361 ms of which 1 ms to minimize.
[2023-03-19 22:46:00] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 1 ms to minimize.
[2023-03-19 22:46:01] [INFO ] Deduced a trap composed of 32 places in 699 ms of which 2 ms to minimize.
[2023-03-19 22:46:01] [INFO ] Deduced a trap composed of 43 places in 180 ms of which 0 ms to minimize.
[2023-03-19 22:46:01] [INFO ] Deduced a trap composed of 30 places in 282 ms of which 1 ms to minimize.
[2023-03-19 22:46:02] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 0 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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 22:46:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 22:46:02] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 235 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 2 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 91 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 511/1064 places, 492/1044 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 492 rows 511 cols
[2023-03-19 22:46:02] [INFO ] Computed 180 place invariants in 10 ms
[2023-03-19 22:46:02] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:46:02] [INFO ] [Nat]Absence check using 179 positive place invariants in 21 ms returned sat
[2023-03-19 22:46:02] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 22:46:03] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:46:03] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 0 ms to minimize.
[2023-03-19 22:46:03] [INFO ] Deduced a trap composed of 13 places in 438 ms of which 2 ms to minimize.
[2023-03-19 22:46:03] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-19 22:46:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 722 ms
[2023-03-19 22:46:03] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 0 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-19 22:46:04] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 761 ms
[2023-03-19 22:46:04] [INFO ] After 1779ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-19 22:46:04] [INFO ] After 1980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 ms.
Support contains 8 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 34 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 511/511 places, 492/492 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 22:46:04] [INFO ] Invariant cache hit.
[2023-03-19 22:46:05] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:46:05] [INFO ] [Nat]Absence check using 179 positive place invariants in 34 ms returned sat
[2023-03-19 22:46:05] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 22:46:05] [INFO ] After 246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:46:05] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 0 ms to minimize.
[2023-03-19 22:46:05] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-03-19 22:46:05] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2023-03-19 22:46:06] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2023-03-19 22:46:06] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2023-03-19 22:46:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 758 ms
[2023-03-19 22:46:06] [INFO ] After 1051ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 22:46:06] [INFO ] After 1275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 8 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 17 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 511/511 places, 492/492 transitions.
Finished random walk after 7727 steps, including 2 resets, run visited all 1 properties in 63 ms. (steps per millisecond=122 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X (OR (NOT p0) p1)), (X p3), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))))), (X (AND p0 p1)), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) p3))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT (AND p1 p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p2) (NOT p0) p3)), (F (AND p1 p0 (NOT p3))), (F (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (F (AND p1 (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) p0 (NOT p3))), (F (NOT p2)), (F (NOT p3)), (F (AND p1 (NOT p2) (NOT p0) (NOT p3))), (F (NOT (OR p1 (NOT p0)))), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))), (F (AND p1 (NOT p2) (NOT p0) p3)), (F (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 36 factoid took 4141 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 514 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 785 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 31 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-19 22:46:11] [INFO ] Computed 181 place invariants in 24 ms
[2023-03-19 22:46:12] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-19 22:46:12] [INFO ] Invariant cache hit.
[2023-03-19 22:46:14] [INFO ] Implicit Places using invariants and state equation in 2311 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
[2023-03-19 22:46:14] [INFO ] Invariant cache hit.
[2023-03-19 22:46:15] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3589 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 36 factoid took 3142 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 799 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 348 ms. (steps per millisecond=28 ) properties (out of 21) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 22:46:20] [INFO ] Invariant cache hit.
[2023-03-19 22:46:20] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 22:46:20] [INFO ] [Nat]Absence check using 181 positive place invariants in 85 ms returned sat
[2023-03-19 22:46:21] [INFO ] After 1036ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-19 22:46:22] [INFO ] Deduced a trap composed of 20 places in 313 ms of which 1 ms to minimize.
[2023-03-19 22:46:22] [INFO ] Deduced a trap composed of 29 places in 346 ms of which 1 ms to minimize.
[2023-03-19 22:46:23] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 1 ms to minimize.
[2023-03-19 22:46:23] [INFO ] Deduced a trap composed of 18 places in 478 ms of which 1 ms to minimize.
[2023-03-19 22:46:23] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 0 ms to minimize.
[2023-03-19 22:46:24] [INFO ] Deduced a trap composed of 30 places in 215 ms of which 1 ms to minimize.
[2023-03-19 22:46:24] [INFO ] Deduced a trap composed of 21 places in 332 ms of which 1 ms to minimize.
[2023-03-19 22:46:25] [INFO ] Deduced a trap composed of 26 places in 354 ms of which 1 ms to minimize.
[2023-03-19 22:46:25] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 0 ms to minimize.
[2023-03-19 22:46:25] [INFO ] Deduced a trap composed of 14 places in 368 ms of which 1 ms to minimize.
[2023-03-19 22:46:25] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2023-03-19 22:46:26] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 0 ms to minimize.
[2023-03-19 22:46:26] [INFO ] Deduced a trap composed of 16 places in 267 ms of which 0 ms to minimize.
[2023-03-19 22:46:26] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 1 ms to minimize.
[2023-03-19 22:46:27] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 1 ms to minimize.
[2023-03-19 22:46:28] [INFO ] Deduced a trap composed of 20 places in 1451 ms of which 1 ms to minimize.
[2023-03-19 22:46:29] [INFO ] Deduced a trap composed of 25 places in 546 ms of which 1 ms to minimize.
[2023-03-19 22:46:29] [INFO ] Deduced a trap composed of 29 places in 306 ms of which 1 ms to minimize.
[2023-03-19 22:46:30] [INFO ] Deduced a trap composed of 30 places in 873 ms of which 1 ms to minimize.
[2023-03-19 22:46:31] [INFO ] Deduced a trap composed of 33 places in 327 ms of which 1 ms to minimize.
[2023-03-19 22:46:31] [INFO ] Deduced a trap composed of 29 places in 457 ms of which 0 ms to minimize.
[2023-03-19 22:46:31] [INFO ] Deduced a trap composed of 27 places in 256 ms of which 1 ms to minimize.
[2023-03-19 22:46:32] [INFO ] Deduced a trap composed of 36 places in 261 ms of which 0 ms to minimize.
[2023-03-19 22:46:32] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2023-03-19 22:46:32] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2023-03-19 22:46:33] [INFO ] Deduced a trap composed of 59 places in 404 ms of which 4 ms to minimize.
[2023-03-19 22:46:33] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 0 ms to minimize.
[2023-03-19 22:46:34] [INFO ] Deduced a trap composed of 37 places in 994 ms of which 2 ms to minimize.
[2023-03-19 22:46:35] [INFO ] Deduced a trap composed of 35 places in 1096 ms of which 0 ms to minimize.
[2023-03-19 22:46:36] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 13 ms to minimize.
[2023-03-19 22:46:36] [INFO ] Deduced a trap composed of 26 places in 204 ms of which 0 ms to minimize.
[2023-03-19 22:46:36] [INFO ] Deduced a trap composed of 34 places in 368 ms of which 1 ms to minimize.
[2023-03-19 22:46:37] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 1 ms to minimize.
[2023-03-19 22:46:37] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2023-03-19 22:46:37] [INFO ] Deduced a trap composed of 29 places in 191 ms of which 0 ms to minimize.
[2023-03-19 22:46:37] [INFO ] Deduced a trap composed of 37 places in 160 ms of which 1 ms to minimize.
[2023-03-19 22:46:37] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 15825 ms
[2023-03-19 22:46:38] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2023-03-19 22:46:38] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 0 ms to minimize.
[2023-03-19 22:46:38] [INFO ] Deduced a trap composed of 25 places in 201 ms of which 0 ms to minimize.
[2023-03-19 22:46:38] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 1 ms to minimize.
[2023-03-19 22:46:39] [INFO ] Deduced a trap composed of 35 places in 142 ms of which 1 ms to minimize.
[2023-03-19 22:46:39] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 1 ms to minimize.
[2023-03-19 22:46:39] [INFO ] Deduced a trap composed of 16 places in 206 ms of which 0 ms to minimize.
[2023-03-19 22:46:39] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 1 ms to minimize.
[2023-03-19 22:46:40] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 0 ms to minimize.
[2023-03-19 22:46:40] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 1 ms to minimize.
[2023-03-19 22:46:40] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2023-03-19 22:46:40] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 1 ms to minimize.
[2023-03-19 22:46:41] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2023-03-19 22:46:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3380 ms
[2023-03-19 22:46:41] [INFO ] Deduced a trap composed of 30 places in 188 ms of which 0 ms to minimize.
[2023-03-19 22:46:41] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2023-03-19 22:46:42] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 0 ms to minimize.
[2023-03-19 22:46:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 815 ms
[2023-03-19 22:46:42] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 0 ms to minimize.
[2023-03-19 22:46:42] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Deduced a trap composed of 20 places in 179 ms of which 0 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 0 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 1 ms to minimize.
[2023-03-19 22:46:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1769 ms
[2023-03-19 22:46:44] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 0 ms to minimize.
[2023-03-19 22:46:44] [INFO ] Deduced a trap composed of 30 places in 283 ms of which 0 ms to minimize.
[2023-03-19 22:46:44] [INFO ] Deduced a trap composed of 42 places in 184 ms of which 0 ms to minimize.
[2023-03-19 22:46:45] [INFO ] Deduced a trap composed of 33 places in 166 ms of which 0 ms to minimize.
[2023-03-19 22:46:45] [INFO ] Deduced a trap composed of 36 places in 194 ms of which 1 ms to minimize.
[2023-03-19 22:46:45] [INFO ] Deduced a trap composed of 43 places in 211 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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 22:46:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 22:46:45] [INFO ] After 25151ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 408 ms.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1064 transition count 944
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 964 transition count 944
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 964 transition count 842
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 862 transition count 842
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: 349
Deduced a syphon composed of 349 places in 1 ms
Reduce places removed 349 places and 0 transitions.
Iterating global reduction 2 with 698 rules applied. Total rules applied 1102 place count 513 transition count 493
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 137 times.
Drop transitions removed 137 transitions
Iterating global reduction 2 with 137 rules applied. Total rules applied 1239 place count 513 transition count 493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1240 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1241 place count 511 transition count 492
Applied a total of 1241 rules in 70 ms. Remains 511 /1064 variables (removed 553) and now considering 492/1044 (removed 552) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 511/1064 places, 492/1044 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 492 rows 511 cols
[2023-03-19 22:46:46] [INFO ] Computed 180 place invariants in 9 ms
[2023-03-19 22:46:46] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:46:46] [INFO ] [Nat]Absence check using 179 positive place invariants in 29 ms returned sat
[2023-03-19 22:46:46] [INFO ] [Nat]Absence check using 179 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 22:46:46] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 22:46:46] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-19 22:46:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-19 22:46:46] [INFO ] After 539ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-19 22:46:46] [INFO ] After 729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 511/511 places, 492/492 transitions.
Applied a total of 0 rules in 27 ms. Remains 511 /511 variables (removed 0) and now considering 492/492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 511/511 places, 492/492 transitions.
Finished random walk after 499 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=83 )
Knowledge obtained : [(AND p1 p2 p0 p3), (X p3), (X (NOT (AND p1 (NOT p2) (NOT p0) p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (X (NOT (AND (NOT p2) p3))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3)))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p1 (NOT p0))), (X (X (NOT (AND p1 p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p2) p3)))), true, (X (X (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) (NOT p1))), (F (AND (NOT p3) p0 p1)), (F (OR (AND (NOT p2) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p3) p1))), (F (AND (NOT p2) (NOT p3) p0 p1)), (F (AND (NOT p3) p0 (NOT p1))), (F (NOT p2)), (F (NOT p3)), (F (AND (NOT p2) (NOT p3) (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p3) p0 (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND (NOT p2) p1)), (F (AND (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p2) p3 (NOT p0) p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))]
Knowledge based reduction with 36 factoid took 3519 ms. Reduced automaton from 11 states, 33 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 780 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 824 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 852 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 40088 reset in 777 ms.
Product exploration explored 100000 steps with 40049 reset in 728 ms.
Applying partial POR strategy [false, false, true, false, true, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 732 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1064 transition count 1044
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 42 Pre rules applied. Total rules applied 99 place count 1064 transition count 1046
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 141 place count 1064 transition count 1046
Performed 410 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 551 places in 1 ms
Iterating global reduction 1 with 410 rules applied. Total rules applied 551 place count 1064 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Discarding 141 places :
Symmetric choice reduction at 1 with 141 rule applications. Total rules 692 place count 923 transition count 905
Deduced a syphon composed of 410 places in 0 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 833 place count 923 transition count 905
Deduced a syphon composed of 410 places in 0 ms
Applied a total of 833 rules in 342 ms. Remains 923 /1064 variables (removed 141) and now considering 905/1044 (removed 139) transitions.
[2023-03-19 22:46:56] [INFO ] Redundant transitions in 115 ms returned [904]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 904 rows 923 cols
[2023-03-19 22:46:56] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-19 22:46:56] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 923/1064 places, 904/1044 transitions.
Deduced a syphon composed of 410 places in 1 ms
Applied a total of 0 rules in 24 ms. Remains 923 /923 variables (removed 0) and now considering 904/904 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 955 ms. Remains : 923/1064 places, 904/1044 transitions.
Support contains 8 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 1044/1044 transitions.
Applied a total of 0 rules in 20 ms. Remains 1064 /1064 variables (removed 0) and now considering 1044/1044 (removed 0) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-19 22:46:56] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 22:46:56] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-19 22:46:56] [INFO ] Invariant cache hit.
[2023-03-19 22:46:58] [INFO ] Implicit Places using invariants and state equation in 1150 ms returned []
Implicit Place search using SMT with State Equation took 1520 ms to find 0 implicit places.
[2023-03-19 22:46:58] [INFO ] Invariant cache hit.
[2023-03-19 22:46:58] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2166 ms. Remains : 1064/1064 places, 1044/1044 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 91970 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) U (p1&&F(p2))))'
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1062 transition count 1042
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1062 transition count 1042
Applied a total of 12 rules in 50 ms. Remains 1062 /1068 variables (removed 6) and now considering 1042/1048 (removed 6) transitions.
// Phase 1: matrix 1042 rows 1062 cols
[2023-03-19 22:46:58] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-19 22:46:59] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-19 22:46:59] [INFO ] Invariant cache hit.
[2023-03-19 22:47:00] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-19 22:47:00] [INFO ] Invariant cache hit.
[2023-03-19 22:47:00] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1062/1068 places, 1042/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1940 ms. Remains : 1062/1068 places, 1042/1048 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s53 0) (EQ s316 1) (EQ s3 1)), p2:(EQ s3 1), p0:(OR (EQ s316 0) (EQ s740 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 11598 reset in 331 ms.
Product exploration explored 100000 steps with 11567 reset in 348 ms.
Computed a total of 239 stabilizing places and 239 stable transitions
Computed a total of 239 stabilizing places and 239 stable transitions
Detected a total of 239/1062 stabilizing places and 239/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 684 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (AND p1 (NOT p2) p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (AND p1 (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 11 factoid took 911 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p2)]
[2023-03-19 22:47:03] [INFO ] Invariant cache hit.
[2023-03-19 22:47:04] [INFO ] [Real]Absence check using 181 positive place invariants in 154 ms returned sat
[2023-03-19 22:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:07] [INFO ] [Real]Absence check using state equation in 3328 ms returned sat
[2023-03-19 22:47:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:47:08] [INFO ] [Nat]Absence check using 181 positive place invariants in 96 ms returned sat
[2023-03-19 22:47:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:10] [INFO ] [Nat]Absence check using state equation in 2025 ms returned sat
[2023-03-19 22:47:10] [INFO ] Computed and/alt/rep : 1041/2342/1041 causal constraints (skipped 0 transitions) in 122 ms.
[2023-03-19 22:47:20] [INFO ] Added : 423 causal constraints over 87 iterations in 10514 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 1062 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1062/1062 places, 1042/1042 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1061 transition count 942
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 962 transition count 942
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 962 transition count 841
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 861 transition count 841
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 1 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 1110 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1112 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1113 place count 503 transition count 484
Applied a total of 1113 rules in 131 ms. Remains 503 /1062 variables (removed 559) and now considering 484/1042 (removed 558) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-19 22:47:20] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-19 22:47:21] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-19 22:47:21] [INFO ] Invariant cache hit.
[2023-03-19 22:47:24] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
[2023-03-19 22:47:24] [INFO ] Redundant transitions in 81 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-19 22:47:24] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-19 22:47:24] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/1062 places, 483/1042 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4175 ms. Remains : 503/1062 places, 483/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p2)]
[2023-03-19 22:47:25] [INFO ] Invariant cache hit.
[2023-03-19 22:47:26] [INFO ] [Real]Absence check using 180 positive place invariants in 108 ms returned sat
[2023-03-19 22:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:27] [INFO ] [Real]Absence check using state equation in 838 ms returned sat
[2023-03-19 22:47:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:47:28] [INFO ] [Nat]Absence check using 180 positive place invariants in 59 ms returned sat
[2023-03-19 22:47:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:28] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-19 22:47:29] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2023-03-19 22:47:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-19 22:47:29] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 57 ms.
[2023-03-19 22:47:30] [INFO ] Added : 109 causal constraints over 22 iterations in 1673 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 107 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27535 reset in 406 ms.
Product exploration explored 100000 steps with 27408 reset in 341 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 12 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-19 22:47:31] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-19 22:47:31] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-19 22:47:31] [INFO ] Invariant cache hit.
[2023-03-19 22:47:33] [INFO ] Implicit Places using invariants and state equation in 1160 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2023-03-19 22:47:33] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-19 22:47:33] [INFO ] Invariant cache hit.
[2023-03-19 22:47:35] [INFO ] Dead Transitions using invariants and state equation in 2667 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4284 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 37183 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(((p1 U X(p2))||(F(p3) U !p0))))))'
Support contains 7 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1064 transition count 1044
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1064 transition count 1044
Applied a total of 8 rules in 40 ms. Remains 1064 /1068 variables (removed 4) and now considering 1044/1048 (removed 4) transitions.
// Phase 1: matrix 1044 rows 1064 cols
[2023-03-19 22:47:36] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-19 22:47:36] [INFO ] Implicit Places using invariants in 410 ms returned []
[2023-03-19 22:47:36] [INFO ] Invariant cache hit.
[2023-03-19 22:47:37] [INFO ] Implicit Places using invariants and state equation in 1112 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2023-03-19 22:47:37] [INFO ] Invariant cache hit.
[2023-03-19 22:47:38] [INFO ] Dead Transitions using invariants and state equation in 676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1064/1068 places, 1044/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2253 ms. Remains : 1064/1068 places, 1044/1048 transitions.
Stuttering acceptance computed with spot in 579 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p3) (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), p0]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s671 1), p1:(OR (EQ s65 0) (EQ s14 1)), p3:(OR (EQ s442 0) (EQ s297 1)), p2:(OR (EQ s836 0) (EQ s690 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-12 finished in 2892 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||(F(p1)&&X(X(G(p2)))))))'
Support contains 5 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1063 transition count 1043
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1063 transition count 1043
Applied a total of 10 rules in 83 ms. Remains 1063 /1068 variables (removed 5) and now considering 1043/1048 (removed 5) transitions.
// Phase 1: matrix 1043 rows 1063 cols
[2023-03-19 22:47:38] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-19 22:47:39] [INFO ] Implicit Places using invariants in 355 ms returned []
[2023-03-19 22:47:39] [INFO ] Invariant cache hit.
[2023-03-19 22:47:40] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1766 ms to find 0 implicit places.
[2023-03-19 22:47:40] [INFO ] Invariant cache hit.
[2023-03-19 22:47:41] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1063/1068 places, 1043/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2485 ms. Remains : 1063/1068 places, 1043/1048 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (NEQ s15 0) (NEQ s274 1)), p1:(AND (EQ s118 0) (EQ s627 1)), p2:(EQ s46 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1721 steps with 1 reset in 31 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-13 finished in 2943 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)))'
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((!p0||(p1 U X(p2)))) U X(p2)) U X(G(p3))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-09
Stuttering acceptance computed with spot in 814 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p3)), (NOT p2), true, (NOT p2), (NOT p3)]
Support contains 8 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 1067 transition count 947
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 967 transition count 947
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 200 place count 967 transition count 845
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 404 place count 865 transition count 845
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 408 place count 861 transition count 841
Iterating global reduction 2 with 4 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 412 place count 861 transition count 840
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 346
Deduced a syphon composed of 346 places in 1 ms
Reduce places removed 346 places and 0 transitions.
Iterating global reduction 2 with 692 rules applied. Total rules applied 1106 place count 514 transition count 494
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1108 place count 512 transition count 492
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1109 place count 511 transition count 492
Applied a total of 1109 rules in 128 ms. Remains 511 /1068 variables (removed 557) and now considering 492/1048 (removed 556) transitions.
// Phase 1: matrix 492 rows 511 cols
[2023-03-19 22:47:43] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-19 22:47:43] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-19 22:47:43] [INFO ] Invariant cache hit.
[2023-03-19 22:47:43] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-19 22:47:43] [INFO ] Invariant cache hit.
[2023-03-19 22:47:44] [INFO ] Dead Transitions using invariants and state equation in 401 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 511/1068 places, 492/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1431 ms. Remains : 511/1068 places, 492/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 9}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p3)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(NOT p2), acceptance={} source=9 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={} source=10 dest: 8}, { cond=p3, acceptance={} source=10 dest: 10}]], initial=1, aps=[p0:(OR (EQ s467 0) (EQ s251 1)), p1:(OR (EQ s255 0) (EQ s261 1)), p2:(OR (EQ s89 0) (EQ s462 1)), p3:(OR (EQ s37 0) (EQ s367 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1902 steps with 58 reset in 10 ms.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-09 finished in 2453 ms.
FORMULA ShieldIIPs-PT-020B-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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) U (p1&&F(p2))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020B-LTLCardinality-11
Stuttering acceptance computed with spot in 225 ms :[true, (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2)]
Support contains 4 out of 1068 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1068/1068 places, 1048/1048 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1067 transition count 948
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 198 place count 968 transition count 948
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 101 Pre rules applied. Total rules applied 198 place count 968 transition count 847
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 400 place count 867 transition count 847
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 406 place count 861 transition count 841
Iterating global reduction 2 with 6 rules applied. Total rules applied 412 place count 861 transition count 841
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 412 place count 861 transition count 840
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 414 place count 860 transition count 840
Performed 354 Post agglomeration using F-continuation condition.Transition count delta: 354
Deduced a syphon composed of 354 places in 1 ms
Reduce places removed 354 places and 0 transitions.
Iterating global reduction 2 with 708 rules applied. Total rules applied 1122 place count 506 transition count 486
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1124 place count 504 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1125 place count 503 transition count 484
Applied a total of 1125 rules in 107 ms. Remains 503 /1068 variables (removed 565) and now considering 484/1048 (removed 564) transitions.
// Phase 1: matrix 484 rows 503 cols
[2023-03-19 22:47:44] [INFO ] Computed 180 place invariants in 3 ms
[2023-03-19 22:47:45] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-19 22:47:45] [INFO ] Invariant cache hit.
[2023-03-19 22:47:45] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-19 22:47:45] [INFO ] Invariant cache hit.
[2023-03-19 22:47:46] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 503/1068 places, 484/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1431 ms. Remains : 503/1068 places, 484/1048 transitions.
Running random walk in product with property : ShieldIIPs-PT-020B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s19 0) (EQ s146 1) (EQ s1 1)), p2:(EQ s1 1), p0:(OR (EQ s146 0) (EQ s351 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27575 reset in 358 ms.
Product exploration explored 100000 steps with 27797 reset in 393 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/484 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p2)), (X p2), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 7 factoid took 627 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p2)), (X p2), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 7 factoid took 641 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p2)]
[2023-03-19 22:47:48] [INFO ] Invariant cache hit.
[2023-03-19 22:47:49] [INFO ] [Real]Absence check using 180 positive place invariants in 49 ms returned sat
[2023-03-19 22:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:49] [INFO ] [Real]Absence check using state equation in 441 ms returned sat
[2023-03-19 22:47:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:47:49] [INFO ] [Nat]Absence check using 180 positive place invariants in 50 ms returned sat
[2023-03-19 22:47:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:50] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-19 22:47:50] [INFO ] Computed and/alt/rep : 447/1491/447 causal constraints (skipped 35 transitions) in 60 ms.
[2023-03-19 22:47:50] [INFO ] Added : 30 causal constraints over 7 iterations in 680 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 484/484 transitions.
Applied a total of 0 rules in 36 ms. Remains 503 /503 variables (removed 0) and now considering 484/484 (removed 0) transitions.
[2023-03-19 22:47:50] [INFO ] Invariant cache hit.
[2023-03-19 22:47:51] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-19 22:47:51] [INFO ] Invariant cache hit.
[2023-03-19 22:47:52] [INFO ] Implicit Places using invariants and state equation in 1227 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
[2023-03-19 22:47:52] [INFO ] Redundant transitions in 118 ms returned [483]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 483 rows 503 cols
[2023-03-19 22:47:52] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-19 22:47:53] [INFO ] Dead Transitions using invariants and state equation in 924 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 503/503 places, 483/484 transitions.
Applied a total of 0 rules in 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2670 ms. Remains : 503/503 places, 483/484 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/503 stabilizing places and 2/483 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 235 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p2)]
[2023-03-19 22:47:54] [INFO ] Invariant cache hit.
[2023-03-19 22:47:54] [INFO ] [Real]Absence check using 180 positive place invariants in 47 ms returned sat
[2023-03-19 22:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:55] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-19 22:47:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:47:55] [INFO ] [Nat]Absence check using 180 positive place invariants in 50 ms returned sat
[2023-03-19 22:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:47:56] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-19 22:47:56] [INFO ] Computed and/alt/rep : 446/1486/446 causal constraints (skipped 35 transitions) in 44 ms.
[2023-03-19 22:47:58] [INFO ] Added : 114 causal constraints over 23 iterations in 1993 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 79 ms :[(NOT p2)]
Product exploration explored 100000 steps with 27660 reset in 419 ms.
Product exploration explored 100000 steps with 27618 reset in 363 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 503 transition count 481
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 11 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2023-03-19 22:47:59] [INFO ] Computed 180 place invariants in 2 ms
[2023-03-19 22:47:59] [INFO ] Implicit Places using invariants in 853 ms returned []
[2023-03-19 22:48:00] [INFO ] Invariant cache hit.
[2023-03-19 22:48:01] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2023-03-19 22:48:01] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-19 22:48:01] [INFO ] Invariant cache hit.
[2023-03-19 22:48:02] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 501/503 places, 481/483 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2919 ms. Remains : 501/503 places, 481/483 transitions.
Treatment of property ShieldIIPs-PT-020B-LTLCardinality-11 finished in 17669 ms.
[2023-03-19 22:48:02] [INFO ] Flatten gal took : 43 ms
[2023-03-19 22:48:02] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 22:48:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1068 places, 1048 transitions and 3296 arcs took 7 ms.
Total runtime 172020 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-020B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

BK_STOP 1679266258150

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
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 # 1 (type EXCL) for 0 ShieldIIPs-PT-020B-LTLCardinality-02
lola: time limit : 1199 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-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1199 6/32 ShieldIIPs-PT-020B-LTLCardinality-02 840210 m, 168042 m/sec, 1474221 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1199 11/32 ShieldIIPs-PT-020B-LTLCardinality-02 1690773 m, 170112 m/sec, 2990788 t fired, .

Time elapsed: 10 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1199 17/32 ShieldIIPs-PT-020B-LTLCardinality-02 2546792 m, 171203 m/sec, 4501191 t fired, .

Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1199 22/32 ShieldIIPs-PT-020B-LTLCardinality-02 3367855 m, 164212 m/sec, 6026388 t fired, .

Time elapsed: 20 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1199 28/32 ShieldIIPs-PT-020B-LTLCardinality-02 4204816 m, 167392 m/sec, 7620414 t fired, .

Time elapsed: 25 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldIIPs-PT-020B-LTLCardinality-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldIIPs-PT-020B-LTLCardinality-11
lola: time limit : 1785 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-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1785 4/32 ShieldIIPs-PT-020B-LTLCardinality-11 294753 m, 58950 m/sec, 1014283 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1785 7/32 ShieldIIPs-PT-020B-LTLCardinality-11 562589 m, 53567 m/sec, 2038179 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1785 10/32 ShieldIIPs-PT-020B-LTLCardinality-11 832698 m, 54021 m/sec, 3056960 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1785 13/32 ShieldIIPs-PT-020B-LTLCardinality-11 1114145 m, 56289 m/sec, 4067151 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1785 16/32 ShieldIIPs-PT-020B-LTLCardinality-11 1385623 m, 54295 m/sec, 5068088 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1785 19/32 ShieldIIPs-PT-020B-LTLCardinality-11 1639397 m, 50754 m/sec, 6078152 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1785 22/32 ShieldIIPs-PT-020B-LTLCardinality-11 1901607 m, 52442 m/sec, 7098828 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1785 25/32 ShieldIIPs-PT-020B-LTLCardinality-11 2173993 m, 54477 m/sec, 8115215 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1785 28/32 ShieldIIPs-PT-020B-LTLCardinality-11 2420789 m, 49359 m/sec, 9134497 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1785 31/32 ShieldIIPs-PT-020B-LTLCardinality-11 2656281 m, 47098 m/sec, 10155324 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-020B-LTLCardinality-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: 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: 3
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-020B-LTLCardinality-09
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-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3515 4/32 ShieldIIPs-PT-020B-LTLCardinality-09 203445 m, 40689 m/sec, 697739 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3515 6/32 ShieldIIPs-PT-020B-LTLCardinality-09 337826 m, 26876 m/sec, 1430754 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3515 9/32 ShieldIIPs-PT-020B-LTLCardinality-09 521673 m, 36769 m/sec, 2149020 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3515 10/32 ShieldIIPs-PT-020B-LTLCardinality-09 650558 m, 25777 m/sec, 2885945 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3515 12/32 ShieldIIPs-PT-020B-LTLCardinality-09 811588 m, 32206 m/sec, 3604142 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3515 14/32 ShieldIIPs-PT-020B-LTLCardinality-09 963812 m, 30444 m/sec, 4330837 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3515 16/32 ShieldIIPs-PT-020B-LTLCardinality-09 1097704 m, 26778 m/sec, 5050778 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3515 18/32 ShieldIIPs-PT-020B-LTLCardinality-09 1269432 m, 34345 m/sec, 5767702 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3515 19/32 ShieldIIPs-PT-020B-LTLCardinality-09 1378926 m, 21898 m/sec, 6491962 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3515 21/32 ShieldIIPs-PT-020B-LTLCardinality-09 1559109 m, 36036 m/sec, 7205655 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3515 23/32 ShieldIIPs-PT-020B-LTLCardinality-09 1681424 m, 24463 m/sec, 7933381 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3515 24/32 ShieldIIPs-PT-020B-LTLCardinality-09 1831396 m, 29994 m/sec, 8645572 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 66/3515 26/32 ShieldIIPs-PT-020B-LTLCardinality-09 1975336 m, 28788 m/sec, 9368891 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 71/3515 27/32 ShieldIIPs-PT-020B-LTLCardinality-09 2073964 m, 19725 m/sec, 10093439 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 76/3515 29/32 ShieldIIPs-PT-020B-LTLCardinality-09 2233288 m, 31864 m/sec, 10804561 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 81/3515 31/32 ShieldIIPs-PT-020B-LTLCardinality-09 2349233 m, 23189 m/sec, 11530381 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 86/3515 32/32 ShieldIIPs-PT-020B-LTLCardinality-09 2477701 m, 25693 m/sec, 12244629 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-020B-LTLCardinality-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-020B-LTLCardinality-02: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0
ShieldIIPs-PT-020B-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-020B-LTLCardinality-02: LTL unknown AGGR
ShieldIIPs-PT-020B-LTLCardinality-09: LTL unknown AGGR
ShieldIIPs-PT-020B-LTLCardinality-11: LTL unknown AGGR


Time elapsed: 176 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-020B"
export BK_EXAMINATION="LTLCardinality"
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-020B, examination is LTLCardinality"
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-167903714900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-020B.tgz
mv ShieldIIPs-PT-020B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;