About the Execution of GreatSPN+red for Sudoku-COL-AN05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12293.447 | 3600000.00 | 11042074.00 | 5120.90 | FTFFTFTFTTF?F?FT | 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.r399-tall-171690530400443.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 Sudoku-COL-AN05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530400443
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 11:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 11:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 11:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 11:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN05-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717025851150
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN05
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:37:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 23:37:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:37:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-29 23:37:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:37:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 516 ms
[2024-05-29 23:37:32] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 200 PT places and 125.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-29 23:37:33] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-29 23:37:33] [INFO ] Skeletonized 16 HLPN properties in 8 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN05-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40064 steps (1480 resets) in 256 ms. (155 steps per ms) remains 2/15 properties
BEST_FIRST walk for 40064 steps (1480 resets) in 91 ms. (435 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40064 steps (1480 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-29 23:37:33] [INFO ] Computed 3 invariants in 8 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 2 solved, 0 unsolved in 84 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 124ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-29 23:37:33] [INFO ] Flatten gal took : 12 ms
[2024-05-29 23:37:33] [INFO ] Flatten gal took : 2 ms
Domain [N(5), N(5)] of place Rows breaks symmetries in sort N
[2024-05-29 23:37:33] [INFO ] Unfolded HLPN to a Petri net with 200 places and 125 transitions 500 arcs in 13 ms.
[2024-05-29 23:37:33] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 200 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-29 23:37:33] [INFO ] Computed 75 invariants in 13 ms
[2024-05-29 23:37:33] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-29 23:37:33] [INFO ] Invariant cache hit.
[2024-05-29 23:37:33] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 237 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 254 ms. Remains : 200/200 places, 125/125 transitions.
Support contains 200 out of 200 places after structural reductions.
[2024-05-29 23:37:33] [INFO ] Flatten gal took : 21 ms
[2024-05-29 23:37:33] [INFO ] Flatten gal took : 23 ms
[2024-05-29 23:37:33] [INFO ] Input system was already deterministic with 125 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (1818 resets) in 1910 ms. (20 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (40 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
[2024-05-29 23:37:34] [INFO ] Invariant cache hit.
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 200/325 variables, and 75 constraints, problems are : Problem set: 2 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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' '!(X(F((G((p0&&F(p1)))||(p0&&G(F(p1))&&F(!p0))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:35] [INFO ] Invariant cache hit.
[2024-05-29 23:37:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 23:37:35] [INFO ] Invariant cache hit.
[2024-05-29 23:37:35] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 244 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 251 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-02
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 4 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-02 finished in 737 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)))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 12 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:35] [INFO ] Invariant cache hit.
[2024-05-29 23:37:35] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 23:37:35] [INFO ] Invariant cache hit.
[2024-05-29 23:37:36] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-29 23:37:36] [INFO ] Redundant transitions in 4 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 239 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-03
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-03 finished in 290 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||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:36] [INFO ] Invariant cache hit.
[2024-05-29 23:37:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 23:37:36] [INFO ] Invariant cache hit.
[2024-05-29 23:37:36] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 168 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 170 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-05 finished in 332 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&&(p1||X(F(p0))))))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:36] [INFO ] Invariant cache hit.
[2024-05-29 23:37:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 23:37:36] [INFO ] Invariant cache hit.
[2024-05-29 23:37:36] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 220 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 225 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 1310 ms.
Product exploration explored 100000 steps with 33333 reset in 1271 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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 p0 (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 21 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-06 finished in 3171 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)))'
Support contains 125 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:39] [INFO ] Invariant cache hit.
[2024-05-29 23:37:39] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-29 23:37:39] [INFO ] Invariant cache hit.
[2024-05-29 23:37:39] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-29 23:37:39] [INFO ] Redundant transitions in 4 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 252 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-07
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-07 finished in 298 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)&&G(p1))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 14 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-29 23:37:39] [INFO ] Computed 14 invariants in 5 ms
[2024-05-29 23:37:39] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 23:37:39] [INFO ] Invariant cache hit.
[2024-05-29 23:37:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1687 steps with 76 reset in 22 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-10 finished in 291 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)))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-29 23:37:40] [INFO ] Computed 75 invariants in 1 ms
[2024-05-29 23:37:40] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 23:37:40] [INFO ] Invariant cache hit.
[2024-05-29 23:37:40] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-29 23:37:40] [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 220 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 30 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-11
Product exploration explored 100000 steps with 4549 reset in 1234 ms.
Product exploration explored 100000 steps with 4544 reset in 1295 ms.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
RANDOM walk for 52 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 42 ms :[p0]
[2024-05-29 23:37:43] [INFO ] Invariant cache hit.
[2024-05-29 23:37:43] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2024-05-29 23:37:43] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-29 23:37:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 23:37:43] [INFO ] [Nat]Absence check using 75 positive place invariants in 41 ms returned sat
[2024-05-29 23:37:43] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-29 23:37:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-29 23:37:44] [INFO ] Added : 0 causal constraints over 0 iterations in 38 ms. Result :sat
Could not prove EG p0
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:44] [INFO ] Invariant cache hit.
[2024-05-29 23:37:44] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 23:37:44] [INFO ] Invariant cache hit.
[2024-05-29 23:37:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-29 23:37:44] [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 222 ms. Remains : 200/200 places, 125/125 transitions.
Computed a total of 200 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 200 transition count 125
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), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[p0]
RANDOM walk for 52 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
Stuttering acceptance computed with spot in 35 ms :[p0]
[2024-05-29 23:37:44] [INFO ] Invariant cache hit.
[2024-05-29 23:37:44] [INFO ] [Real]Absence check using 75 positive place invariants in 16 ms returned sat
[2024-05-29 23:37:45] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-29 23:37:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 23:37:45] [INFO ] [Nat]Absence check using 75 positive place invariants in 39 ms returned sat
[2024-05-29 23:37:45] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-29 23:37:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 23:37:45] [INFO ] Added : 0 causal constraints over 0 iterations in 26 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 35 ms :[p0]
Product exploration explored 100000 steps with 4549 reset in 1209 ms.
Product exploration explored 100000 steps with 4550 reset in 1231 ms.
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 10 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:47] [INFO ] Invariant cache hit.
[2024-05-29 23:37:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 23:37:47] [INFO ] Invariant cache hit.
[2024-05-29 23:37:48] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-29 23:37:48] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 221 ms. Remains : 200/200 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-11 finished in 7931 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(G(p0))&&F(p1))))'
Support contains 150 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:48] [INFO ] Invariant cache hit.
[2024-05-29 23:37:48] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 23:37:48] [INFO ] Invariant cache hit.
[2024-05-29 23:37:48] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-29 23:37:48] [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
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-12
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-12 finished in 320 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((X(p0)||(F(G(p1))&&(p0 U p1)))))'
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 4 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-29 23:37:48] [INFO ] Computed 14 invariants in 7 ms
[2024-05-29 23:37:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 23:37:48] [INFO ] Invariant cache hit.
[2024-05-29 23:37:48] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-13
Product exploration explored 100000 steps with 33443 reset in 1181 ms.
Product exploration explored 100000 steps with 33357 reset in 1195 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 171 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 12925 steps (584 resets) in 196 ms. (65 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 345 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:52] [INFO ] Invariant cache hit.
[2024-05-29 23:37:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 23:37:52] [INFO ] Invariant cache hit.
[2024-05-29 23:37:52] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 112 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 117 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 164 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 17297 steps (780 resets) in 193 ms. (89 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 355 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 33312 reset in 1197 ms.
Product exploration explored 100000 steps with 33290 reset in 1219 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:56] [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 13 ms. Remains : 75/75 places, 125/125 transitions.
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:56] [INFO ] Invariant cache hit.
[2024-05-29 23:37:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 23:37:56] [INFO ] Invariant cache hit.
[2024-05-29 23:37:57] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 103 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 104 ms. Remains : 75/75 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-13 finished in 8649 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 (G((p0||G(p1)))||(G(p2)&&(p0||G(p1))))))'
Support contains 175 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 200 /200 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 200 cols
[2024-05-29 23:37:57] [INFO ] Computed 75 invariants in 3 ms
[2024-05-29 23:37:57] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 23:37:57] [INFO ] Invariant cache hit.
[2024-05-29 23:37:57] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 23:37:57] [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
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 200/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 45 steps with 1 reset in 0 ms.
FORMULA Sudoku-COL-AN05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN05-LTLCardinality-14 finished in 354 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 25 out of 200 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 75 transition count 125
Applied a total of 125 rules in 2 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 75 cols
[2024-05-29 23:37:57] [INFO ] Computed 14 invariants in 1 ms
[2024-05-29 23:37:57] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 23:37:57] [INFO ] Invariant cache hit.
[2024-05-29 23:37:57] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 128 ms. Remains : 75/200 places, 125/125 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 821 ms.
Product exploration explored 100000 steps with 50000 reset in 874 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN05-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN05-LTLCardinality-15 finished in 1978 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)))'
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((X(p0)||(F(G(p1))&&(p0 U p1)))))'
Found a Lengthening insensitive property : Sudoku-COL-AN05-LTLCardinality-13
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Support contains 50 out of 200 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 200/200 places, 125/125 transitions.
Graph (complete) has 375 edges and 200 vertex of which 75 are kept as prefixes of interest. Removing 125 places using SCC suffix rule.2 ms
Discarding 125 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 75 /200 variables (removed 125) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:37:59] [INFO ] Invariant cache hit.
[2024-05-29 23:37:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 23:37:59] [INFO ] Invariant cache hit.
[2024-05-29 23:37:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LI_LTL mode, iteration 1 : 75/200 places, 125/125 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 110 ms. Remains : 75/200 places, 125/125 transitions.
Running random walk in product with property : Sudoku-COL-AN05-LTLCardinality-13
Product exploration explored 100000 steps with 33263 reset in 1166 ms.
Product exploration explored 100000 steps with 33245 reset in 1209 ms.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 163 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 4105 steps (183 resets) in 59 ms. (68 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 371 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:38:03] [INFO ] Invariant cache hit.
[2024-05-29 23:38:03] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 23:38:03] [INFO ] Invariant cache hit.
[2024-05-29 23:38:03] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 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 103 ms. Remains : 75/75 places, 125/125 transitions.
Computed a total of 75 stabilizing places and 125 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 125
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 p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 9735 steps (438 resets) in 106 ms. (90 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 7 factoid took 357 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 33279 reset in 1205 ms.
Product exploration explored 100000 steps with 33154 reset in 1226 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:38:08] [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
Finished structural reductions in SI_LTL mode , in 1 iterations and 11 ms. Remains : 75/75 places, 125/125 transitions.
Support contains 50 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 125/125 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-29 23:38:08] [INFO ] Invariant cache hit.
[2024-05-29 23:38:08] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 23:38:08] [INFO ] Invariant cache hit.
[2024-05-29 23:38:08] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 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 102 ms. Remains : 75/75 places, 125/125 transitions.
Treatment of property Sudoku-COL-AN05-LTLCardinality-13 finished in 8670 ms.
[2024-05-29 23:38:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 23:38:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 23:38:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 125 transitions and 500 arcs took 4 ms.
Total runtime 35967 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Sudoku-COL-AN05
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 200
TRANSITIONS: 125
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1462
MODEL NAME: /home/mcc/execution/405/model
200 places, 125 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="Sudoku-COL-AN05"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-COL-AN05, 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 r399-tall-171690530400443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN05.tgz
mv Sudoku-COL-AN05 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 ;