About the Execution of LTSMin+red for AirplaneLD-PT-0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
859.743 | 73249.00 | 103593.00 | 356.10 | FTTFFFFTFFFFTFFF | normal |
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.r464-smll-171620118200267.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 AirplaneLD-PT-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620118200267
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 76K Apr 12 03:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 286K Apr 12 03:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 03:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 127K Apr 12 03:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 31K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 181K Apr 12 03:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 704K Apr 12 03:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108K Apr 12 03:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 646K Apr 12 03:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 433K 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 AirplaneLD-PT-0100-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0100-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717249805455
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:50:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:50:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:50:08] [INFO ] Load time of PNML (sax parser for PT used): 328 ms
[2024-06-01 13:50:08] [INFO ] Transformed 719 places.
[2024-06-01 13:50:08] [INFO ] Transformed 808 transitions.
[2024-06-01 13:50:08] [INFO ] Found NUPN structural information;
[2024-06-01 13:50:08] [INFO ] Parsed PT model containing 719 places and 808 transitions and 3078 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 57 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 302 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA AirplaneLD-PT-0100-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-PT-0100-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 408 out of 417 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 417/417 places, 808/808 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 415 transition count 808
Applied a total of 2 rules in 62 ms. Remains 415 /417 variables (removed 2) and now considering 808/808 (removed 0) transitions.
// Phase 1: matrix 808 rows 415 cols
[2024-06-01 13:50:09] [INFO ] Computed 1 invariants in 110 ms
[2024-06-01 13:50:09] [INFO ] Implicit Places using invariants in 708 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 781 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 414/417 places, 808/808 transitions.
Applied a total of 0 rules in 19 ms. Remains 414 /414 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 902 ms. Remains : 414/417 places, 808/808 transitions.
Support contains 408 out of 414 places after structural reductions.
[2024-06-01 13:50:10] [INFO ] Flatten gal took : 169 ms
[2024-06-01 13:50:10] [INFO ] Flatten gal took : 93 ms
[2024-06-01 13:50:10] [INFO ] Input system was already deterministic with 808 transitions.
RANDOM walk for 40000 steps (5038 resets) in 4254 ms. (9 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (43 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (36 resets) in 227 ms. (175 steps per ms) remains 1/2 properties
// Phase 1: matrix 808 rows 414 cols
[2024-06-01 13:50:12] [INFO ] Computed 0 invariants in 29 ms
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Real declared 100/1222 variables, and 100 constraints, problems are : Problem set: 1 solved, 0 unsolved in 83 ms.
Refiners :[Domain max(s): 100/414 constraints, State Equation: 0/414 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AirplaneLD-PT-0100-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA AirplaneLD-PT-0100-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA AirplaneLD-PT-0100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 414 stabilizing places and 808 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 414 transition count 808
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(p0)||(p0&&F((p1 U (p2||G(p1)))))))'
Support contains 304 out of 414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 414/414 places, 808/808 transitions.
Graph (complete) has 613 edges and 414 vertex of which 312 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.6 ms
Discarding 102 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 312 transition count 609
Applied a total of 100 rules in 45 ms. Remains 312 /414 variables (removed 102) and now considering 609/808 (removed 199) transitions.
// Phase 1: matrix 609 rows 312 cols
[2024-06-01 13:50:12] [INFO ] Computed 0 invariants in 32 ms
[2024-06-01 13:50:12] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-06-01 13:50:12] [INFO ] Invariant cache hit.
[2024-06-01 13:50:13] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 916 ms to find 0 implicit places.
[2024-06-01 13:50:13] [INFO ] Redundant transitions in 44 ms returned []
Running 304 sub problems to find dead transitions.
[2024-06-01 13:50:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 608/915 variables, 307/614 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/915 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 4/919 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/919 variables, 4/622 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 919/921 variables, and 622 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30044 ms.
Refiners :[Domain max(s): 311/312 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/307 variables, 307/307 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/307 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (OVERLAPS) 608/915 variables, 307/614 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/915 variables, 304/918 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/915 variables, 0/918 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (OVERLAPS) 4/919 variables, 4/922 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/919 variables, 4/926 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 919/921 variables, and 926 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30022 ms.
Refiners :[Domain max(s): 311/312 constraints, State Equation: 311/312 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 0/0 constraints]
After SMT, in 61917ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 61927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 312/414 places, 609/808 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62944 ms. Remains : 312/414 places, 609/808 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p0), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-04
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 4 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-04 finished in 63403 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 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 414/414 places, 808/808 transitions.
Graph (complete) has 613 edges and 414 vertex of which 2 are kept as prefixes of interest. Removing 412 places using SCC suffix rule.3 ms
Discarding 412 places :
Also discarding 706 output transitions
Drop transitions (Output transitions of discarded places.) removed 706 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 2 transition count 2
Applied a total of 101 rules in 7 ms. Remains 2 /414 variables (removed 412) and now considering 2/808 (removed 806) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 13:51:16] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:51:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 13:51:16] [INFO ] Invariant cache hit.
[2024-06-01 13:51:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 13:51:16] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/414 places, 2/808 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 2/414 places, 2/808 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-08
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-08 finished in 189 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(F((G(p0)||(p0&&G(F(!p0)))))))'
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 808/808 transitions.
Discarding 394 places :
Symmetric choice reduction at 0 with 394 rule applications. Total rules 394 place count 20 transition count 414
Iterating global reduction 0 with 394 rules applied. Total rules applied 788 place count 20 transition count 414
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 0 with 394 rules applied. Total rules applied 1182 place count 20 transition count 20
Applied a total of 1182 rules in 25 ms. Remains 20 /414 variables (removed 394) and now considering 20/808 (removed 788) transitions.
// Phase 1: matrix 20 rows 20 cols
[2024-06-01 13:51:16] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:51:16] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 13:51:16] [INFO ] Invariant cache hit.
[2024-06-01 13:51:16] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:51:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 6/40 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 169 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 6/40 variables, 6/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 187 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 385ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 386ms
Starting structural reductions in LTL mode, iteration 1 : 20/414 places, 20/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 20/414 places, 20/808 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 402 ms.
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AirplaneLD-PT-0100-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AirplaneLD-PT-0100-LTLCardinality-12 finished in 1345 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(F(p0)))'
Support contains 2 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 808
Discarding 394 places :
Symmetric choice reduction at 1 with 394 rule applications. Total rules 395 place count 19 transition count 414
Iterating global reduction 1 with 394 rules applied. Total rules applied 789 place count 19 transition count 414
Ensure Unique test removed 394 transitions
Reduce isomorphic transitions removed 394 transitions.
Iterating post reduction 1 with 394 rules applied. Total rules applied 1183 place count 19 transition count 20
Applied a total of 1183 rules in 12 ms. Remains 19 /414 variables (removed 395) and now considering 20/808 (removed 788) transitions.
// Phase 1: matrix 20 rows 19 cols
[2024-06-01 13:51:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:51:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 13:51:17] [INFO ] Invariant cache hit.
[2024-06-01 13:51:17] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-06-01 13:51:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/39 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/39 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 19 constraints, problems are : Problem set: 0 solved, 10 unsolved in 109 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 20/34 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 5/39 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 29 constraints, problems are : Problem set: 0 solved, 10 unsolved in 124 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 238ms
Starting structural reductions in LTL mode, iteration 1 : 19/414 places, 20/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 19/414 places, 20/808 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-13
Stuttering criterion allowed to conclude after 30 steps with 12 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-13 finished in 397 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(F(p0))))'
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 808/808 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 413 transition count 808
Discarding 395 places :
Symmetric choice reduction at 1 with 395 rule applications. Total rules 396 place count 18 transition count 413
Iterating global reduction 1 with 395 rules applied. Total rules applied 791 place count 18 transition count 413
Ensure Unique test removed 395 transitions
Reduce isomorphic transitions removed 395 transitions.
Iterating post reduction 1 with 395 rules applied. Total rules applied 1186 place count 18 transition count 18
Applied a total of 1186 rules in 10 ms. Remains 18 /414 variables (removed 396) and now considering 18/808 (removed 790) transitions.
// Phase 1: matrix 18 rows 18 cols
[2024-06-01 13:51:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 13:51:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 13:51:17] [INFO ] Invariant cache hit.
[2024-06-01 13:51:18] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 13:51:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 5/36 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 106 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 18/31 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 5/36 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 27 constraints, problems are : Problem set: 0 solved, 9 unsolved in 105 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 214ms
Starting structural reductions in LTL mode, iteration 1 : 18/414 places, 18/808 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 18/414 places, 18/808 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-PT-0100-LTLCardinality-14
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-PT-0100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-PT-0100-LTLCardinality-14 finished in 404 ms.
All properties solved by simple procedures.
Total runtime 70420 ms.
ITS solved all properties within timeout
BK_STOP 1717249878704
--------------------
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
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="AirplaneLD-PT-0100"
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 AirplaneLD-PT-0100, 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 r464-smll-171620118200267"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0100.tgz
mv AirplaneLD-PT-0100 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 ;