About the Execution of GreatSPN+red for NQueens-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
412.012 | 19766.00 | 28366.00 | 205.70 | FFFTFTTTTTFTTTFF | 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.r245-tall-171654349700356.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 greatspnxred
Input is NQueens-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349700356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K 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:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 03:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 03:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 96K May 18 16:43 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 NQueens-PT-10-LTLFireability-00
FORMULA_NAME NQueens-PT-10-LTLFireability-01
FORMULA_NAME NQueens-PT-10-LTLFireability-02
FORMULA_NAME NQueens-PT-10-LTLFireability-03
FORMULA_NAME NQueens-PT-10-LTLFireability-04
FORMULA_NAME NQueens-PT-10-LTLFireability-05
FORMULA_NAME NQueens-PT-10-LTLFireability-06
FORMULA_NAME NQueens-PT-10-LTLFireability-07
FORMULA_NAME NQueens-PT-10-LTLFireability-08
FORMULA_NAME NQueens-PT-10-LTLFireability-09
FORMULA_NAME NQueens-PT-10-LTLFireability-10
FORMULA_NAME NQueens-PT-10-LTLFireability-11
FORMULA_NAME NQueens-PT-10-LTLFireability-12
FORMULA_NAME NQueens-PT-10-LTLFireability-13
FORMULA_NAME NQueens-PT-10-LTLFireability-14
FORMULA_NAME NQueens-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716656160094
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:56:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 16:56:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:56:01] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-25 16:56:01] [INFO ] Transformed 160 places.
[2024-05-25 16:56:01] [INFO ] Transformed 100 transitions.
[2024-05-25 16:56:01] [INFO ] Found NUPN structural information;
[2024-05-25 16:56:01] [INFO ] Parsed PT model containing 160 places and 100 transitions and 500 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-10-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 58 transition count 100
Applied a total of 100 rules in 15 ms. Remains 58 /158 variables (removed 100) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 58 cols
[2024-05-25 16:56:01] [INFO ] Computed 7 invariants in 15 ms
[2024-05-25 16:56:01] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-25 16:56:01] [INFO ] Invariant cache hit.
[2024-05-25 16:56:02] [INFO ] Implicit Places using invariants and state equation in 703 ms returned [20, 38, 39, 57]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 955 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 54/158 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 987 ms. Remains : 54/158 places, 100/100 transitions.
Support contains 45 out of 54 places after structural reductions.
[2024-05-25 16:56:02] [INFO ] Flatten gal took : 35 ms
[2024-05-25 16:56:02] [INFO ] Flatten gal took : 15 ms
[2024-05-25 16:56:02] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 40 out of 54 places (down from 45) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 27 steps (0 resets) in 14 ms. (1 steps per ms) remains 0/18 properties
FORMULA NQueens-PT-10-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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' '!(F((F(G(p1))&&p0)))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:03] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-25 16:56:03] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:03] [INFO ] Invariants computation overflowed in 13 ms
[2024-05-25 16:56:04] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 1049 ms to find 0 implicit places.
[2024-05-25 16:56:04] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1069 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-00 finished in 1349 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(p0) U X(!p1)))'
Support contains 8 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:04] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-25 16:56:04] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:04] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-25 16:56:05] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1014 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 250 ms :[p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-01
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-01 finished in 1289 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((G(p1)||p0)))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:05] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-25 16:56:05] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:05] [INFO ] Invariants computation overflowed in 9 ms
[2024-05-25 16:56:06] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-05-25 16:56:06] [INFO ] Redundant transitions in 3 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 946 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-02
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-02 finished in 1071 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((X((X(F(p2))&&p1))||p0)))'
Support contains 12 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:06] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-25 16:56:06] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:06] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-25 16:56:07] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-03
Product exploration explored 100000 steps with 29213 reset in 1230 ms.
Product exploration explored 100000 steps with 29227 reset in 1173 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 : [(AND (NOT p0) (NOT p2) (NOT p1)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-03 finished in 3432 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((G(p0)&&X((X(G(p1))||(!p0 U (p2||G(!p0))))))))'
Support contains 11 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:10] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-25 16:56:10] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:10] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-25 16:56:11] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 916 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-04
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-04 finished in 1340 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 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:11] [INFO ] Invariants computation overflowed in 3 ms
[2024-05-25 16:56:11] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:11] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-25 16:56:12] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2024-05-25 16:56:12] [INFO ] Redundant transitions in 3 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1022 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-05
Product exploration explored 100000 steps with 18355 reset in 875 ms.
Product exploration explored 100000 steps with 18476 reset in 910 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-05 finished in 2977 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(G((X(F(p1))||p0))))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:14] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-25 16:56:14] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:14] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-25 16:56:15] [INFO ] Implicit Places using invariants and state equation in 949 ms returned []
Implicit Place search using SMT with State Equation took 1016 ms to find 0 implicit places.
[2024-05-25 16:56:15] [INFO ] Redundant transitions in 3 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1035 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-10-LTLFireability-06
Product exploration explored 100000 steps with 10689 reset in 695 ms.
Product exploration explored 100000 steps with 10686 reset in 700 ms.
Computed a total of 54 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND 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 3 factoid took 19 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-10-LTLFireability-06 finished in 2620 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 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:17] [INFO ] Invariants computation overflowed in 4 ms
[2024-05-25 16:56:17] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:17] [INFO ] Invariants computation overflowed in 2 ms
[2024-05-25 16:56:18] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2024-05-25 16:56:18] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1255 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-10
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-10 finished in 1351 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(F(p1))))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:18] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-25 16:56:18] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2024-05-25 16:56:18] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-25 16:56:19] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 877 ms. Remains : 54/54 places, 100/100 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-10-LTLFireability-15
Stuttering criterion allowed to conclude after 14 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-LTLFireability-15 finished in 1019 ms.
All properties solved by simple procedures.
Total runtime 18291 ms.
ITS solved all properties within timeout
BK_STOP 1716656179860
--------------------
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 LTLFireability -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="NQueens-PT-10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NQueens-PT-10, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349700356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-10.tgz
mv NQueens-PT-10 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;