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

About the Execution of ITS-Tools for HexagonalGrid-PT-110

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
336.848 13182.00 29906.00 214.70 FFFFTFFFFTFFTFTF 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.r202-smll-171649587200003.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HexagonalGrid-PT-110, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587200003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-LTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716543319749

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-110
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-24 09:35:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 09:35:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:35:22] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-05-24 09:35:22] [INFO ] Transformed 31 places.
[2024-05-24 09:35:22] [INFO ] Transformed 42 transitions.
[2024-05-24 09:35:22] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 304 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HexagonalGrid-PT-110-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 20 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 09:35:23] [INFO ] Computed 14 invariants in 21 ms
[2024-05-24 09:35:23] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-24 09:35:23] [INFO ] Invariant cache hit.
[2024-05-24 09:35:23] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-24 09:35:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1309 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1156 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2653ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2676ms
Finished structural reductions in LTL mode , in 1 iterations and 3250 ms. Remains : 31/31 places, 42/42 transitions.
Support contains 23 out of 31 places after structural reductions.
[2024-05-24 09:35:26] [INFO ] Flatten gal took : 62 ms
[2024-05-24 09:35:26] [INFO ] Flatten gal took : 26 ms
[2024-05-24 09:35:26] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 22 out of 31 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2526 ms. (15 steps per ms) remains 5/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 273 ms. (145 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
[2024-05-24 09:35:27] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 17/73 variables, and 5 constraints, problems are : Problem set: 5 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 5/13 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HexagonalGrid-PT-110-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA HexagonalGrid-PT-110-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA HexagonalGrid-PT-110-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G((p1 U p2))))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-24 09:35:28] [INFO ] Invariant cache hit.
[2024-05-24 09:35:28] [INFO ] Implicit Places using invariants in 89 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 712 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-00
Product exploration explored 100000 steps with 28946 reset in 737 ms.
Entered a terminal (fully accepting) state of product in 14475 steps with 4172 reset in 73 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-00 finished in 1710 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||F(p1))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-24 09:35:29] [INFO ] Invariant cache hit.
[2024-05-24 09:35:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 09:35:29] [INFO ] Invariant cache hit.
[2024-05-24 09:35:30] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-24 09:35:30] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-24 09:35:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 812 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 1570ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 1572ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1771 ms. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-03
Product exploration explored 100000 steps with 12630 reset in 343 ms.
Stack based approach found an accepted trace after 285 steps with 35 reset with depth 58 and stack size 55 in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-03 finished in 2327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-24 09:35:32] [INFO ] Invariant cache hit.
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants in 64 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 22 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 12 place count 22 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 14 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 27 place count 12 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 10 transition count 32
Graph (trivial) has 16 edges and 10 vertex of which 4 / 10 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 7 transition count 32
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 54 place count 7 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 5 transition count 6
Applied a total of 59 rules in 33 ms. Remains 5 /30 variables (removed 25) and now considering 6/42 (removed 36) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-24 09:35:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 09:35:32] [INFO ] Invariant cache hit.
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/31 places, 6/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 5/31 places, 6/42 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-05 finished in 207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 09:35:32] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants in 76 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 30 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 20 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 15 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 10 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 8 transition count 31
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 6 transition count 30
Graph (trivial) has 20 edges and 6 vertex of which 5 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 2 transition count 30
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 64 place count 2 transition count 3
Applied a total of 64 rules in 4 ms. Remains 2 /30 variables (removed 28) and now considering 3/42 (removed 39) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-24 09:35:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 09:35:32] [INFO ] Invariant cache hit.
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/31 places, 3/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 120 ms. Remains : 2/31 places, 3/42 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-06
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-06 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(p1))))&&F(p0)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 09:35:32] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 09:35:32] [INFO ] Implicit Places using invariants in 89 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 601 steps with 1 reset in 4 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-08 finished in 295 ms.
All properties solved by simple procedures.
Total runtime 10631 ms.

BK_STOP 1716543332931

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HexagonalGrid-PT-110, 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 r202-smll-171649587200003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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