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.r400-tall-171690532900660.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 itstools
Input is Sudoku-PT-AN12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532900660
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 53M
-rw-r--r-- 1 mcc users 604K Apr 12 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.7M Apr 12 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 12 11:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.4M Apr 12 11:05 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 308K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 810K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 393K Apr 12 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Apr 12 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9M Apr 12 11:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29M Apr 12 11:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 84K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 207K 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 963K 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-AN12-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717058001277

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 08:33:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 08:33:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:33:22] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-30 08:33:22] [INFO ] Transformed 2160 places.
[2024-05-30 08:33:22] [INFO ] Transformed 1728 transitions.
[2024-05-30 08:33:22] [INFO ] Found NUPN structural information;
[2024-05-30 08:33:22] [INFO ] Parsed PT model containing 2160 places and 1728 transitions and 6912 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 114 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Sudoku-PT-AN12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 432 out of 2160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2160/2160 places, 1728/1728 transitions.
Reduce places removed 1728 places and 0 transitions.
Iterating post reduction 0 with 1728 rules applied. Total rules applied 1728 place count 432 transition count 1728
Applied a total of 1728 rules in 45 ms. Remains 432 /2160 variables (removed 1728) and now considering 1728/1728 (removed 0) transitions.
// Phase 1: matrix 1728 rows 432 cols
[2024-05-30 08:33:26] [INFO ] Computed 35 invariants in 105 ms
[2024-05-30 08:33:27] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-30 08:33:27] [INFO ] Invariant cache hit.
[2024-05-30 08:33:27] [INFO ] Implicit Places using invariants and state equation in 667 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LTL mode, iteration 1 : 432/2160 places, 1728/1728 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1088 ms. Remains : 432/2160 places, 1728/1728 transitions.
Support contains 432 out of 432 places after structural reductions.
[2024-05-30 08:33:28] [INFO ] Flatten gal took : 374 ms
[2024-05-30 08:33:31] [INFO ] Flatten gal took : 384 ms
[2024-05-30 08:33:33] [INFO ] Input system was already deterministic with 1728 transitions.
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 501 steps (0 resets) in 332 ms. (1 steps per ms) remains 0/17 properties
FORMULA Sudoku-PT-AN12-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Sudoku-PT-AN12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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(X(G(p0))))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:33:35] [INFO ] Invariant cache hit.
[2024-05-30 08:33:35] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 08:33:35] [INFO ] Invariant cache hit.
[2024-05-30 08:33:36] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 764 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 773 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-00
Entered a terminal (fully accepting) state of product in 126 steps with 0 reset in 16 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-00 finished in 1290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((X(p1)||p0)))&&F(p1))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:33:36] [INFO ] Invariant cache hit.
[2024-05-30 08:33:36] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-30 08:33:36] [INFO ] Invariant cache hit.
[2024-05-30 08:33:37] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 745 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-03
Product exploration timeout after 96690 steps with 767 reset in 10002 ms.
Product exploration timeout after 97070 steps with 770 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-03 finished in 37791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p0)))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 4 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:34:14] [INFO ] Invariant cache hit.
[2024-05-30 08:34:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-30 08:34:14] [INFO ] Invariant cache hit.
[2024-05-30 08:34:15] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 743 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 749 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-04
Product exploration timeout after 63380 steps with 31690 reset in 10001 ms.
Product exploration timeout after 63680 steps with 31840 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-04 finished in 36554 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)&&F(p1))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 19 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:34:51] [INFO ] Invariant cache hit.
[2024-05-30 08:34:51] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 08:34:51] [INFO ] Invariant cache hit.
[2024-05-30 08:34:51] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
[2024-05-30 08:34:51] [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 793 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-06
Product exploration timeout after 99530 steps with 790 reset in 10002 ms.
Product exploration timeout after 98050 steps with 778 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
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 p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 501 steps (0 resets) in 70 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-06 finished in 37456 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(p0))&&p0) U (X(p0) U p0))))'
Support contains 432 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 3 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:35:28] [INFO ] Invariant cache hit.
[2024-05-30 08:35:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 08:35:28] [INFO ] Invariant cache hit.
[2024-05-30 08:35:29] [INFO ] Implicit Places using invariants and state equation in 578 ms returned []
Implicit Place search using SMT with State Equation took 682 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 687 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-07
Product exploration timeout after 64150 steps with 32075 reset in 10001 ms.
Product exploration timeout after 63630 steps with 31815 reset in 10001 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-07 finished in 36747 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((X(p1)||p0))||X(F(p2)))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 89 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:36:05] [INFO ] Invariant cache hit.
[2024-05-30 08:36:07] [INFO ] Implicit Places using invariants in 2351 ms returned []
[2024-05-30 08:36:07] [INFO ] Invariant cache hit.
[2024-05-30 08:36:15] [INFO ] Implicit Places using invariants and state equation in 7733 ms returned []
Implicit Place search using SMT with State Equation took 10088 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 10177 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-08
Product exploration timeout after 55980 steps with 1386 reset in 10002 ms.
Product exploration timeout after 54790 steps with 1405 reset in 10002 ms.
Computed a total of 432 stabilizing places and 1728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 432 transition count 1728
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (F (G p0)), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN12-LTLFireability-08 finished in 44778 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 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 40 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:36:50] [INFO ] Invariant cache hit.
[2024-05-30 08:36:52] [INFO ] Implicit Places using invariants in 2236 ms returned []
[2024-05-30 08:36:52] [INFO ] Invariant cache hit.
[2024-05-30 08:37:00] [INFO ] Implicit Places using invariants and state equation in 8068 ms returned []
Implicit Place search using SMT with State Equation took 10307 ms to find 0 implicit places.
[2024-05-30 08:37:00] [INFO ] Redundant transitions in 87 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 10445 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-09
Stuttering criterion allowed to conclude after 122 steps with 0 reset in 18 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-09 finished in 10519 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||G((F(G(p1))&&F(p2))))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 62 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:37:00] [INFO ] Invariant cache hit.
[2024-05-30 08:37:02] [INFO ] Implicit Places using invariants in 2215 ms returned []
[2024-05-30 08:37:02] [INFO ] Invariant cache hit.
[2024-05-30 08:37:10] [INFO ] Implicit Places using invariants and state equation in 7906 ms returned []
Implicit Place search using SMT with State Equation took 10123 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 10198 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-10
Stuttering criterion allowed to conclude after 126 steps with 0 reset in 15 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-10 finished in 10396 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||X(F(p1)))))'
Support contains 6 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 31 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:37:10] [INFO ] Invariant cache hit.
[2024-05-30 08:37:13] [INFO ] Implicit Places using invariants in 2282 ms returned []
[2024-05-30 08:37:13] [INFO ] Invariant cache hit.
[2024-05-30 08:37:20] [INFO ] Implicit Places using invariants and state equation in 7726 ms returned []
Implicit Place search using SMT with State Equation took 10013 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 10047 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-13
Stuttering criterion allowed to conclude after 781 steps with 325 reset in 119 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-13 finished in 10310 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||F(p1))&&(F(p1)||X(p2))))))'
Support contains 9 out of 432 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 40 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:37:21] [INFO ] Invariant cache hit.
[2024-05-30 08:37:23] [INFO ] Implicit Places using invariants in 2196 ms returned []
[2024-05-30 08:37:23] [INFO ] Invariant cache hit.
[2024-05-30 08:37:31] [INFO ] Implicit Places using invariants and state equation in 8300 ms returned []
Implicit Place search using SMT with State Equation took 10500 ms to find 0 implicit places.
[2024-05-30 08:37:31] [INFO ] Redundant transitions in 32 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 10587 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-14
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 19 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-14 finished in 10735 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))&&(G(p1)||F(G(p2)))))'
Support contains 8 out of 432 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 432/432 places, 1728/1728 transitions.
Applied a total of 0 rules in 33 ms. Remains 432 /432 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2024-05-30 08:37:31] [INFO ] Invariant cache hit.
[2024-05-30 08:37:34] [INFO ] Implicit Places using invariants in 2235 ms returned []
[2024-05-30 08:37:34] [INFO ] Invariant cache hit.
[2024-05-30 08:37:42] [INFO ] Implicit Places using invariants and state equation in 8273 ms returned []
Implicit Place search using SMT with State Equation took 10511 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 10547 ms. Remains : 432/432 places, 1728/1728 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : Sudoku-PT-AN12-LTLFireability-15
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN12-LTLFireability-15 finished in 10720 ms.
All properties solved by simple procedures.
Total runtime 260263 ms.

BK_STOP 1717058263011

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-AN12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Sudoku-PT-AN12, 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 r400-tall-171690532900660"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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