About the Execution of LTSMin+red for AutoFlight-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 582.180 | 44456.00 | 84668.00 | 60.10 | F?FFFTTFFTFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597900459.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is AutoFlight-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597900459
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.2K Feb 25 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 18:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 134K Mar 5 18:22 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 AutoFlight-PT-06b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-06b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678629917193
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:05:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:05:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:05:19] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-12 14:05:19] [INFO ] Transformed 574 places.
[2023-03-12 14:05:19] [INFO ] Transformed 572 transitions.
[2023-03-12 14:05:19] [INFO ] Found NUPN structural information;
[2023-03-12 14:05:19] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA AutoFlight-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 502 transition count 500
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 502 transition count 500
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 154 place count 502 transition count 490
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 181 place count 475 transition count 463
Iterating global reduction 1 with 27 rules applied. Total rules applied 208 place count 475 transition count 463
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 212 place count 471 transition count 459
Iterating global reduction 1 with 4 rules applied. Total rules applied 216 place count 471 transition count 459
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 219 place count 468 transition count 456
Iterating global reduction 1 with 3 rules applied. Total rules applied 222 place count 468 transition count 456
Applied a total of 222 rules in 156 ms. Remains 468 /574 variables (removed 106) and now considering 456/572 (removed 116) transitions.
// Phase 1: matrix 456 rows 468 cols
[2023-03-12 14:05:20] [INFO ] Computed 40 place invariants in 12 ms
[2023-03-12 14:05:20] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-12 14:05:20] [INFO ] Invariant cache hit.
[2023-03-12 14:05:21] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-12 14:05:21] [INFO ] Invariant cache hit.
[2023-03-12 14:05:21] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 468/574 places, 456/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1479 ms. Remains : 468/574 places, 456/572 transitions.
Support contains 37 out of 468 places after structural reductions.
[2023-03-12 14:05:21] [INFO ] Flatten gal took : 83 ms
[2023-03-12 14:05:21] [INFO ] Flatten gal took : 22 ms
[2023-03-12 14:05:22] [INFO ] Input system was already deterministic with 456 transitions.
Support contains 33 out of 468 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:05:22] [INFO ] Invariant cache hit.
[2023-03-12 14:05:22] [INFO ] [Real]Absence check using 39 positive place invariants in 12 ms returned sat
[2023-03-12 14:05:22] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 13 ms returned sat
[2023-03-12 14:05:22] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:05:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-12 14:05:23] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 14:05:23] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:05:23] [INFO ] Deduced a trap composed of 44 places in 176 ms of which 19 ms to minimize.
[2023-03-12 14:05:23] [INFO ] Deduced a trap composed of 57 places in 272 ms of which 27 ms to minimize.
[2023-03-12 14:05:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-12 14:05:24] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 1 ms to minimize.
[2023-03-12 14:05:24] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2023-03-12 14:05:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2023-03-12 14:05:24] [INFO ] Deduced a trap composed of 82 places in 180 ms of which 10 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 12 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 0 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 3 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 16 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 3 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 1 ms to minimize.
[2023-03-12 14:05:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1426 ms
[2023-03-12 14:05:26] [INFO ] After 2906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-12 14:05:26] [INFO ] After 3262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 56 ms.
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 456/456 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 468 transition count 291
Reduce places removed 165 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 186 rules applied. Total rules applied 351 place count 303 transition count 270
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 363 place count 291 transition count 270
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 363 place count 291 transition count 213
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 477 place count 234 transition count 213
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 482 place count 229 transition count 208
Iterating global reduction 3 with 5 rules applied. Total rules applied 487 place count 229 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 487 place count 229 transition count 204
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 495 place count 225 transition count 204
Performed 85 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 665 place count 140 transition count 108
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 689 place count 140 transition count 84
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 713 place count 116 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 714 place count 115 transition count 83
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 4 with 34 rules applied. Total rules applied 748 place count 98 transition count 66
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 765 place count 81 transition count 66
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 765 place count 81 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 789 place count 69 transition count 54
Applied a total of 789 rules in 68 ms. Remains 69 /468 variables (removed 399) and now considering 54/456 (removed 402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 69/468 places, 54/456 transitions.
Finished random walk after 117 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=58 )
FORMULA AutoFlight-PT-06b-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AutoFlight-PT-06b-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 122 stabilizing places and 122 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(p0) U X(G((p1&&F(p2))))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 456 transition count 444
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 456 transition count 444
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 456 transition count 442
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 452 transition count 438
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 450 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 449 transition count 435
Applied a total of 40 rules in 51 ms. Remains 449 /468 variables (removed 19) and now considering 435/456 (removed 21) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-12 14:05:26] [INFO ] Computed 40 place invariants in 7 ms
[2023-03-12 14:05:27] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-12 14:05:27] [INFO ] Invariant cache hit.
[2023-03-12 14:05:27] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-12 14:05:27] [INFO ] Invariant cache hit.
[2023-03-12 14:05:28] [INFO ] Dead Transitions using invariants and state equation in 330 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/468 places, 435/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1565 ms. Remains : 449/468 places, 435/456 transitions.
Stuttering acceptance computed with spot in 452 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s53 1), p1:(OR (EQ s68 0) (EQ s438 1)), p2:(OR (EQ s396 0) (EQ s359 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33327 reset in 341 ms.
Product exploration explored 100000 steps with 33289 reset in 265 ms.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 937 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-12 14:05:31] [INFO ] Invariant cache hit.
[2023-03-12 14:05:31] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 14:05:31] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-12 14:05:31] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-12 14:05:31] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 14:05:31] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-12 14:05:32] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 1 ms to minimize.
[2023-03-12 14:05:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2023-03-12 14:05:32] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 0 ms to minimize.
[2023-03-12 14:05:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-12 14:05:32] [INFO ] After 1032ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 106 ms.
[2023-03-12 14:05:32] [INFO ] After 1353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 17 ms.
Support contains 3 out of 449 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 449/449 places, 435/435 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 449 transition count 277
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 176 rules applied. Total rules applied 334 place count 291 transition count 259
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 346 place count 279 transition count 259
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 346 place count 279 transition count 205
Deduced a syphon composed of 54 places in 11 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 454 place count 225 transition count 205
Performed 87 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 628 place count 138 transition count 107
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 629 place count 138 transition count 106
Free-agglomeration rule applied 24 times.
Iterating global reduction 3 with 24 rules applied. Total rules applied 653 place count 138 transition count 82
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 677 place count 114 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 678 place count 113 transition count 81
Reduce places removed 28 places and 0 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 4 with 70 rules applied. Total rules applied 748 place count 85 transition count 39
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 5 with 42 rules applied. Total rules applied 790 place count 43 transition count 39
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 790 place count 43 transition count 27
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 814 place count 31 transition count 27
Applied a total of 814 rules in 62 ms. Remains 31 /449 variables (removed 418) and now considering 27/435 (removed 408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 31/449 places, 27/435 transitions.
Finished random walk after 117 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 1062 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 374 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 20 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
[2023-03-12 14:05:34] [INFO ] Invariant cache hit.
[2023-03-12 14:05:34] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-12 14:05:34] [INFO ] Invariant cache hit.
[2023-03-12 14:05:34] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-12 14:05:34] [INFO ] Invariant cache hit.
[2023-03-12 14:05:35] [INFO ] Dead Transitions using invariants and state equation in 483 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1145 ms. Remains : 449/449 places, 435/435 transitions.
Computed a total of 108 stabilizing places and 108 stable transitions
Computed a total of 108 stabilizing places and 108 stable transitions
Detected a total of 108/449 stabilizing places and 108/435 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 955 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:05:36] [INFO ] Invariant cache hit.
[2023-03-12 14:05:37] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2023-03-12 14:05:37] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 5 ms returned sat
[2023-03-12 14:05:37] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:05:37] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 0 ms to minimize.
[2023-03-12 14:05:37] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 1 ms to minimize.
[2023-03-12 14:05:37] [INFO ] Deduced a trap composed of 56 places in 91 ms of which 1 ms to minimize.
[2023-03-12 14:05:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 384 ms
[2023-03-12 14:05:37] [INFO ] After 581ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:05:37] [INFO ] After 688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:05:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 24 ms returned sat
[2023-03-12 14:05:37] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-12 14:05:37] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:05:38] [INFO ] Deduced a trap composed of 60 places in 160 ms of which 0 ms to minimize.
[2023-03-12 14:05:38] [INFO ] Deduced a trap composed of 67 places in 173 ms of which 1 ms to minimize.
[2023-03-12 14:05:38] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 10 ms to minimize.
[2023-03-12 14:05:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 570 ms
[2023-03-12 14:05:38] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-12 14:05:38] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 257 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=128 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND (NOT p0) (NOT p2) p1))]
Knowledge based reduction with 15 factoid took 1359 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 448 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33460 reset in 261 ms.
Product exploration explored 100000 steps with 33366 reset in 306 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 344 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 449 transition count 435
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 12 rules applied. Total rules applied 150 place count 449 transition count 429
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 150 place count 449 transition count 429
Deduced a syphon composed of 203 places in 3 ms
Iterating global reduction 2 with 59 rules applied. Total rules applied 209 place count 449 transition count 429
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 325 place count 333 transition count 313
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 441 place count 333 transition count 313
Performed 104 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 191 places in 0 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 545 place count 333 transition count 302
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 611 place count 267 transition count 236
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 677 place count 267 transition count 236
Deduced a syphon composed of 125 places in 1 ms
Applied a total of 677 rules in 115 ms. Remains 267 /449 variables (removed 182) and now considering 236/435 (removed 199) transitions.
[2023-03-12 14:05:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 236 rows 267 cols
[2023-03-12 14:05:42] [INFO ] Computed 40 place invariants in 17 ms
[2023-03-12 14:05:42] [INFO ] Dead Transitions using invariants and state equation in 304 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 267/449 places, 236/435 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 442 ms. Remains : 267/449 places, 236/435 transitions.
Support contains 5 out of 449 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 449 /449 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-12 14:05:42] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-12 14:05:42] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-12 14:05:42] [INFO ] Invariant cache hit.
[2023-03-12 14:05:43] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2023-03-12 14:05:43] [INFO ] Invariant cache hit.
[2023-03-12 14:05:43] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 902 ms. Remains : 449/449 places, 435/435 transitions.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 17015 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)||X(F(p1))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 455 transition count 441
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 450 transition count 436
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 448 transition count 434
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 448 transition count 434
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 447 transition count 433
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 447 transition count 433
Applied a total of 44 rules in 49 ms. Remains 447 /468 variables (removed 21) and now considering 433/456 (removed 23) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-12 14:05:43] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-12 14:05:43] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-12 14:05:43] [INFO ] Invariant cache hit.
[2023-03-12 14:05:44] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-12 14:05:44] [INFO ] Invariant cache hit.
[2023-03-12 14:05:44] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 447/468 places, 433/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 742 ms. Remains : 447/468 places, 433/456 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s113 0) (NEQ s389 1)), p0:(OR (EQ s174 0) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 476 reset in 200 ms.
Product exploration explored 100000 steps with 475 reset in 246 ms.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 397 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:05:45] [INFO ] Invariant cache hit.
[2023-03-12 14:05:45] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:05:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2023-03-12 14:05:45] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 22 ms returned sat
[2023-03-12 14:05:46] [INFO ] After 237ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:05:46] [INFO ] Deduced a trap composed of 25 places in 191 ms of which 1 ms to minimize.
[2023-03-12 14:05:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-12 14:05:46] [INFO ] After 498ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-12 14:05:46] [INFO ] After 731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 428 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Applied a total of 0 rules in 17 ms. Remains 447 /447 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-03-12 14:05:47] [INFO ] Invariant cache hit.
[2023-03-12 14:05:47] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-12 14:05:47] [INFO ] Invariant cache hit.
[2023-03-12 14:05:47] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2023-03-12 14:05:47] [INFO ] Invariant cache hit.
[2023-03-12 14:05:48] [INFO ] Dead Transitions using invariants and state equation in 433 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1031 ms. Remains : 447/447 places, 433/433 transitions.
Computed a total of 109 stabilizing places and 109 stable transitions
Computed a total of 109 stabilizing places and 109 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 391 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:05:49] [INFO ] Invariant cache hit.
[2023-03-12 14:05:49] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:05:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 13 ms returned sat
[2023-03-12 14:05:49] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 17 ms returned sat
[2023-03-12 14:05:49] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:05:50] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2023-03-12 14:05:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-12 14:05:50] [INFO ] After 729ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-12 14:05:50] [INFO ] After 929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 423 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 241 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 475 reset in 205 ms.
Product exploration explored 100000 steps with 473 reset in 220 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 447 transition count 433
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 11 rules applied. Total rules applied 148 place count 447 transition count 427
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 148 place count 447 transition count 427
Deduced a syphon composed of 203 places in 1 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 209 place count 447 transition count 427
Discarding 116 places :
Symmetric choice reduction at 2 with 116 rule applications. Total rules 325 place count 331 transition count 311
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 116 rules applied. Total rules applied 441 place count 331 transition count 311
Performed 105 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 192 places in 0 ms
Iterating global reduction 2 with 105 rules applied. Total rules applied 546 place count 331 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 547 place count 331 transition count 299
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 611 place count 267 transition count 235
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 3 with 64 rules applied. Total rules applied 675 place count 267 transition count 235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 676 place count 267 transition count 235
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 677 place count 266 transition count 234
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 678 place count 266 transition count 234
Deduced a syphon composed of 128 places in 0 ms
Applied a total of 678 rules in 173 ms. Remains 266 /447 variables (removed 181) and now considering 234/433 (removed 199) transitions.
[2023-03-12 14:05:52] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 234 rows 266 cols
[2023-03-12 14:05:52] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-12 14:05:53] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 266/447 places, 234/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1216 ms. Remains : 266/447 places, 234/433 transitions.
Support contains 4 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 447 /447 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 447 cols
[2023-03-12 14:05:53] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-12 14:05:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-12 14:05:53] [INFO ] Invariant cache hit.
[2023-03-12 14:05:54] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2023-03-12 14:05:54] [INFO ] Invariant cache hit.
[2023-03-12 14:05:54] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1092 ms. Remains : 447/447 places, 433/433 transitions.
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 10787 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)||G(p1))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 467 transition count 293
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 182 rules applied. Total rules applied 344 place count 305 transition count 273
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 356 place count 293 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 356 place count 293 transition count 215
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 472 place count 235 transition count 215
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 478 place count 229 transition count 209
Iterating global reduction 3 with 6 rules applied. Total rules applied 484 place count 229 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 484 place count 229 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 492 place count 225 transition count 205
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 660 place count 141 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 661 place count 140 transition count 109
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 14 rules applied. Total rules applied 675 place count 130 transition count 105
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 679 place count 126 transition count 105
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 679 place count 126 transition count 100
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 689 place count 121 transition count 100
Applied a total of 689 rules in 31 ms. Remains 121 /468 variables (removed 347) and now considering 100/456 (removed 356) transitions.
// Phase 1: matrix 100 rows 121 cols
[2023-03-12 14:05:54] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-12 14:05:54] [INFO ] Implicit Places using invariants in 66 ms returned [52, 72, 92, 98, 102, 106, 111, 115, 120]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 69 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/468 places, 100/456 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 105 transition count 93
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 105 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 104 transition count 92
Applied a total of 16 rules in 4 ms. Remains 104 /112 variables (removed 8) and now considering 92/100 (removed 8) transitions.
// Phase 1: matrix 92 rows 104 cols
[2023-03-12 14:05:54] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-12 14:05:54] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-12 14:05:54] [INFO ] Invariant cache hit.
[2023-03-12 14:05:54] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 14:05:54] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 104/468 places, 92/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 283 ms. Remains : 104/468 places, 92/456 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1), p1:(AND (OR (EQ s9 0) (EQ s90 1)) (OR (EQ s33 0) (EQ s5 1)))], nbAcceptance=2, 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 3421 reset in 165 ms.
Stack based approach found an accepted trace after 43754 steps with 1494 reset with depth 8 and stack size 8 in 97 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-02 finished in 595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F((p0&&G(p1)))) U (!p0&&F(!p2))))'
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 164 place count 467 transition count 291
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 185 rules applied. Total rules applied 349 place count 303 transition count 270
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 361 place count 291 transition count 270
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 361 place count 291 transition count 212
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 477 place count 233 transition count 212
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 484 place count 226 transition count 205
Iterating global reduction 3 with 7 rules applied. Total rules applied 491 place count 226 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 491 place count 226 transition count 201
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 499 place count 222 transition count 201
Performed 79 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 657 place count 143 transition count 112
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 658 place count 143 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 660 place count 142 transition count 110
Applied a total of 660 rules in 31 ms. Remains 142 /468 variables (removed 326) and now considering 110/456 (removed 346) transitions.
// Phase 1: matrix 110 rows 142 cols
[2023-03-12 14:05:55] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-12 14:05:55] [INFO ] Implicit Places using invariants in 142 ms returned [50, 51, 52, 53, 54, 57, 58, 59, 60, 61, 116, 122, 128, 134, 141]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 143 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/468 places, 110/456 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 100
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 117 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 114 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 114 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 36 place count 109 transition count 92
Applied a total of 36 rules in 8 ms. Remains 109 /127 variables (removed 18) and now considering 92/110 (removed 18) transitions.
// Phase 1: matrix 92 rows 109 cols
[2023-03-12 14:05:55] [INFO ] Computed 25 place invariants in 0 ms
[2023-03-12 14:05:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-12 14:05:55] [INFO ] Invariant cache hit.
[2023-03-12 14:05:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-12 14:05:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/468 places, 92/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 109/468 places, 92/456 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR p0 p2), (OR (NOT p1) (NOT p0)), p2, (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s39 1), p2:(OR (EQ s53 0) (EQ s67 1)), p1:(OR (EQ s0 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 9181 reset in 155 ms.
Stack based approach found an accepted trace after 5192 steps with 483 reset with depth 6 and stack size 6 in 7 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-11 finished in 807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 455 transition count 443
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 455 transition count 443
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 455 transition count 441
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 451 transition count 437
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 451 transition count 437
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 450 transition count 436
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 450 transition count 436
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 449 transition count 435
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 449 transition count 435
Applied a total of 40 rules in 99 ms. Remains 449 /468 variables (removed 19) and now considering 435/456 (removed 21) transitions.
// Phase 1: matrix 435 rows 449 cols
[2023-03-12 14:05:55] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-12 14:05:56] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-12 14:05:56] [INFO ] Invariant cache hit.
[2023-03-12 14:05:56] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-12 14:05:56] [INFO ] Invariant cache hit.
[2023-03-12 14:05:56] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 449/468 places, 435/456 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 911 ms. Remains : 449/468 places, 435/456 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (NEQ s208 0) (NEQ s102 1)), p0:(OR (EQ s108 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-12 finished in 1054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G((p1&&F(p2)))||G(p0))))))'
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 467 transition count 295
Reduce places removed 160 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 181 rules applied. Total rules applied 341 place count 307 transition count 274
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 354 place count 295 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 294 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 355 place count 294 transition count 215
Deduced a syphon composed of 58 places in 2 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 471 place count 236 transition count 215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 478 place count 229 transition count 208
Iterating global reduction 4 with 7 rules applied. Total rules applied 485 place count 229 transition count 208
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 485 place count 229 transition count 203
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 495 place count 224 transition count 203
Performed 83 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 661 place count 141 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 662 place count 140 transition count 108
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 669 place count 135 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 671 place count 133 transition count 106
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 671 place count 133 transition count 103
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 677 place count 130 transition count 103
Applied a total of 677 rules in 53 ms. Remains 130 /468 variables (removed 338) and now considering 103/456 (removed 353) transitions.
// Phase 1: matrix 103 rows 130 cols
[2023-03-12 14:05:56] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants in 119 ms returned [103, 109, 115, 120, 124, 129]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/468 places, 103/456 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 99
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 117 transition count 96
Applied a total of 14 rules in 19 ms. Remains 117 /124 variables (removed 7) and now considering 96/103 (removed 7) transitions.
// Phase 1: matrix 96 rows 117 cols
[2023-03-12 14:05:57] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 14:05:57] [INFO ] Invariant cache hit.
[2023-03-12 14:05:57] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants and state equation in 176 ms returned [46, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 269 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/468 places, 96/456 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 115 transition count 94
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 113 transition count 94
Applied a total of 4 rules in 4 ms. Remains 113 /115 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 113 cols
[2023-03-12 14:05:57] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-12 14:05:57] [INFO ] Invariant cache hit.
[2023-03-12 14:05:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 113/468 places, 94/456 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 679 ms. Remains : 113/468 places, 94/456 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s70 0) (NEQ s91 1)), p1:(NEQ s48 1), p2:(NEQ s92 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-14 finished in 942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(p1)))'
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 162 place count 467 transition count 293
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 183 rules applied. Total rules applied 345 place count 305 transition count 272
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 357 place count 293 transition count 272
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 357 place count 293 transition count 214
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 473 place count 235 transition count 214
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 482 place count 226 transition count 205
Iterating global reduction 3 with 9 rules applied. Total rules applied 491 place count 226 transition count 205
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 491 place count 226 transition count 200
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 501 place count 221 transition count 200
Performed 83 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 667 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 668 place count 137 transition count 105
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 14 rules applied. Total rules applied 682 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 686 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 686 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 698 place count 117 transition count 95
Applied a total of 698 rules in 41 ms. Remains 117 /468 variables (removed 351) and now considering 95/456 (removed 361) transitions.
// Phase 1: matrix 95 rows 117 cols
[2023-03-12 14:05:57] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-12 14:05:57] [INFO ] Implicit Places using invariants in 131 ms returned [46, 66, 86, 91, 101, 106, 110, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 133 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/468 places, 95/456 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 104 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 104 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 103 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 96 transition count 82
Applied a total of 26 rules in 10 ms. Remains 96 /109 variables (removed 13) and now considering 82/95 (removed 13) transitions.
// Phase 1: matrix 82 rows 96 cols
[2023-03-12 14:05:58] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-12 14:05:58] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-12 14:05:58] [INFO ] Invariant cache hit.
[2023-03-12 14:05:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-12 14:05:58] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/468 places, 82/456 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 360 ms. Remains : 96/468 places, 82/456 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s43 0), p1:(OR (EQ s91 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-06b-LTLCardinality-15 finished in 673 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1&&F(p2))))))'
Found a Lengthening insensitive property : AutoFlight-PT-06b-LTLCardinality-00
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 5 out of 468 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 467 transition count 297
Reduce places removed 158 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 178 rules applied. Total rules applied 336 place count 309 transition count 277
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 350 place count 297 transition count 275
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 352 place count 295 transition count 275
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 57 Pre rules applied. Total rules applied 352 place count 295 transition count 218
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 466 place count 238 transition count 218
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 471 place count 233 transition count 213
Iterating global reduction 4 with 5 rules applied. Total rules applied 476 place count 233 transition count 213
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 476 place count 233 transition count 210
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 482 place count 230 transition count 210
Performed 86 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 654 place count 144 transition count 113
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 655 place count 144 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 656 place count 143 transition count 112
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 670 place count 133 transition count 108
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 674 place count 129 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 674 place count 129 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 686 place count 123 transition count 102
Applied a total of 686 rules in 56 ms. Remains 123 /468 variables (removed 345) and now considering 102/456 (removed 354) transitions.
// Phase 1: matrix 102 rows 123 cols
[2023-03-12 14:05:59] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-12 14:05:59] [INFO ] Implicit Places using invariants in 314 ms returned [50, 70, 97, 107, 112, 122]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 330 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/468 places, 102/456 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 113 transition count 98
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 113 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 109 transition count 94
Applied a total of 16 rules in 4 ms. Remains 109 /117 variables (removed 8) and now considering 94/102 (removed 8) transitions.
// Phase 1: matrix 94 rows 109 cols
[2023-03-12 14:05:59] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-12 14:05:59] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-12 14:05:59] [INFO ] Invariant cache hit.
[2023-03-12 14:05:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 14:05:59] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 109/468 places, 94/456 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 776 ms. Remains : 109/468 places, 94/456 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s7 1), p1:(OR (EQ s13 0) (EQ s107 1)), p2:(OR (EQ s98 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 25276 steps with 7174 reset in 57 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-00 finished in 1381 ms.
FORMULA AutoFlight-PT-06b-LTLCardinality-00 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' '!((G(p0)||X(F(p1))))'
Found a Shortening insensitive property : AutoFlight-PT-06b-LTLCardinality-01
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 468 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 468/468 places, 456/456 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 467 transition count 294
Reduce places removed 161 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 181 rules applied. Total rules applied 342 place count 306 transition count 274
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 354 place count 295 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 355 place count 294 transition count 273
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 355 place count 294 transition count 215
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 471 place count 236 transition count 215
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 480 place count 227 transition count 206
Iterating global reduction 4 with 9 rules applied. Total rules applied 489 place count 227 transition count 206
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 489 place count 227 transition count 201
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 499 place count 222 transition count 201
Performed 84 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 4 with 168 rules applied. Total rules applied 667 place count 138 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 668 place count 137 transition count 105
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 14 rules applied. Total rules applied 682 place count 127 transition count 101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 686 place count 123 transition count 101
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 686 place count 123 transition count 95
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 698 place count 117 transition count 95
Applied a total of 698 rules in 70 ms. Remains 117 /468 variables (removed 351) and now considering 95/456 (removed 361) transitions.
// Phase 1: matrix 95 rows 117 cols
[2023-03-12 14:06:00] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-12 14:06:00] [INFO ] Implicit Places using invariants in 152 ms returned [47, 67, 87, 92, 102, 107, 111, 116]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 154 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 109/468 places, 95/456 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 103 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 103 transition count 89
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 102 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 102 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 101 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 101 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 100 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 100 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 99 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 99 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 98 transition count 84
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 97 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 97 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 95 transition count 81
Applied a total of 28 rules in 25 ms. Remains 95 /109 variables (removed 14) and now considering 81/95 (removed 14) transitions.
// Phase 1: matrix 81 rows 95 cols
[2023-03-12 14:06:00] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-12 14:06:00] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-12 14:06:00] [INFO ] Invariant cache hit.
[2023-03-12 14:06:00] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 95/468 places, 81/456 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 565 ms. Remains : 95/468 places, 81/456 transitions.
Running random walk in product with property : AutoFlight-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s25 0) (NEQ s86 1)), p0:(OR (EQ s44 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 390 steps with 25 reset in 1 ms.
Treatment of property AutoFlight-PT-06b-LTLCardinality-01 finished in 861 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-12 14:06:00] [INFO ] Flatten gal took : 20 ms
[2023-03-12 14:06:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 14:06:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 468 places, 456 transitions and 1102 arcs took 4 ms.
Total runtime 41023 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1490/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1490/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : AutoFlight-PT-06b-LTLCardinality-00
Could not compute solution for formula : AutoFlight-PT-06b-LTLCardinality-01
BK_STOP 1678629961649
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name AutoFlight-PT-06b-LTLCardinality-00
ltl formula formula --ltl=/tmp/1490/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 468 places, 456 transitions and 1102 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.030 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1490/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name AutoFlight-PT-06b-LTLCardinality-01
ltl formula formula --ltl=/tmp/1490/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 468 places, 456 transitions and 1102 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1490/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="AutoFlight-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-06b, 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 r009-oct2-167813597900459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b 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 '
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 ;