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.r536-tall-171690532900668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Sudoku-PT-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532900668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 42M
-rw-r--r-- 1 mcc users 813K Apr 12 11:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Apr 12 10:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Apr 12 10:14 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 379K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.6M Apr 12 12:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0M Apr 12 11:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.1M Apr 12 11:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 78K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 191K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.2M 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-PT-AN13-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717273658411

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:27:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:27:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:27:39] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-06-01 20:27:39] [INFO ] Transformed 2704 places.
[2024-06-01 20:27:39] [INFO ] Transformed 2197 transitions.
[2024-06-01 20:27:39] [INFO ] Found NUPN structural information;
[2024-06-01 20:27:39] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 310 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 161 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN13-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 153 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2024-06-01 20:27:41] [INFO ] Computed 38 invariants in 112 ms
[2024-06-01 20:27:42] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-06-01 20:27:42] [INFO ] Invariant cache hit.
[2024-06-01 20:27:44] [INFO ] Implicit Places using invariants and state equation in 2576 ms returned []
Implicit Place search using SMT with State Equation took 3025 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 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3205 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2024-06-01 20:27:45] [INFO ] Flatten gal took : 460 ms
[2024-06-01 20:27:49] [INFO ] Flatten gal took : 434 ms
[2024-06-01 20:27:52] [INFO ] Input system was already deterministic with 2197 transitions.
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 589 steps (0 resets) in 849 ms. (0 steps per ms) remains 0/11 properties
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 19 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:27:53] [INFO ] Invariant cache hit.
[2024-06-01 20:27:53] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 20:27:53] [INFO ] Invariant cache hit.
[2024-06-01 20:27:56] [INFO ] Implicit Places using invariants and state equation in 2535 ms returned []
Implicit Place search using SMT with State Equation took 2660 ms to find 0 implicit places.
[2024-06-01 20:27:56] [INFO ] Redundant transitions in 106 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 2794 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-00
Stuttering criterion allowed to conclude after 148 steps with 0 reset in 31 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-00 finished in 3115 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 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 17 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:27:56] [INFO ] Invariant cache hit.
[2024-06-01 20:27:56] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 20:27:56] [INFO ] Invariant cache hit.
[2024-06-01 20:27:59] [INFO ] Implicit Places using invariants and state equation in 2482 ms returned []
Implicit Place search using SMT with State Equation took 2607 ms to find 0 implicit places.
[2024-06-01 20:27:59] [INFO ] Redundant transitions in 85 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 2719 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-01
Stuttering criterion allowed to conclude after 149 steps with 0 reset in 33 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-01 finished in 2831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((p0&&G(p1)))||X(F(p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 7 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:27:59] [INFO ] Invariant cache hit.
[2024-06-01 20:27:59] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 20:27:59] [INFO ] Invariant cache hit.
[2024-06-01 20:28:02] [INFO ] Implicit Places using invariants and state equation in 2460 ms returned []
Implicit Place search using SMT with State Equation took 2579 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 2589 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-02
Product exploration timeout after 48770 steps with 24385 reset in 10002 ms.
Product exploration timeout after 48560 steps with 24280 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-02 finished in 24729 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((F(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:28:24] [INFO ] Invariant cache hit.
[2024-06-01 20:28:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 20:28:24] [INFO ] Invariant cache hit.
[2024-06-01 20:28:26] [INFO ] Implicit Places using invariants and state equation in 2577 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
[2024-06-01 20:28:26] [INFO ] Redundant transitions in 46 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 2767 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-03
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 25 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-03 finished in 2920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:28:27] [INFO ] Invariant cache hit.
[2024-06-01 20:28:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 20:28:27] [INFO ] Invariant cache hit.
[2024-06-01 20:28:29] [INFO ] Implicit Places using invariants and state equation in 2702 ms returned []
Implicit Place search using SMT with State Equation took 2827 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 2835 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-04
Product exploration timeout after 71280 steps with 976 reset in 10001 ms.
Product exploration timeout after 71580 steps with 939 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 596 steps (0 resets) in 135 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:28:52] [INFO ] Invariant cache hit.
[2024-06-01 20:28:52] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-01 20:28:52] [INFO ] Invariant cache hit.
[2024-06-01 20:28:55] [INFO ] Implicit Places using invariants and state equation in 2413 ms returned []
Implicit Place search using SMT with State Equation took 2533 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 2543 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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 : [p1, (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 584 steps (0 resets) in 118 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Product exploration timeout after 35230 steps with 11743 reset in 10002 ms.
Product exploration timeout after 35170 steps with 11723 reset in 10002 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 14 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:29:18] [INFO ] Redundant transitions in 46 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 68 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:29:18] [INFO ] Invariant cache hit.
[2024-06-01 20:29:18] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-01 20:29:18] [INFO ] Invariant cache hit.
[2024-06-01 20:29:20] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 2659 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 2665 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLFireability-04 finished in 54918 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)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:29:21] [INFO ] Invariant cache hit.
[2024-06-01 20:29:22] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-01 20:29:22] [INFO ] Invariant cache hit.
[2024-06-01 20:29:24] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 2669 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 2674 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-05
Entered a terminal (fully accepting) state of product in 153 steps with 0 reset in 23 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-05 finished in 2800 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 U F(p0)) U p0))||X((X(p0) U p0)))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:29:24] [INFO ] Invariant cache hit.
[2024-06-01 20:29:24] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-01 20:29:24] [INFO ] Invariant cache hit.
[2024-06-01 20:29:27] [INFO ] Implicit Places using invariants and state equation in 2559 ms returned []
Implicit Place search using SMT with State Equation took 2701 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 2709 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, false, false, p0, (NOT p0), (NOT p0), false, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-07
Product exploration timeout after 35160 steps with 11720 reset in 10005 ms.
Product exploration timeout after 35650 steps with 11883 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 8 states, 10 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 599 steps (0 resets) in 119 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 216 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 :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 6 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:29:50] [INFO ] Invariant cache hit.
[2024-06-01 20:29:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 20:29:50] [INFO ] Invariant cache hit.
[2024-06-01 20:29:53] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 2507 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 2515 ms. Remains : 507/507 places, 2197/2197 transitions.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 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 270 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
RANDOM walk for 584 steps (0 resets) in 121 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 80 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 121 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration timeout after 35940 steps with 11980 reset in 10001 ms.
Product exploration timeout after 35730 steps with 11910 reset in 10005 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 16 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:30:16] [INFO ] Redundant transitions in 44 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 70 ms. Remains : 507/507 places, 2197/2197 transitions.
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 3 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:30:16] [INFO ] Invariant cache hit.
[2024-06-01 20:30:16] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 20:30:16] [INFO ] Invariant cache hit.
[2024-06-01 20:30:18] [INFO ] Implicit Places using invariants and state equation in 2387 ms returned []
Implicit Place search using SMT with State Equation took 2499 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 2503 ms. Remains : 507/507 places, 2197/2197 transitions.
Treatment of property Sudoku-PT-AN13-LTLFireability-07 finished in 54655 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(F(p0))&&F(p1)))))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 137 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:30:19] [INFO ] Invariant cache hit.
[2024-06-01 20:30:22] [INFO ] Implicit Places using invariants in 3065 ms returned []
[2024-06-01 20:30:22] [INFO ] Invariant cache hit.
[2024-06-01 20:30:43] [INFO ] Implicit Places using invariants and state equation in 21275 ms returned []
Implicit Place search using SMT with State Equation took 24344 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 24483 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-09
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 26 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-09 finished in 24748 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 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 116 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:30:44] [INFO ] Invariant cache hit.
[2024-06-01 20:30:47] [INFO ] Implicit Places using invariants in 3293 ms returned []
[2024-06-01 20:30:47] [INFO ] Invariant cache hit.
[2024-06-01 20:31:19] [INFO ] Implicit Places using invariants and state equation in 31557 ms returned []
Implicit Place search using SMT with State Equation took 34853 ms to find 0 implicit places.
[2024-06-01 20:31:19] [INFO ] Redundant transitions in 43 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 35023 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-10
Product exploration timeout after 74560 steps with 502 reset in 10002 ms.
Product exploration timeout after 74480 steps with 502 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 31 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-PT-AN13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-10 finished in 55487 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)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 54 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:31:39] [INFO ] Invariant cache hit.
[2024-06-01 20:31:42] [INFO ] Implicit Places using invariants in 3046 ms returned []
[2024-06-01 20:31:42] [INFO ] Invariant cache hit.
[2024-06-01 20:32:12] [INFO ] Implicit Places using invariants and state equation in 29278 ms returned []
Implicit Place search using SMT with State Equation took 32325 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 32380 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-11 finished in 32483 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 U G((!p1 U X(p0))))) U X(p2)))'
Support contains 12 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 104 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:32:12] [INFO ] Invariant cache hit.
[2024-06-01 20:32:15] [INFO ] Implicit Places using invariants in 3087 ms returned []
[2024-06-01 20:32:15] [INFO ] Invariant cache hit.
[2024-06-01 20:32:36] [INFO ] Implicit Places using invariants and state equation in 21126 ms returned []
Implicit Place search using SMT with State Equation took 24214 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 24319 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 325 ms :[p2, p2, true, (AND p0 p2), (AND p0 p2), (AND p0 p2), false, p0, false]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-12 finished in 24672 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)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 51 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:32:36] [INFO ] Invariant cache hit.
[2024-06-01 20:32:40] [INFO ] Implicit Places using invariants in 3381 ms returned []
[2024-06-01 20:32:40] [INFO ] Invariant cache hit.
[2024-06-01 20:33:11] [INFO ] Implicit Places using invariants and state equation in 30897 ms returned []
Implicit Place search using SMT with State Equation took 34281 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 34334 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-13
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 14 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-13 finished in 34509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 47 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:33:11] [INFO ] Invariant cache hit.
[2024-06-01 20:33:14] [INFO ] Implicit Places using invariants in 3236 ms returned []
[2024-06-01 20:33:14] [INFO ] Invariant cache hit.
[2024-06-01 20:33:36] [INFO ] Implicit Places using invariants and state equation in 21910 ms returned []
Implicit Place search using SMT with State Equation took 25155 ms to find 0 implicit places.
[2024-06-01 20:33:36] [INFO ] Redundant transitions in 49 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 25256 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-14
Product exploration timeout after 33590 steps with 1261 reset in 10004 ms.
Product exploration timeout after 34080 steps with 1241 reset in 10004 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-14 finished in 45722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U !p0))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 42 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2024-06-01 20:33:57] [INFO ] Invariant cache hit.
[2024-06-01 20:34:00] [INFO ] Implicit Places using invariants in 3284 ms returned []
[2024-06-01 20:34:00] [INFO ] Invariant cache hit.
[2024-06-01 20:34:29] [INFO ] Implicit Places using invariants and state equation in 28730 ms returned []
Implicit Place search using SMT with State Equation took 32016 ms to find 0 implicit places.
[2024-06-01 20:34:29] [INFO ] Redundant transitions in 41 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 32110 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 191 ms :[p0, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-15
Product exploration timeout after 42570 steps with 830 reset in 10002 ms.
Product exploration timeout after 42050 steps with 820 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
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, (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-15 finished in 52715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p1&&X(p1)))))'
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 U F(p0)) U p0))||X((X(p0) U p0)))))'
[2024-06-01 20:34:50] [INFO ] Flatten gal took : 223 ms
[2024-06-01 20:34:50] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 100 ms.
[2024-06-01 20:34:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 507 places, 2197 transitions and 6591 arcs took 11 ms.
Total runtime 430991 ms.
There are residual formulas that ITS could not solve within timeout

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
mcc2024

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-PT-AN13"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Sudoku-PT-AN13, 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 r536-tall-171690532900668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN13.tgz
mv Sudoku-PT-AN13 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 ;