fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690530400459
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Sudoku-COL-AN07

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13056.539 3600000.00 11723445.00 4447.70 FFT??T?TTFFF?FFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690530400459.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Sudoku-COL-AN07, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530400459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K Apr 12 11:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 11:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 12 11:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 11:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN07-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717030079981

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 00:48:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 00:48:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:48:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-30 00:48:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-30 00:48:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 554 ms
[2024-05-30 00:48:01] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 490 PT places and 343.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-30 00:48:01] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 4 ms.
[2024-05-30 00:48:02] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 8 formulas.
FORMULA Sudoku-COL-AN07-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40184 steps (784 resets) in 210 ms. (190 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40184 steps (784 resets) in 111 ms. (358 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 90 ms. (441 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 85 ms. (467 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 75 ms. (528 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40184 steps (784 resets) in 77 ms. (515 steps per ms) remains 5/5 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 00:48:02] [INFO ] Computed 3 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 5 solved, 0 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
FORMULA Sudoku-COL-AN07-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:48:02] [INFO ] Flatten gal took : 1 ms
Domain [N(7), N(7)] of place Rows breaks symmetries in sort N
[2024-05-30 00:48:02] [INFO ] Unfolded HLPN to a Petri net with 490 places and 343 transitions 1372 arcs in 21 ms.
[2024-05-30 00:48:02] [INFO ] Unfolded 6 HLPN properties in 1 ms.
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
// Phase 1: matrix 343 rows 490 cols
[2024-05-30 00:48:02] [INFO ] Computed 147 invariants in 23 ms
[2024-05-30 00:48:02] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-30 00:48:02] [INFO ] Invariant cache hit.
[2024-05-30 00:48:03] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 561 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 582 ms. Remains : 490/490 places, 343/343 transitions.
Support contains 490 out of 490 places after structural reductions.
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:48:03] [INFO ] Flatten gal took : 55 ms
[2024-05-30 00:48:03] [INFO ] Input system was already deterministic with 343 transitions.
RANDOM walk for 40000 steps (934 resets) in 2825 ms. (14 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
[2024-05-30 00:48:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
After SMT solving in domain Real declared 490/833 variables, and 147 constraints, problems are : Problem set: 3 solved, 0 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 147/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 375ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Sudoku-COL-AN07-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 5 simplifications.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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(X(X(X(G(p0))))))'
Support contains 490 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:05] [INFO ] Invariant cache hit.
[2024-05-30 00:48:05] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-30 00:48:05] [INFO ] Invariant cache hit.
[2024-05-30 00:48:05] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 325 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 338 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 303 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA Sudoku-COL-AN07-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN07-LTLCardinality-00 finished in 699 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 26 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:05] [INFO ] Invariant cache hit.
[2024-05-30 00:48:06] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-30 00:48:06] [INFO ] Invariant cache hit.
[2024-05-30 00:48:06] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-30 00:48:06] [INFO ] Redundant transitions in 17 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 612 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-03
Product exploration explored 100000 steps with 2347 reset in 3827 ms.
Product exploration explored 100000 steps with 2346 reset in 3785 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 12 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-30 00:48:15] [INFO ] Invariant cache hit.
[2024-05-30 00:48:16] [INFO ] [Real]Absence check using 147 positive place invariants in 54 ms returned sat
[2024-05-30 00:48:16] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2024-05-30 00:48:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:48:17] [INFO ] [Nat]Absence check using 147 positive place invariants in 308 ms returned sat
[2024-05-30 00:48:18] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-05-30 00:48:18] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-30 00:48:18] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 26 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:18] [INFO ] Invariant cache hit.
[2024-05-30 00:48:18] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-30 00:48:18] [INFO ] Invariant cache hit.
[2024-05-30 00:48:19] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-05-30 00:48:19] [INFO ] Redundant transitions in 8 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 632 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 18 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-30 00:48:20] [INFO ] Invariant cache hit.
[2024-05-30 00:48:21] [INFO ] [Real]Absence check using 147 positive place invariants in 39 ms returned sat
[2024-05-30 00:48:21] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2024-05-30 00:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:48:22] [INFO ] [Nat]Absence check using 147 positive place invariants in 303 ms returned sat
[2024-05-30 00:48:23] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2024-05-30 00:48:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 00:48:23] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2347 reset in 3694 ms.
Product exploration explored 100000 steps with 2348 reset in 3732 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 30 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:30] [INFO ] Invariant cache hit.
[2024-05-30 00:48:31] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-30 00:48:31] [INFO ] Invariant cache hit.
[2024-05-30 00:48:31] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-30 00:48:31] [INFO ] Redundant transitions in 14 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 564 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-03 finished in 25810 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 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:31] [INFO ] Invariant cache hit.
[2024-05-30 00:48:31] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-30 00:48:31] [INFO ] Invariant cache hit.
[2024-05-30 00:48:32] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
[2024-05-30 00:48:32] [INFO ] Redundant transitions in 4 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 701 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-04
Product exploration explored 100000 steps with 3846 reset in 4015 ms.
Product exploration explored 100000 steps with 3846 reset in 4043 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 16 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-30 00:48:41] [INFO ] Invariant cache hit.
[2024-05-30 00:48:43] [INFO ] [Real]Absence check using 147 positive place invariants in 51 ms returned sat
[2024-05-30 00:48:43] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2024-05-30 00:48:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:48:44] [INFO ] [Nat]Absence check using 147 positive place invariants in 291 ms returned sat
[2024-05-30 00:48:45] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2024-05-30 00:48:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-30 00:48:45] [INFO ] Added : 0 causal constraints over 0 iterations in 63 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:45] [INFO ] Invariant cache hit.
[2024-05-30 00:48:45] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-30 00:48:45] [INFO ] Invariant cache hit.
[2024-05-30 00:48:45] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-30 00:48:45] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 100 steps (0 resets) in 12 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-30 00:48:47] [INFO ] Invariant cache hit.
[2024-05-30 00:48:48] [INFO ] [Real]Absence check using 147 positive place invariants in 43 ms returned sat
[2024-05-30 00:48:48] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-30 00:48:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:48:49] [INFO ] [Nat]Absence check using 147 positive place invariants in 247 ms returned sat
[2024-05-30 00:48:50] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-30 00:48:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-30 00:48:50] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3911 ms.
Product exploration explored 100000 steps with 3846 reset in 4013 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 9 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:58] [INFO ] Invariant cache hit.
[2024-05-30 00:48:58] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-30 00:48:58] [INFO ] Invariant cache hit.
[2024-05-30 00:48:58] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-30 00:48:58] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-04 finished in 27232 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)||(p1&&X(p2)))))'
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 2 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:48:58] [INFO ] Invariant cache hit.
[2024-05-30 00:48:58] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-30 00:48:58] [INFO ] Invariant cache hit.
[2024-05-30 00:48:59] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 400 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 404 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 8326 ms.
Product exploration explored 100000 steps with 3846 reset in 8361 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 625 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (938 resets) in 3256 ms. (12 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1368 ms. (29 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1629 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 916 ms. (43 steps per ms) remains 3/3 properties
[2024-05-30 00:49:31] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 98 constraints, problems are : Problem set: 3 solved, 0 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 508ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1734 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 10 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:49:33] [INFO ] Invariant cache hit.
[2024-05-30 00:49:34] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-30 00:49:34] [INFO ] Invariant cache hit.
[2024-05-30 00:49:34] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-30 00:49:34] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 303 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (938 resets) in 1658 ms. (24 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 880 ms. (45 steps per ms) remains 1/1 properties
[2024-05-30 00:49:42] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 16 factoid took 451 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 5362 ms.
Product exploration explored 100000 steps with 3846 reset in 5384 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:49:54] [INFO ] Invariant cache hit.
[2024-05-30 00:49:54] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-30 00:49:54] [INFO ] Invariant cache hit.
[2024-05-30 00:49:54] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2024-05-30 00:49:54] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 530 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-06 finished in 55871 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:49:54] [INFO ] Invariant cache hit.
[2024-05-30 00:49:54] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-30 00:49:54] [INFO ] Invariant cache hit.
[2024-05-30 00:49:55] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-30 00:49:55] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 529 ms. Remains : 490/490 places, 343/343 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-12
Product exploration explored 100000 steps with 3846 reset in 3909 ms.
Product exploration explored 100000 steps with 3846 reset in 3958 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 14 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
[2024-05-30 00:50:04] [INFO ] Invariant cache hit.
[2024-05-30 00:50:05] [INFO ] [Real]Absence check using 147 positive place invariants in 39 ms returned sat
[2024-05-30 00:50:05] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-30 00:50:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:50:06] [INFO ] [Nat]Absence check using 147 positive place invariants in 287 ms returned sat
[2024-05-30 00:50:07] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-30 00:50:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-30 00:50:07] [INFO ] Added : 0 causal constraints over 0 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 14 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:50:07] [INFO ] Invariant cache hit.
[2024-05-30 00:50:07] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-30 00:50:07] [INFO ] Invariant cache hit.
[2024-05-30 00:50:07] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
[2024-05-30 00:50:07] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 537 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 100 steps (0 resets) in 13 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
[2024-05-30 00:50:09] [INFO ] Invariant cache hit.
[2024-05-30 00:50:10] [INFO ] [Real]Absence check using 147 positive place invariants in 41 ms returned sat
[2024-05-30 00:50:10] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-30 00:50:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 00:50:11] [INFO ] [Nat]Absence check using 147 positive place invariants in 290 ms returned sat
[2024-05-30 00:50:11] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2024-05-30 00:50:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-30 00:50:11] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3846 reset in 3922 ms.
Product exploration explored 100000 steps with 3846 reset in 3966 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 12 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:50:19] [INFO ] Invariant cache hit.
[2024-05-30 00:50:19] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-30 00:50:19] [INFO ] Invariant cache hit.
[2024-05-30 00:50:20] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
[2024-05-30 00:50:20] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 539 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-12 finished in 25668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(p1&&X(p2)))))'
Found a Shortening insensitive property : Sudoku-COL-AN07-LTLCardinality-06
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 441 out of 490 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 6 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:50:20] [INFO ] Invariant cache hit.
[2024-05-30 00:50:20] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-30 00:50:20] [INFO ] Invariant cache hit.
[2024-05-30 00:50:21] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 407 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 LI_LTL mode , in 1 iterations and 415 ms. Remains : 490/490 places, 343/343 transitions.
Running random walk in product with property : Sudoku-COL-AN07-LTLCardinality-06
Product exploration explored 100000 steps with 3846 reset in 8574 ms.
Product exploration explored 100000 steps with 3846 reset in 8639 ms.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 615 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (936 resets) in 2743 ms. (14 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1270 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1265 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 898 ms. (44 steps per ms) remains 3/3 properties
[2024-05-30 00:50:54] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 441/833 variables, and 98 constraints, problems are : Problem set: 3 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 98/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 402ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (AND p0 p1))), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 29 factoid took 1761 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
Support contains 392 out of 490 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 15 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:50:56] [INFO ] Invariant cache hit.
[2024-05-30 00:50:57] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-30 00:50:57] [INFO ] Invariant cache hit.
[2024-05-30 00:50:57] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-30 00:50:57] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 490/490 places, 343/343 transitions.
Computed a total of 490 stabilizing places and 343 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 490 transition count 343
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 p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 310 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, false]
RANDOM walk for 40000 steps (938 resets) in 1740 ms. (22 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 983 ms. (40 steps per ms) remains 1/1 properties
[2024-05-30 00:51:05] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
After SMT solving in domain Real declared 392/833 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 0/147 constraints, State Equation: 0/490 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 16 factoid took 437 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false]
Product exploration explored 100000 steps with 3846 reset in 5318 ms.
Product exploration explored 100000 steps with 3846 reset in 5371 ms.
Support contains 392 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 343/343 transitions.
Applied a total of 0 rules in 5 ms. Remains 490 /490 variables (removed 0) and now considering 343/343 (removed 0) transitions.
[2024-05-30 00:51:16] [INFO ] Invariant cache hit.
[2024-05-30 00:51:16] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-30 00:51:16] [INFO ] Invariant cache hit.
[2024-05-30 00:51:17] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-30 00:51:17] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 524 ms. Remains : 490/490 places, 343/343 transitions.
Treatment of property Sudoku-COL-AN07-LTLCardinality-06 finished in 56581 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)))'
[2024-05-30 00:51:17] [INFO ] Flatten gal took : 30 ms
[2024-05-30 00:51:17] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-30 00:51:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 343 transitions and 1372 arcs took 7 ms.
Total runtime 196244 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN07

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 490
TRANSITIONS: 343
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.003s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1388
MODEL NAME: /home/mcc/execution/411/model
490 places, 343 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-COL-AN07"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Sudoku-COL-AN07, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690530400459"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN07.tgz
mv Sudoku-COL-AN07 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;