fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r400-tall-171690533400899
Last Updated
July 7, 2024

About the Execution of ITS-Tools for Szymanski-PT-b12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 601185.00 0.00 0.00 ?FF?TFFTFF?F?FFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533400899.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 Szymanski-PT-b12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533400899
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b12-LTLCardinality-00
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-01
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-02
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-03
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-04
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-05
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-06
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-07
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-08
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-09
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-10
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-11
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-12
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-13
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-14
FORMULA_NAME Szymanski-PT-b12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717092818133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-30 18:13:39] [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-30 18:13:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:13:39] [INFO ] Load time of PNML (sax parser for PT used): 355 ms
[2024-05-30 18:13:39] [INFO ] Transformed 568 places.
[2024-05-30 18:13:39] [INFO ] Transformed 8320 transitions.
[2024-05-30 18:13:39] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 498 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 260 places in 19 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 260 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-05-30 18:13:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 18:13:40] [INFO ] Computed 1 invariants in 54 ms
[2024-05-30 18:13:41] [INFO ] Implicit Places using invariants in 891 ms returned []
[2024-05-30 18:13:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:13:41] [INFO ] Invariant cache hit.
[2024-05-30 18:13:42] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:14:13] [INFO ] Performed 263/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 18:14:28] [INFO ] Implicit Places using invariants and state equation in 47633 ms returned []
Implicit Place search using SMT with State Equation took 48559 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 18:14:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:14:29] [INFO ] Invariant cache hit.
[2024-05-30 18:14:29] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30103 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 89689ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 89889ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138762 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 12 out of 305 places after structural reductions.
[2024-05-30 18:16:00] [INFO ] Flatten gal took : 834 ms
[2024-05-30 18:16:00] [INFO ] Flatten gal took : 628 ms
[2024-05-30 18:16:01] [INFO ] Input system was already deterministic with 7936 transitions.
RANDOM walk for 40019 steps (18 resets) in 1554 ms. (25 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (11 resets) in 152 ms. (261 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (10 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 102 ms. (388 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (12 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
[2024-05-30 18:16:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:16:02] [INFO ] Invariant cache hit.
[2024-05-30 18:16:02] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 3 solved, 1 unsolved in 739 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1272 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2061ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 320 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40011 steps (8 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 247312 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 1
Probabilistic random walk after 247312 steps, saw 194384 distinct states, run finished after 3004 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-30 18:16:08] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 18:16:08] [INFO ] Computed 3 invariants in 33 ms
[2024-05-30 18:16:08] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 18:16:09] [INFO ] Deduced a trap composed of 107 places in 534 ms of which 31 ms to minimize.
[2024-05-30 18:16:09] [INFO ] Deduced a trap composed of 137 places in 508 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 18:16:10] [INFO ] Deduced a trap composed of 137 places in 625 ms of which 2 ms to minimize.
[2024-05-30 18:16:11] [INFO ] Deduced a trap composed of 131 places in 572 ms of which 3 ms to minimize.
[2024-05-30 18:16:11] [INFO ] Deduced a trap composed of 131 places in 600 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2909 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 461 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6502 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 7299ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 271 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 194 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 295 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 18:16:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:16:16] [INFO ] Invariant cache hit.
[2024-05-30 18:16:16] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-30 18:16:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:16:16] [INFO ] Invariant cache hit.
[2024-05-30 18:16:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:16:36] [INFO ] Implicit Places using invariants and state equation in 19388 ms returned []
Implicit Place search using SMT with State Equation took 20038 ms to find 0 implicit places.
[2024-05-30 18:16:37] [INFO ] Redundant transitions in 870 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 18:16:37] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:16:37] [INFO ] Invariant cache hit.
[2024-05-30 18:16:37] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints]
After SMT, in 89051ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89130ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110371 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
FORMULA Szymanski-PT-b12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
FORMULA Szymanski-PT-b12-LTLCardinality-11 FALSE 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)))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 18:18:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 18:18:06] [INFO ] Computed 1 invariants in 17 ms
[2024-05-30 18:18:07] [INFO ] Implicit Places using invariants in 682 ms returned []
[2024-05-30 18:18:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:18:07] [INFO ] Invariant cache hit.
[2024-05-30 18:18:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:18:40] [INFO ] Performed 268/305 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-30 18:18:57] [INFO ] Implicit Places using invariants and state equation in 50201 ms returned []
Implicit Place search using SMT with State Equation took 50886 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 18:18:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:18:57] [INFO ] Invariant cache hit.
[2024-05-30 18:18:57] [INFO ] State equation strengthened by 147 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30124 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30086 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 91823ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 91892ms
Finished structural reductions in LTL mode , in 1 iterations and 142837 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b12-LTLCardinality-00
Product exploration explored 100000 steps with 19 reset in 749 ms.
Product exploration explored 100000 steps with 53 reset in 634 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
RANDOM walk for 40015 steps (12 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 291033 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :0 out of 1
Probabilistic random walk after 291033 steps, saw 230906 distinct states, run finished after 3001 ms. (steps per millisecond=96 ) properties seen :0
[2024-05-30 18:20:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:20:34] [INFO ] Invariant cache hit.
[2024-05-30 18:20:34] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 780 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 303/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2057ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 230 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40024 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 274466 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 1
Probabilistic random walk after 274466 steps, saw 215029 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-30 18:20:39] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 18:20:39] [INFO ] Computed 3 invariants in 21 ms
[2024-05-30 18:20:39] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 284/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 18:20:40] [INFO ] Deduced a trap composed of 107 places in 462 ms of which 2 ms to minimize.
[2024-05-30 18:20:41] [INFO ] Deduced a trap composed of 137 places in 440 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 18:20:41] [INFO ] Deduced a trap composed of 137 places in 543 ms of which 5 ms to minimize.
[2024-05-30 18:20:42] [INFO ] Deduced a trap composed of 131 places in 530 ms of which 3 ms to minimize.
[2024-05-30 18:20:43] [INFO ] Deduced a trap composed of 130 places in 552 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 1/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 18:20:46] [INFO ] Deduced a trap composed of 45 places in 535 ms of which 2 ms to minimize.
[2024-05-30 18:20:47] [INFO ] Deduced a trap composed of 50 places in 488 ms of which 2 ms to minimize.
[2024-05-30 18:20:47] [INFO ] Deduced a trap composed of 78 places in 459 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 3/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 464 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7645 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 8412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 91 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 18:20:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:20:48] [INFO ] Invariant cache hit.
[2024-05-30 18:20:49] [INFO ] Implicit Places using invariants in 607 ms returned []
[2024-05-30 18:20:49] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:20:49] [INFO ] Invariant cache hit.
[2024-05-30 18:20:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:21:06] [INFO ] Implicit Places using invariants and state equation in 17492 ms returned []
Implicit Place search using SMT with State Equation took 18102 ms to find 0 implicit places.
[2024-05-30 18:21:07] [INFO ] Redundant transitions in 779 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 18:21:07] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 18:21:07] [INFO ] Invariant cache hit.
[2024-05-30 18:21:07] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints]
After SMT, in 90535ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 90612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109735 ms. Remains : 305/305 places, 7808/7808 transitions.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 414 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 18:22:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 18:22:38] [INFO ] Computed 1 invariants in 46 ms
[2024-05-30 18:22:39] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-30 18:22:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:22:39] [INFO ] Invariant cache hit.
[2024-05-30 18:22:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 18:23:11] [INFO ] Performed 268/305 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-30 18:23:27] [INFO ] Implicit Places using invariants and state equation in 47921 ms returned []
Implicit Place search using SMT with State Equation took 48469 ms to find 0 implicit places.
[2024-05-30 18:23:27] [INFO ] Redundant transitions in 668 ms returned []
Running 7934 sub problems to find dead transitions.
[2024-05-30 18:23:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 18:23:28] [INFO ] Invariant cache hit.
[2024-05-30 18:23:28] [INFO ] State equation strengthened by 147 read => feed constraints.

BK_STOP 1717093419318

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Szymanski-PT-b12"
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 Szymanski-PT-b12, 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 r400-tall-171690533400899"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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