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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.3K Apr 12 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 10:03 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.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 10:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 10:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.9K 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-AN01-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717056341135

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 08:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 08:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 08:05:42] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2024-05-30 08:05:42] [INFO ] Transformed 4 places.
[2024-05-30 08:05:42] [INFO ] Transformed 1 transitions.
[2024-05-30 08:05:42] [INFO ] Found NUPN structural information;
[2024-05-30 08:05:42] [INFO ] Parsed PT model containing 4 places and 1 transitions and 4 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN01-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Applied a total of 0 rules in 8 ms. Remains 4 /4 variables (removed 0) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 4 cols
[2024-05-30 08:05:42] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 08:05:42] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 08:05:42] [INFO ] Invariant cache hit.
[2024-05-30 08:05:42] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 175 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 201 ms. Remains : 4/4 places, 1/1 transitions.
Support contains 4 out of 4 places after structural reductions.
[2024-05-30 08:05:42] [INFO ] Flatten gal took : 10 ms
[2024-05-30 08:05:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 08:05:42] [INFO ] Input system was already deterministic with 1 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (20000 resets) in 927 ms. (43 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 275 ms. (144 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 146 ms. (272 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
[2024-05-30 08:05:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 7 constraints, problems are : Problem set: 3 solved, 0 unsolved in 197 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
FORMULA Sudoku-PT-AN01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U X(X(G(p1))))))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 1
Applied a total of 2 rules in 6 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-30 08:05:43] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 08:05:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 08:05:43] [INFO ] Invariant cache hit.
[2024-05-30 08:05:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 481 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (20000 resets) in 158 ms. (251 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
[2024-05-30 08:05:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3/3 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/3 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 31 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-30 08:05:46] [INFO ] Invariant cache hit.
[2024-05-30 08:05:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-30 08:05:46] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-30 08:05:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 08:05:46] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 08:05:46] [INFO ] Invariant cache hit.
[2024-05-30 08:05:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 08:05:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-30 08:05:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 08:05:46] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:46] [INFO ] Invariant cache hit.
[2024-05-30 08:05:46] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-30 08:05:46] [INFO ] Invariant cache hit.
[2024-05-30 08:05:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 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 44 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-30 08:05:47] [INFO ] Invariant cache hit.
[2024-05-30 08:05:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 08:05:47] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-30 08:05:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 08:05:47] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 08:05:47] [INFO ] Invariant cache hit.
[2024-05-30 08:05:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-30 08:05:47] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-30 08:05:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 08:05:47] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Product exploration explored 100000 steps with 50000 reset in 84 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 2 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:48] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7 ms. Remains : 2/2 places, 1/1 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 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 40 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-PT-AN01-LTLCardinality-01 finished in 4627 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)||G(p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-30 08:05:48] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 2/4 places, 1/1 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Sudoku-PT-AN01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN01-LTLCardinality-02 finished in 105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0 U X(X(G(p1))))))))'
Found a Lengthening insensitive property : Sudoku-PT-AN01-LTLCardinality-01
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-30 08:05:48] [INFO ] Invariant cache hit.
[2024-05-30 08:05:48] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 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 LI_LTL mode , in 1 iterations and 41 ms. Remains : 2/4 places, 1/1 transitions.
Running random walk in product with property : Sudoku-PT-AN01-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 74 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
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), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
RANDOM walk for 40000 steps (20000 resets) in 159 ms. (250 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (20000 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
[2024-05-30 08:05:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3/3 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 58 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 2/3 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/2 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 273 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-30 08:05:50] [INFO ] Invariant cache hit.
[2024-05-30 08:05:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 08:05:50] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-30 08:05:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 08:05:50] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 08:05:50] [INFO ] Invariant cache hit.
[2024-05-30 08:05:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-30 08:05:50] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-30 08:05:50] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-30 08:05:50] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:50] [INFO ] Invariant cache hit.
[2024-05-30 08:05:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-30 08:05:50] [INFO ] Invariant cache hit.
[2024-05-30 08:05:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 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 44 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-30 08:05:51] [INFO ] Invariant cache hit.
[2024-05-30 08:05:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 08:05:51] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-30 08:05:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 08:05:51] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-30 08:05:51] [INFO ] Invariant cache hit.
[2024-05-30 08:05:51] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-30 08:05:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-30 08:05:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-30 08:05:51] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 31 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:52] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11 ms. Remains : 2/2 places, 1/1 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-30 08:05:52] [INFO ] Invariant cache hit.
[2024-05-30 08:05:52] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-30 08:05:52] [INFO ] Invariant cache hit.
[2024-05-30 08:05:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 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 42 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property Sudoku-PT-AN01-LTLCardinality-01 finished in 4119 ms.
[2024-05-30 08:05:52] [INFO ] Flatten gal took : 1 ms
[2024-05-30 08:05:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-30 08:05:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 1 transitions and 4 arcs took 4 ms.
Total runtime 10337 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN01

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 4
TRANSITIONS: 1
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.000s]


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


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

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

Process ID: 1205
MODEL NAME: /home/mcc/execution/414/model
4 places, 1 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-PT-AN01-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717056353606

--------------------
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

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-AN01"
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-PT-AN01, 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-171690530600571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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