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

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d0m04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
352.619 20185.00 44469.00 193.00 FTTTTTFFFTTTTTTF 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.r378-smll-171683810500003.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 SieveSingleMsgMbox-PT-d0m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810500003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 19:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 19:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m04-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716876429115

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 06:07:11] [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-28 06:07:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:07:12] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-28 06:07:12] [INFO ] Transformed 262 places.
[2024-05-28 06:07:12] [INFO ] Transformed 73 transitions.
[2024-05-28 06:07:12] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 373 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 62 transition count 65
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 62 transition count 65
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 61 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 23 place count 60 transition count 62
Applied a total of 23 rules in 103 ms. Remains 60 /72 variables (removed 12) and now considering 62/73 (removed 11) transitions.
// Phase 1: matrix 62 rows 60 cols
[2024-05-28 06:07:12] [INFO ] Computed 5 invariants in 21 ms
[2024-05-28 06:07:12] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-28 06:07:12] [INFO ] Invariant cache hit.
[2024-05-28 06:07:13] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-28 06:07:13] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-28 06:07:13] [INFO ] Invariant cache hit.
[2024-05-28 06:07:13] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 23 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 3 ms to minimize.
[2024-05-28 06:07:14] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 6 (OVERLAPS) 62/122 variables, 60/70 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 26/96 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-05-28 06:07:15] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 2 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-05-28 06:07:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 3/99 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/100 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/100 constraints. Problems are: Problem set: 5 solved, 56 unsolved
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 06:07:17] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/122 variables, 2/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/102 constraints. Problems are: Problem set: 5 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 102 constraints, problems are : Problem set: 5 solved, 56 unsolved in 5998 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 5 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/5 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/53 variables, 1/6 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 4/57 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 3/10 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 62/119 variables, 57/67 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 26/93 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/119 variables, 8/101 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/119 variables, 0/101 constraints. Problems are: Problem set: 5 solved, 56 unsolved
At refinement iteration 13 (OVERLAPS) 3/122 variables, 3/104 constraints. Problems are: Problem set: 5 solved, 56 unsolved
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/122 variables, 48/152 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/122 variables, 6/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/122 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
At refinement iteration 17 (OVERLAPS) 0/122 variables, 0/158 constraints. Problems are: Problem set: 7 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 158 constraints, problems are : Problem set: 7 solved, 54 unsolved in 4010 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 60/60 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 56/61 constraints, Known Traps: 11/11 constraints]
After SMT, in 10241ms problems are : Problem set: 7 solved, 54 unsolved
Search for dead transitions found 7 dead transitions in 10263ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 60/72 places, 55/73 transitions.
Reduce places removed 10 places and 8 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 50 transition count 46
Reduce places removed 3 places and 5 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 47 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 46 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 45 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 16 rules in 2 ms. Remains 45 /60 variables (removed 15) and now considering 40/55 (removed 15) transitions.
// Phase 1: matrix 40 rows 45 cols
[2024-05-28 06:07:23] [INFO ] Computed 6 invariants in 2 ms
[2024-05-28 06:07:23] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-28 06:07:23] [INFO ] Invariant cache hit.
[2024-05-28 06:07:23] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 06:07:23] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 45/72 places, 40/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11315 ms. Remains : 45/72 places, 40/73 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Support contains 4 out of 42 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:07:23] [INFO ] Flatten gal took : 43 ms
[2024-05-28 06:07:23] [INFO ] Flatten gal took : 20 ms
[2024-05-28 06:07:23] [INFO ] Input system was already deterministic with 40 transitions.
RANDOM walk for 40000 steps (8879 resets) in 1566 ms. (25 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (1877 resets) in 510 ms. (78 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4106 resets) in 210 ms. (189 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (4679 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
// Phase 1: matrix 40 rows 42 cols
[2024-05-28 06:07:24] [INFO ] Computed 3 invariants in 4 ms
[2024-05-28 06:07:24] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/35 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 38/73 variables, 35/38 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 14/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 82/82 variables, and 59 constraints, problems are : Problem set: 3 solved, 0 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 42/42 constraints, ReadFeed: 14/16 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 12 stable transitions
Graph (complete) has 120 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 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 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 40/40 transitions.
Graph (complete) has 120 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 41 /42 variables (removed 1) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 41 cols
[2024-05-28 06:07:25] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 06:07:25] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-28 06:07:25] [INFO ] Invariant cache hit.
[2024-05-28 06:07:25] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-28 06:07:25] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2024-05-28 06:07:25] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-05-28 06:07:25] [INFO ] Invariant cache hit.
[2024-05-28 06:07:25] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 60 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 39/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 99 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
After SMT, in 2814ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/42 places, 40/40 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3224 ms. Remains : 41/42 places, 40/40 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
Product exploration explored 100000 steps with 22476 reset in 455 ms.
Stuttering criterion allowed to conclude after 86030 steps with 19217 reset in 166 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 finished in 4225 ms.
All properties solved by simple procedures.
Total runtime 17607 ms.

BK_STOP 1716876449300

--------------------
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="SieveSingleMsgMbox-PT-d0m04"
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 SieveSingleMsgMbox-PT-d0m04, 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 r378-smll-171683810500003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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