fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r003-smll-171620117200211
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for AirplaneLD-COL-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
319.951 8591.00 19892.00 205.30 FTFTFTFFFFTFFTFT 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.r003-smll-171620117200211.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 AirplaneLD-COL-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117200211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.4K Apr 12 03:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 12 03:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 04:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 109K May 18 16:42 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 AirplaneLD-COL-0500-LTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716417388146

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AirplaneLD-COL-0500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:36:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:36:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:36:30] [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-22 22:36:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 22:36:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1245 ms
[2024-05-22 22:36:31] [INFO ] Detected 3 constant HL places corresponding to 1502 PT places.
[2024-05-22 22:36:31] [INFO ] Imported 20 HL places and 15 HL transitions for a total of 3519 PT places and 6012.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 22:36:32] [INFO ] Built PT skeleton of HLPN with 20 places and 15 transitions 56 arcs in 12 ms.
[2024-05-22 22:36:32] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 4 formulas.
FORMULA AirplaneLD-COL-0500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 20 stabilizing places and 15 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 15
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Computed a total of 17 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 14
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 (5034 resets) in 2200 ms. (18 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4004 steps (125 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (129 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (123 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (115 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (141 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (131 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (133 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (129 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (131 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (139 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (138 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (159 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (134 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (137 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (135 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
// Phase 1: matrix 14 rows 17 cols
[2024-05-22 22:36:33] [INFO ] Computed 3 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 2/11 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 10 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/24 variables, 12/15 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 29/31 variables, and 18 constraints, problems are : Problem set: 15 solved, 0 unsolved in 422 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 15/17 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 522ms problems are : Problem set: 15 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 15 atomic propositions for a total of 12 simplifications.
FORMULA AirplaneLD-COL-0500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:36:34] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2024-05-22 22:36:34] [INFO ] Flatten gal took : 41 ms
FORMULA AirplaneLD-COL-0500-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AirplaneLD-COL-0500-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:36:34] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Altitude
Symmetric sort wr.t. initial detected :Altitude
Transition t3_2 : guard parameter $A(Altitude:1000) in guard (OR (GEQ $A 499) (EQ $A 999))introduces in Altitude(1000) partition with 2 elements
Transition t3_1 : guard parameter $A(Altitude:1000) in guard (AND (LT $A 499) (NEQ $A 999))introduces in Altitude(1000) partition with 2 elements
Sort wr.t. initial and guards Altitude has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Altitude domain size was 1000 reducing to 2 values.
For transition t3_2:(OR (GEQ $A 499) (EQ $A 999)) -> (EQ $A 1)
For transition t3_1:(AND (LT $A 499) (NEQ $A 999)) -> (EQ $A 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Speed
Symmetric sort wr.t. initial detected :Speed
Transition t5_2 : guard parameter $S(Speed:500) in guard (OR (LEQ $S 249) (EQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t5_1 : guard parameter $S(Speed:500) in guard (AND (GT $S 249) (NEQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t4_2 : guard parameter $S(Speed:500) in guard (OR (LEQ $S 249) (EQ $S 499))introduces in Speed(500) partition with 2 elements
Transition t4_1 : guard parameter $S(Speed:500) in guard (AND (GT $S 249) (NEQ $S 499))introduces in Speed(500) partition with 2 elements
Sort wr.t. initial and guards Speed has partition 2
Applying symmetric unfolding of partitioned symmetric sort :Speed domain size was 500 reducing to 2 values.
For transition t5_2:(OR (LEQ $S 249) (EQ $S 499)) -> (EQ $S 1)
For transition t5_1:(AND (GT $S 249) (NEQ $S 499)) -> (EQ $S 0)
For transition t4_2:(OR (LEQ $S 249) (EQ $S 499)) -> (EQ $S 1)
For transition t4_1:(AND (GT $S 249) (NEQ $S 499)) -> (EQ $S 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Signal
Arc [19:1*[1]] contains constants of sort Signal
Transition t5_2 : constants on arcs in [[19:1*[1]]] introduces in Signal(2) partition with 1 elements that refines current partition to 2 subsets.
Symmetric sort wr.t. initial and guards and successors and join/free detected :Weight
Symmetric sort wr.t. initial detected :Weight
Transition t2_2 : guard parameter $W(Weight:2) in guard (EQ $W 1)introduces in Weight(2) partition with 2 elements
[2024-05-22 22:36:34] [INFO ] Unfolded HLPN to a Petri net with 29 places and 20 transitions 56 arcs in 131 ms.
[2024-05-22 22:36:34] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Reduce places removed 6 places and 0 transitions.
Support contains 10 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 20/20 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 20
Applied a total of 1 rules in 19 ms. Remains 22 /23 variables (removed 1) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-22 22:36:34] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 22:36:34] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 22:36:34] [INFO ] Invariant cache hit.
[2024-05-22 22:36:34] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-22 22:36:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4/42 variables, 4/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 24 constraints, problems are : Problem set: 0 solved, 10 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 3/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 20/38 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 4/42 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 34 constraints, problems are : Problem set: 0 solved, 10 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 651ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 653ms
Starting structural reductions in LTL mode, iteration 1 : 22/23 places, 20/20 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 960 ms. Remains : 22/23 places, 20/20 transitions.
Support contains 10 out of 22 places after structural reductions.
[2024-05-22 22:36:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:36:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:36:35] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40000 steps (5057 resets) in 759 ms. (52 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40001 steps (962 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (942 resets) in 272 ms. (146 steps per ms) remains 2/2 properties
[2024-05-22 22:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
After SMT solving in domain Real declared 10/42 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA AirplaneLD-COL-0500-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
Computed a total of 22 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Graph (complete) has 30 edges and 22 vertex of which 9 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 9 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 8 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 8 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 8 transition count 6
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 7 place count 7 transition count 6
Applied a total of 7 rules in 56 ms. Remains 7 /22 variables (removed 15) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-22 22:36:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants in 58 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/22 places, 6/20 transitions.
Graph (complete) has 3 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-22 22:36:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 22:36:36] [INFO ] Invariant cache hit.
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/22 places, 5/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 182 ms. Remains : 4/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA AirplaneLD-COL-0500-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLCardinality-00 finished in 483 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 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-05-22 22:36:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants in 49 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 20 transition count 19
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 20 cols
[2024-05-22 22:36:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-22 22:36:36] [INFO ] Invariant cache hit.
[2024-05-22 22:36:36] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/22 places, 19/20 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 132 ms. Remains : 20/22 places, 19/20 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AirplaneLD-COL-0500-LTLCardinality-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AirplaneLD-COL-0500-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AirplaneLD-COL-0500-LTLCardinality-04 finished in 222 ms.
All properties solved by simple procedures.
Total runtime 6351 ms.
ITS solved all properties within timeout

BK_STOP 1716417396737

--------------------
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="AirplaneLD-COL-0500"
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 AirplaneLD-COL-0500, 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 r003-smll-171620117200211"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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