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-171690530500532.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-AN16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530500532
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.5K Apr 12 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 10:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 10:23 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:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 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-AN16-LTLFireability-00
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-01
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-02
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-03
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-04
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-05
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-06
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-07
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-08
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-09
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-10
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-11
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-12
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-13
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-14
FORMULA_NAME Sudoku-COL-AN16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717049103107

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 06:05:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 06:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 06:05:04] [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-30 06:05:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 06:05:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 516 ms
[2024-05-30 06:05:04] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4864 PT places and 4096.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 06:05:05] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 06:05:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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 1 properties that can be checked using skeleton over-approximation.
FORMULA Sudoku-COL-AN16-LTLFireability-05 FALSE 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).
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-30 06:05:05] [INFO ] Flatten gal took : 11 ms
[2024-05-30 06:05:05] [INFO ] Flatten gal took : 1 ms
Domain [N(16), N(16)] of place Rows breaks symmetries in sort N
[2024-05-30 06:05:05] [INFO ] Unfolded HLPN to a Petri net with 4864 places and 4096 transitions 16384 arcs in 72 ms.
[2024-05-30 06:05:05] [INFO ] Unfolded 15 HLPN properties in 20 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-COL-AN16-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN16-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 768 out of 4864 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Reduce places removed 4096 places and 0 transitions.
Iterating post reduction 0 with 4096 rules applied. Total rules applied 4096 place count 768 transition count 4096
Applied a total of 4096 rules in 91 ms. Remains 768 /4864 variables (removed 4096) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 768 cols
[2024-05-30 06:05:14] [INFO ] Computed 47 invariants in 415 ms
[2024-05-30 06:05:15] [INFO ] Implicit Places using invariants in 724 ms returned []
[2024-05-30 06:05:15] [INFO ] Invariant cache hit.
[2024-05-30 06:05:30] [INFO ] Implicit Places using invariants and state equation in 15669 ms returned []
Implicit Place search using SMT with State Equation took 16451 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 2ms
Starting structural reductions in LTL mode, iteration 1 : 768/4864 places, 4096/4096 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16568 ms. Remains : 768/4864 places, 4096/4096 transitions.
Support contains 768 out of 768 places after structural reductions.
[2024-05-30 06:05:32] [INFO ] Flatten gal took : 675 ms
[2024-05-30 06:05:35] [INFO ] Flatten gal took : 685 ms
[2024-05-30 06:05:39] [INFO ] Input system was already deterministic with 4096 transitions.
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 897 steps (0 resets) in 1443 ms. (0 steps per ms) remains 0/1 properties
FORMULA Sudoku-COL-AN16-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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((!p0&&X((G(F(p0))&&p1)))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:05:45] [INFO ] Invariant cache hit.
[2024-05-30 06:05:46] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-30 06:05:46] [INFO ] Invariant cache hit.
[2024-05-30 06:06:02] [INFO ] Implicit Places using invariants and state equation in 16019 ms returned []
Implicit Place search using SMT with State Equation took 16164 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 16175 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 446 ms :[true, true, true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-00 finished in 18245 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 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 34 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:06:04] [INFO ] Invariant cache hit.
[2024-05-30 06:06:04] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-30 06:06:04] [INFO ] Invariant cache hit.
[2024-05-30 06:06:20] [INFO ] Implicit Places using invariants and state equation in 16096 ms returned []
Implicit Place search using SMT with State Equation took 16238 ms to find 0 implicit places.
[2024-05-30 06:06:20] [INFO ] Redundant transitions in 250 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 16531 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-01
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 98 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-01 finished in 16749 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 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 38 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:06:20] [INFO ] Invariant cache hit.
[2024-05-30 06:06:21] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 06:06:21] [INFO ] Invariant cache hit.
[2024-05-30 06:06:37] [INFO ] Implicit Places using invariants and state equation in 16283 ms returned []
Implicit Place search using SMT with State Equation took 16430 ms to find 0 implicit places.
[2024-05-30 06:06:37] [INFO ] Redundant transitions in 211 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 16691 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-03
Stuttering criterion allowed to conclude after 222 steps with 0 reset in 60 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-03 finished in 16864 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 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 17 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:06:37] [INFO ] Invariant cache hit.
[2024-05-30 06:06:37] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-30 06:06:37] [INFO ] Invariant cache hit.
[2024-05-30 06:06:53] [INFO ] Implicit Places using invariants and state equation in 16025 ms returned []
Implicit Place search using SMT with State Equation took 16159 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 16179 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-08
Product exploration timeout after 28580 steps with 14290 reset in 10004 ms.
Product exploration timeout after 28460 steps with 14230 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 28 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-AN16-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-08 finished in 41144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!p0))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 15 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:07:18] [INFO ] Invariant cache hit.
[2024-05-30 06:07:19] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-30 06:07:19] [INFO ] Invariant cache hit.
[2024-05-30 06:07:35] [INFO ] Implicit Places using invariants and state equation in 16490 ms returned []
Implicit Place search using SMT with State Equation took 16639 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 16655 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-09
Product exploration timeout after 19490 steps with 4872 reset in 10002 ms.
Product exploration timeout after 19690 steps with 4922 reset in 10005 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[p0, p0, p0, p0, true]
RANDOM walk for 903 steps (0 resets) in 302 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 214 ms :[p0, p0, p0, p0, true]
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 9 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:08:01] [INFO ] Invariant cache hit.
[2024-05-30 06:08:01] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-30 06:08:01] [INFO ] Invariant cache hit.
[2024-05-30 06:08:17] [INFO ] Implicit Places using invariants and state equation in 15747 ms returned []
Implicit Place search using SMT with State Equation took 15900 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 15911 ms. Remains : 768/768 places, 4096/4096 transitions.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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 : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0, p0, true]
RANDOM walk for 917 steps (0 resets) in 345 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 192 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, p0, true]
Product exploration timeout after 18870 steps with 4717 reset in 10003 ms.
Product exploration timeout after 18900 steps with 4725 reset in 10005 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0, true]
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 32 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:08:43] [INFO ] Redundant transitions in 138 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 185 ms. Remains : 768/768 places, 4096/4096 transitions.
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 5 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:08:43] [INFO ] Invariant cache hit.
[2024-05-30 06:08:43] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-30 06:08:43] [INFO ] Invariant cache hit.
[2024-05-30 06:08:59] [INFO ] Implicit Places using invariants and state equation in 15694 ms returned []
Implicit Place search using SMT with State Equation took 15865 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 15871 ms. Remains : 768/768 places, 4096/4096 transitions.
Treatment of property Sudoku-COL-AN16-LTLFireability-09 finished in 101869 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 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 41 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:09:00] [INFO ] Invariant cache hit.
[2024-05-30 06:09:00] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-30 06:09:00] [INFO ] Invariant cache hit.
[2024-05-30 06:09:17] [INFO ] Implicit Places using invariants and state equation in 16424 ms returned []
Implicit Place search using SMT with State Equation took 16562 ms to find 0 implicit places.
[2024-05-30 06:09:17] [INFO ] Redundant transitions in 143 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 16753 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-11
Product exploration timeout after 40750 steps with 180 reset in 10001 ms.
Product exploration timeout after 41420 steps with 183 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN16-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-11 finished in 41449 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(!p0))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 8 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:09:42] [INFO ] Invariant cache hit.
[2024-05-30 06:09:42] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-30 06:09:42] [INFO ] Invariant cache hit.
[2024-05-30 06:09:58] [INFO ] Implicit Places using invariants and state equation in 16019 ms returned []
Implicit Place search using SMT with State Equation took 16157 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 16169 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 86 ms :[p0, p0, true]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-12
Product exploration timeout after 28830 steps with 14415 reset in 10002 ms.
Product exploration timeout after 27740 steps with 13870 reset in 10002 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-12 finished in 40987 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 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 27 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:10:23] [INFO ] Invariant cache hit.
[2024-05-30 06:10:23] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-30 06:10:23] [INFO ] Invariant cache hit.
[2024-05-30 06:10:40] [INFO ] Implicit Places using invariants and state equation in 16812 ms returned []
Implicit Place search using SMT with State Equation took 16970 ms to find 0 implicit places.
[2024-05-30 06:10:40] [INFO ] Redundant transitions in 145 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 17152 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-14
Product exploration timeout after 39680 steps with 175 reset in 10004 ms.
Product exploration timeout after 39360 steps with 174 reset in 10003 ms.
Computed a total of 768 stabilizing places and 4096 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 768 transition count 4096
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)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-COL-AN16-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-COL-AN16-LTLFireability-14 finished in 42040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&F(G(!p0))))))'
Support contains 768 out of 768 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 768/768 places, 4096/4096 transitions.
Applied a total of 0 rules in 6 ms. Remains 768 /768 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
[2024-05-30 06:11:05] [INFO ] Invariant cache hit.
[2024-05-30 06:11:05] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-30 06:11:05] [INFO ] Invariant cache hit.
[2024-05-30 06:11:21] [INFO ] Implicit Places using invariants and state equation in 16149 ms returned []
Implicit Place search using SMT with State Equation took 16311 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 16333 ms. Remains : 768/768 places, 4096/4096 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-COL-AN16-LTLFireability-15
Entered a terminal (fully accepting) state of product in 220 steps with 0 reset in 55 ms.
FORMULA Sudoku-COL-AN16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN16-LTLFireability-15 finished in 17494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(!p0))))'
[2024-05-30 06:11:23] [INFO ] Flatten gal took : 194 ms
[2024-05-30 06:11:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 47 ms.
[2024-05-30 06:11:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 768 places, 4096 transitions and 12288 arcs took 23 ms.
Total runtime 378833 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 768
TRANSITIONS: 4096
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.070s, Sys 0.002s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.004s]


----------------------------------------------------------------------
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: 1007
MODEL NAME: /home/mcc/execution/410/model
768 places, 4096 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//
++ 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="Sudoku-COL-AN16"
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 Sudoku-COL-AN16, 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 r399-tall-171690530500532"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN16.tgz
mv Sudoku-COL-AN16 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;