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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 09:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 09:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717251173487

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:12:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:12:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:12:55] [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-06-01 14:12:55] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:12:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 973 ms
[2024-06-01 14:12:56] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:12:56] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-06-01 14:12:56] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 7 formulas.
FORMULA PermAdmissibility-COL-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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 40000 steps (2352 resets) in 1795 ms. (22 steps per ms) remains 9/23 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 352 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 257 ms. (155 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 111 ms. (357 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
// Phase 1: matrix 16 rows 40 cols
[2024-06-01 14:12:58] [INFO ] Computed 24 invariants in 11 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 23/34 variables, 18/18 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Real declared 40/56 variables, and 24 constraints, problems are : Problem set: 9 solved, 0 unsolved in 282 ms.
Refiners :[Generalized P Invariants (flows): 24/24 constraints, State Equation: 0/40 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 9 simplifications.
FORMULA PermAdmissibility-COL-01-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:12:58] [INFO ] Flatten gal took : 24 ms
[2024-06-01 14:12:58] [INFO ] Flatten gal took : 10 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-06-01 14:12:58] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 23 ms.
[2024-06-01 14:12:58] [INFO ] Unfolded 5 HLPN properties in 0 ms.
Support contains 13 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 24 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-06-01 14:12:58] [INFO ] Computed 16 invariants in 7 ms
[2024-06-01 14:12:58] [INFO ] Implicit Places using invariants in 132 ms returned [4, 5, 7, 12, 14, 16, 22, 23, 26]
[2024-06-01 14:12:58] [INFO ] Actually due to overlaps returned [4, 5, 12, 14, 16, 22, 23]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 149 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 191 ms. Remains : 25/40 places, 16/16 transitions.
Support contains 13 out of 25 places after structural reductions.
[2024-06-01 14:12:58] [INFO ] Flatten gal took : 4 ms
[2024-06-01 14:12:58] [INFO ] Flatten gal took : 5 ms
[2024-06-01 14:12:58] [INFO ] Input system was already deterministic with 16 transitions.
RANDOM walk for 40000 steps (2352 resets) in 137 ms. (289 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40000 steps (2352 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
// Phase 1: matrix 16 rows 25 cols
[2024-06-01 14:12:58] [INFO ] Computed 9 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 19/41 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PermAdmissibility-COL-01-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 16
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(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-06-01 14:12:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:12:59] [INFO ] Implicit Places using invariants in 67 ms returned [4, 5, 10, 11, 13, 18, 19]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 69 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/25 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 72 ms. Remains : 16/25 places, 16/16 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 21 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLCardinality-00 finished in 836 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 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Graph (complete) has 42 edges and 25 vertex of which 21 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 12
Applied a total of 2 rules in 17 ms. Remains 19 /25 variables (removed 6) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 19 cols
[2024-06-01 14:12:59] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:12:59] [INFO ] Implicit Places using invariants in 61 ms returned [4, 5, 8, 9, 11, 16]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/25 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 12 transition count 2
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 2 transition count 1
Applied a total of 20 rules in 8 ms. Remains 2 /13 variables (removed 11) and now considering 1/12 (removed 11) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-06-01 14:12:59] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 14:13:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 14:13:00] [INFO ] Invariant cache hit.
[2024-06-01 14:13:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/25 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 2/25 places, 1/16 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 130 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 : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 99 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 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 10 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 117 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:13:00] [INFO ] Invariant cache hit.
[2024-06-01 14:13:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 14:13:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 14:13:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 14:13:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 14:13:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 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-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 14:13:01] [INFO ] Redundant transitions in 0 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 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 : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X 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 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:13:01] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 14:13:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 14:13:01] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 14:13:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Support contains 1 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-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 14:13:01] [INFO ] Invariant cache hit.
[2024-06-01 14:13:01] [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.
[2024-06-01 14:13:01] [INFO ] Redundant transitions in 0 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 47 ms. Remains : 2/2 places, 1/1 transitions.
Treatment of property PermAdmissibility-COL-01-LTLCardinality-03 finished in 2062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 16
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 23 cols
[2024-06-01 14:13:01] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 14:13:02] [INFO ] Implicit Places using invariants in 52 ms returned [4, 5, 10, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 19/25 places, 16/16 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 13 steps with 1 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-05 finished in 210 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(p0)||X(X(X(G(p1))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 16
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 24 cols
[2024-06-01 14:13:02] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 14:13:02] [INFO ] Implicit Places using invariants in 54 ms returned [4, 5, 10, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 20/25 places, 16/16 transitions.
Stuttering acceptance computed with spot in 299 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLCardinality-11 finished in 374 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-06-01 14:13:02] [INFO ] Flatten gal took : 4 ms
[2024-06-01 14:13:02] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 14:13:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 16 transitions and 53 arcs took 4 ms.
Total runtime 7651 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA PermAdmissibility-COL-01-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717251183398

--------------------
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
mcc2024
ltl formula name PermAdmissibility-COL-01-LTLCardinality-03
ltl formula formula --ltl=/tmp/745/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 16 transitions and 53 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/745/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/745/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/745/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/745/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 19 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 31
pnml2lts-mc( 0/ 4): unique states count: 31
pnml2lts-mc( 0/ 4): unique transitions count: 44
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 26
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 62
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 62 states 95 transitions, fanout: 1.532
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 27.1 B/state, compr.: 25.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 16 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-COL-01, 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 r512-smll-171654406900107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;