Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620166900075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620166900075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 22:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 22:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 22:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K May 18 16:42 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-02a-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717182913005

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-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:15:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:15:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:15:15] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-31 19:15:15] [INFO ] Transformed 57 places.
[2024-05-31 19:15:15] [INFO ] Transformed 55 transitions.
[2024-05-31 19:15:15] [INFO ] Found NUPN structural information;
[2024-05-31 19:15:15] [INFO ] Parsed PT model containing 57 places and 55 transitions and 180 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA AutoFlight-PT-02a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 45/45 transitions.
Applied a total of 0 rules in 24 ms. Remains 57 /57 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 57 cols
[2024-05-31 19:15:15] [INFO ] Computed 16 invariants in 18 ms
[2024-05-31 19:15:15] [INFO ] Implicit Places using invariants in 423 ms returned [7, 14, 17, 20, 42, 48, 56]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 491 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/57 places, 45/45 transitions.
Applied a total of 0 rules in 19 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 592 ms. Remains : 50/57 places, 45/45 transitions.
Support contains 21 out of 50 places after structural reductions.
[2024-05-31 19:15:16] [INFO ] Flatten gal took : 44 ms
[2024-05-31 19:15:16] [INFO ] Flatten gal took : 20 ms
[2024-05-31 19:15:16] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (1637 resets) in 2476 ms. (16 steps per ms) remains 3/16 properties
BEST_FIRST walk for 40004 steps (739 resets) in 517 ms. (77 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (503 resets) in 229 ms. (173 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
// Phase 1: matrix 45 rows 50 cols
[2024-05-31 19:15:17] [INFO ] Computed 9 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 32/37 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 32/41 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 13/50 variables, 5/47 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 13/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 45/95 variables, 50/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/95 variables, 0/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 110 constraints, problems are : Problem set: 2 solved, 1 unsolved in 229 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/4 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 46/50 variables, 8/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 46/59 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 1/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 45/95 variables, 50/110 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/95 variables, 1/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/95 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/95 variables, 0/111 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 111 constraints, problems are : Problem set: 2 solved, 1 unsolved in 119 ms.
Refiners :[Domain max(s): 50/50 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 384ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA AutoFlight-PT-02a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-02a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 50 transition count 32
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 37 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 35 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 35 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 33 transition count 28
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 27 transition count 22
Applied a total of 46 rules in 41 ms. Remains 27 /50 variables (removed 23) and now considering 22/45 (removed 23) transitions.
// Phase 1: matrix 22 rows 27 cols
[2024-05-31 19:15:18] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 19:15:18] [INFO ] Implicit Places using invariants in 75 ms returned [9, 10, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 79 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/50 places, 22/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 21
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 22 transition count 20
Applied a total of 4 rules in 5 ms. Remains 22 /24 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-31 19:15:18] [INFO ] Computed 6 invariants in 1 ms
[2024-05-31 19:15:18] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 19:15:18] [INFO ] Invariant cache hit.
[2024-05-31 19:15:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 19:15:18] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/50 places, 20/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 280 ms. Remains : 22/50 places, 20/45 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-01
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-01 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((!p1 U (p2||G(!p1)))))&&p0)))'
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 44
Applied a total of 2 rules in 8 ms. Remains 49 /50 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-31 19:15:18] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 19:15:18] [INFO ] Implicit Places using invariants in 64 ms returned [28, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 14 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2024-05-31 19:15:18] [INFO ] Computed 7 invariants in 3 ms
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 19:15:19] [INFO ] Invariant cache hit.
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/50 places, 36/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 233 ms. Remains : 39/50 places, 36/45 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), true, (AND (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-02
Stuttering criterion allowed to conclude after 53 steps with 2 reset in 2 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-02 finished in 503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 49 transition count 28
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 33 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 33 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 29 transition count 26
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 40 place count 29 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 42 place count 27 transition count 24
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 43 place count 26 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 26 transition count 23
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 56 place count 20 transition count 17
Applied a total of 56 rules in 15 ms. Remains 20 /50 variables (removed 30) and now considering 17/45 (removed 28) transitions.
// Phase 1: matrix 17 rows 20 cols
[2024-05-31 19:15:19] [INFO ] Computed 7 invariants in 0 ms
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants in 37 ms returned [11, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/50 places, 17/45 transitions.
Applied a total of 0 rules in 7 ms. Remains 18 /18 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 62 ms. Remains : 18/50 places, 17/45 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-03
Stuttering criterion allowed to conclude after 60 steps with 0 reset in 7 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-03 finished in 187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 44
Applied a total of 2 rules in 8 ms. Remains 49 /50 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-31 19:15:19] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants in 82 ms returned [28, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Applied a total of 12 rules in 14 ms. Remains 41 /47 variables (removed 6) and now considering 38/44 (removed 6) transitions.
// Phase 1: matrix 38 rows 41 cols
[2024-05-31 19:15:19] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 19:15:19] [INFO ] Invariant cache hit.
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 41/50 places, 38/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 290 ms. Remains : 41/50 places, 38/45 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-04 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U (!p1 U X(p2))))'
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 50 cols
[2024-05-31 19:15:20] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 19:15:20] [INFO ] Implicit Places using invariants in 77 ms returned [28, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 79 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/50 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 43
Applied a total of 4 rules in 6 ms. Remains 46 /48 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 46 cols
[2024-05-31 19:15:20] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 19:15:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 19:15:20] [INFO ] Invariant cache hit.
[2024-05-31 19:15:20] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/50 places, 43/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 238 ms. Remains : 46/50 places, 43/45 transitions.
Stuttering acceptance computed with spot in 248 ms :[p2, p2, p2, true]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 25 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02a-LTLCardinality-05 finished in 1100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(p1))))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 50 cols
[2024-05-31 19:15:21] [INFO ] Computed 9 invariants in 4 ms
[2024-05-31 19:15:21] [INFO ] Implicit Places using invariants in 87 ms returned [28, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/50 places, 45/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 46 transition count 43
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 43
Applied a total of 4 rules in 5 ms. Remains 46 /48 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 46 cols
[2024-05-31 19:15:21] [INFO ] Computed 7 invariants in 6 ms
[2024-05-31 19:15:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 19:15:21] [INFO ] Invariant cache hit.
[2024-05-31 19:15:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 46/50 places, 43/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 296 ms. Remains : 46/50 places, 43/45 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-06
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 269 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 172 steps (6 resets) in 7 ms. (21 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
[2024-05-31 19:15:23] [INFO ] Invariant cache hit.
[2024-05-31 19:15:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-31 19:15:23] [INFO ] Invariant cache hit.
[2024-05-31 19:15:23] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-31 19:15:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/89 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 0/89 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 53 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1288 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/89 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 42/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 95 constraints, problems are : Problem set: 0 solved, 42 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 2455ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 2458ms
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 46/46 places, 43/43 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 159 steps (5 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 158 ms.
Product exploration explored 100000 steps with 25000 reset in 170 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 46 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 13 place count 46 transition count 43
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 46 transition count 43
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 26 place count 36 transition count 33
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 36 place count 36 transition count 33
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 36 transition count 33
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 34 transition count 31
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 34 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 34 transition count 49
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 33 transition count 45
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 33 transition count 45
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 49 rules in 24 ms. Remains 33 /46 variables (removed 13) and now considering 45/43 (removed -2) transitions.
[2024-05-31 19:15:27] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
// Phase 1: matrix 45 rows 33 cols
[2024-05-31 19:15:27] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 19:15:27] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
[2024-05-31 19:15:28] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 7/14 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 45/78 variables, 33/47 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 12/59 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/59 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/59 constraints. Problems are: Problem set: 13 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 59 constraints, problems are : Problem set: 13 solved, 28 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 13 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 11/33 variables, 7/7 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 7/14 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 45/78 variables, 33/47 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 12/59 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 28/87 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/87 constraints. Problems are: Problem set: 13 solved, 28 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/87 constraints. Problems are: Problem set: 13 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 87 constraints, problems are : Problem set: 13 solved, 28 unsolved in 599 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 28/41 constraints, Known Traps: 7/7 constraints]
After SMT, in 1751ms problems are : Problem set: 13 solved, 28 unsolved
Search for dead transitions found 13 dead transitions in 1754ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/46 places, 32/43 transitions.
Graph (complete) has 77 edges and 33 vertex of which 23 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 23 /33 variables (removed 10) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/46 places, 32/43 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1802 ms. Remains : 23/46 places, 32/43 transitions.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 46 cols
[2024-05-31 19:15:29] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 19:15:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 19:15:29] [INFO ] Invariant cache hit.
[2024-05-31 19:15:29] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 42 sub problems to find dead transitions.
[2024-05-31 19:15:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/89 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (OVERLAPS) 0/89 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 53 constraints, problems are : Problem set: 0 solved, 42 unsolved in 936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 43/89 variables, 46/53 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 42/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/89 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 95 constraints, problems are : Problem set: 0 solved, 42 unsolved in 848 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1814ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1816ms
Finished structural reductions in LTL mode , in 1 iterations and 1983 ms. Remains : 46/46 places, 43/43 transitions.
Treatment of property AutoFlight-PT-02a-LTLCardinality-06 finished in 10416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 44
Applied a total of 2 rules in 2 ms. Remains 49 /50 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-31 19:15:31] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 19:15:31] [INFO ] Implicit Places using invariants in 53 ms returned [28, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 54 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 42 transition count 39
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 42 transition count 39
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 41 transition count 38
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 41 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 37
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 37
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 39 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 39 transition count 36
Applied a total of 16 rules in 18 ms. Remains 39 /47 variables (removed 8) and now considering 36/44 (removed 8) transitions.
// Phase 1: matrix 36 rows 39 cols
[2024-05-31 19:15:31] [INFO ] Computed 7 invariants in 1 ms
[2024-05-31 19:15:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 19:15:31] [INFO ] Invariant cache hit.
[2024-05-31 19:15:31] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 39/50 places, 36/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 174 ms. Remains : 39/50 places, 36/45 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutoFlight-PT-02a-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutoFlight-PT-02a-LTLCardinality-12 finished in 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 45/45 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 44
Applied a total of 2 rules in 2 ms. Remains 49 /50 variables (removed 1) and now considering 44/45 (removed 1) transitions.
// Phase 1: matrix 44 rows 49 cols
[2024-05-31 19:15:32] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 19:15:32] [INFO ] Implicit Places using invariants in 54 ms returned [28, 47]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 56 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/50 places, 44/45 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 42
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 44 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 44 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 43 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 43 transition count 40
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 40/44 (removed 4) transitions.
// Phase 1: matrix 40 rows 43 cols
[2024-05-31 19:15:32] [INFO ] Computed 7 invariants in 0 ms
[2024-05-31 19:15:32] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 19:15:32] [INFO ] Invariant cache hit.
[2024-05-31 19:15:32] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/50 places, 40/45 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 176 ms. Remains : 43/50 places, 40/45 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-02a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-02a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-02a-LTLCardinality-13 finished in 379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X(F(p1))))))'
[2024-05-31 19:15:32] [INFO ] Flatten gal took : 10 ms
[2024-05-31 19:15:32] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 19:15:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50 places, 45 transitions and 122 arcs took 7 ms.
Total runtime 18023 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA AutoFlight-PT-02a-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717182933170

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name AutoFlight-PT-02a-LTLCardinality-06
ltl formula formula --ltl=/tmp/956/ltl_0_
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 50 places, 45 transitions and 122 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.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/956/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/956/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/956/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/956/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 52 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 51, there are 56 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 53
pnml2lts-mc( 0/ 4): unique states count: 53
pnml2lts-mc( 0/ 4): unique transitions count: 156
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 144
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 68
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 68 states 295 transitions, fanout: 4.338
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.0 B/state, compr.: 13.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 45 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-02a"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-02a, 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 r468-smll-171620166900075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-02a.tgz
mv AutoFlight-PT-02a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;