fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654446500172
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBLF-COL-S06J04T04

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 375786.00 0.00 0.00 ?T?????????FTT?? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446500172.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-COL-S06J04T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T04-LTLFireability-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716910508263

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 15:35:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:35:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:35:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 15:35:10] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:35:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 704 ms
[2024-05-28 15:35:10] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 15:35:10] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:35:10] [INFO ] Skeletonized 15 HLPN properties in 1 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40008 steps (3875 resets) in 1160 ms. (34 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40003 steps (135 resets) in 246 ms. (161 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40001 steps (194 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
[2024-05-28 15:35:11] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:35:11] [INFO ] Computed 26 invariants in 13 ms
[2024-05-28 15:35:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/41 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/49 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/50 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 73/145 variables, and 21 constraints, problems are : Problem set: 1 solved, 0 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 12/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 350ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:35:11] [INFO ] Flatten gal took : 24 ms
[2024-05-28 15:35:11] [INFO ] Flatten gal took : 11 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:35:11] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 212 ms.
[2024-05-28 15:35:11] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 241 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 450 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 450 transition count 1610
Applied a total of 8 rules in 124 ms. Remains 450 /454 variables (removed 4) and now considering 1610/1614 (removed 4) transitions.
Running 1604 sub problems to find dead transitions.
[2024-05-28 15:35:12] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
// Phase 1: matrix 1586 rows 450 cols
[2024-05-28 15:35:12] [INFO ] Computed 50 invariants in 65 ms
[2024-05-28 15:35:12] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 25/38 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 85 places in 377 ms of which 47 ms to minimize.
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 1 ms to minimize.
[2024-05-28 15:35:42] [INFO ] Deduced a trap composed of 234 places in 729 ms of which 4 ms to minimize.
[2024-05-28 15:35:43] [INFO ] Deduced a trap composed of 115 places in 290 ms of which 3 ms to minimize.
[2024-05-28 15:35:43] [INFO ] Deduced a trap composed of 106 places in 281 ms of which 3 ms to minimize.
[2024-05-28 15:35:44] [INFO ] Deduced a trap composed of 243 places in 293 ms of which 3 ms to minimize.
[2024-05-28 15:35:45] [INFO ] Deduced a trap composed of 290 places in 589 ms of which 4 ms to minimize.
[2024-05-28 15:35:46] [INFO ] Deduced a trap composed of 255 places in 410 ms of which 3 ms to minimize.
[2024-05-28 15:35:46] [INFO ] Deduced a trap composed of 231 places in 401 ms of which 4 ms to minimize.
[2024-05-28 15:35:46] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 3 ms to minimize.
[2024-05-28 15:35:47] [INFO ] Deduced a trap composed of 244 places in 372 ms of which 3 ms to minimize.
[2024-05-28 15:35:47] [INFO ] Deduced a trap composed of 222 places in 368 ms of which 3 ms to minimize.
[2024-05-28 15:35:48] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 3 ms to minimize.
[2024-05-28 15:35:48] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 1 ms to minimize.
[2024-05-28 15:35:49] [INFO ] Deduced a trap composed of 64 places in 319 ms of which 2 ms to minimize.
SMT process timed out in 37413ms, After SMT, problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 37478ms
[2024-05-28 15:35:49] [INFO ] Flow matrix only has 1586 transitions (discarded 24 similar events)
[2024-05-28 15:35:49] [INFO ] Invariant cache hit.
[2024-05-28 15:35:49] [INFO ] Implicit Places using invariants in 246 ms returned [360, 361, 362, 363]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 258 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 446/454 places, 1610/1614 transitions.
Applied a total of 0 rules in 12 ms. Remains 446 /446 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37909 ms. Remains : 446/454 places, 1610/1614 transitions.
Support contains 241 out of 446 places after structural reductions.
[2024-05-28 15:35:50] [INFO ] Flatten gal took : 200 ms
[2024-05-28 15:35:50] [INFO ] Flatten gal took : 127 ms
[2024-05-28 15:35:50] [INFO ] Input system was already deterministic with 1610 transitions.
Support contains 237 out of 446 places (down from 241) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 1509 steps (7 resets) in 114 ms. (13 steps per ms) remains 0/19 properties
Computed a total of 0 stabilizing places and 0 stable transitions
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) U X(!p1))))'
Support contains 30 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 1610/1610 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 440 transition count 1610
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 436 transition count 1606
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 436 transition count 1606
Applied a total of 14 rules in 30 ms. Remains 436 /446 variables (removed 10) and now considering 1606/1610 (removed 4) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:35:51] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
// Phase 1: matrix 1582 rows 436 cols
[2024-05-28 15:35:51] [INFO ] Computed 40 invariants in 51 ms
[2024-05-28 15:35:51] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 84 places in 146 ms of which 2 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:36:20] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 1 ms to minimize.
[2024-05-28 15:36:21] [INFO ] Deduced a trap composed of 233 places in 411 ms of which 4 ms to minimize.
[2024-05-28 15:36:21] [INFO ] Deduced a trap composed of 230 places in 363 ms of which 3 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 107 places in 371 ms of which 3 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 127 places in 303 ms of which 2 ms to minimize.
[2024-05-28 15:36:22] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2024-05-28 15:36:23] [INFO ] Deduced a trap composed of 192 places in 306 ms of which 3 ms to minimize.
[2024-05-28 15:36:23] [INFO ] Deduced a trap composed of 235 places in 300 ms of which 3 ms to minimize.
[2024-05-28 15:36:25] [INFO ] Deduced a trap composed of 285 places in 430 ms of which 3 ms to minimize.
[2024-05-28 15:36:25] [INFO ] Deduced a trap composed of 269 places in 398 ms of which 3 ms to minimize.
[2024-05-28 15:36:25] [INFO ] Deduced a trap composed of 271 places in 410 ms of which 4 ms to minimize.
[2024-05-28 15:36:26] [INFO ] Deduced a trap composed of 286 places in 404 ms of which 6 ms to minimize.
[2024-05-28 15:36:26] [INFO ] Deduced a trap composed of 294 places in 419 ms of which 3 ms to minimize.
[2024-05-28 15:36:27] [INFO ] Deduced a trap composed of 248 places in 400 ms of which 2 ms to minimize.
[2024-05-28 15:36:27] [INFO ] Deduced a trap composed of 244 places in 400 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 51 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:36:31] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 15 ms to minimize.
[2024-05-28 15:36:33] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 44 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-28 15:36:35] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2024-05-28 15:36:36] [INFO ] Deduced a trap composed of 219 places in 295 ms of which 2 ms to minimize.
[2024-05-28 15:36:36] [INFO ] Deduced a trap composed of 218 places in 356 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 58 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 24/24 constraints]
After SMT, in 57039ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 57059ms
[2024-05-28 15:36:48] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:36:48] [INFO ] Invariant cache hit.
[2024-05-28 15:36:48] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-28 15:36:48] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:36:48] [INFO ] Invariant cache hit.
[2024-05-28 15:36:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:36:53] [INFO ] Implicit Places using invariants and state equation in 4985 ms returned []
Implicit Place search using SMT with State Equation took 5427 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:36:53] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:36:53] [INFO ] Invariant cache hit.
[2024-05-28 15:36:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:37:20] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 2 ms to minimize.
[2024-05-28 15:37:20] [INFO ] Deduced a trap composed of 84 places in 63 ms of which 1 ms to minimize.
[2024-05-28 15:37:21] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:37:21] [INFO ] Deduced a trap composed of 224 places in 362 ms of which 2 ms to minimize.
[2024-05-28 15:37:22] [INFO ] Deduced a trap composed of 98 places in 376 ms of which 3 ms to minimize.
[2024-05-28 15:37:22] [INFO ] Deduced a trap composed of 122 places in 344 ms of which 3 ms to minimize.
[2024-05-28 15:37:22] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 210 places in 377 ms of which 3 ms to minimize.
[2024-05-28 15:37:23] [INFO ] Deduced a trap composed of 239 places in 349 ms of which 3 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 268 places in 455 ms of which 3 ms to minimize.
[2024-05-28 15:37:25] [INFO ] Deduced a trap composed of 246 places in 456 ms of which 5 ms to minimize.
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 Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:37:47] [INFO ] Deduced a trap composed of 219 places in 367 ms of which 3 ms to minimize.
[2024-05-28 15:37:47] [INFO ] Deduced a trap composed of 195 places in 315 ms of which 3 ms to minimize.
[2024-05-28 15:37:48] [INFO ] Deduced a trap composed of 49 places in 310 ms of which 2 ms to minimize.
[2024-05-28 15:37:48] [INFO ] Deduced a trap composed of 53 places in 315 ms of which 3 ms to minimize.
[2024-05-28 15:37:50] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-28 15:38:03] [INFO ] Deduced a trap composed of 240 places in 345 ms of which 3 ms to minimize.
[2024-05-28 15:38:03] [INFO ] Deduced a trap composed of 199 places in 317 ms of which 4 ms to minimize.
[2024-05-28 15:38:04] [INFO ] Deduced a trap composed of 220 places in 346 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 19/19 constraints]
After SMT, in 77337ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 77375ms
Starting structural reductions in LTL mode, iteration 1 : 436/446 places, 1606/1610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139906 ms. Remains : 436/446 places, 1606/1610 transitions.
Stuttering acceptance computed with spot in 316 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J04T04-LTLFireability-00
Product exploration explored 100000 steps with 39895 reset in 1151 ms.
Product exploration explored 100000 steps with 40017 reset in 783 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 123 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 546 steps (2 resets) in 12 ms. (42 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 162 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 1606/1606 transitions.
Applied a total of 0 rules in 15 ms. Remains 436 /436 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:38:14] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:38:14] [INFO ] Invariant cache hit.
[2024-05-28 15:38:14] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 3 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 1 ms to minimize.
[2024-05-28 15:38:44] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 224 places in 370 ms of which 4 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 98 places in 360 ms of which 3 ms to minimize.
[2024-05-28 15:38:45] [INFO ] Deduced a trap composed of 122 places in 304 ms of which 4 ms to minimize.
[2024-05-28 15:38:46] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-28 15:38:46] [INFO ] Deduced a trap composed of 210 places in 355 ms of which 3 ms to minimize.
[2024-05-28 15:38:47] [INFO ] Deduced a trap composed of 239 places in 324 ms of which 3 ms to minimize.
[2024-05-28 15:38:48] [INFO ] Deduced a trap composed of 268 places in 435 ms of which 3 ms to minimize.
[2024-05-28 15:38:49] [INFO ] Deduced a trap composed of 246 places in 415 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:39:00] [INFO ] Deduced a trap composed of 219 places in 428 ms of which 3 ms to minimize.
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 195 places in 343 ms of which 4 ms to minimize.
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 49 places in 341 ms of which 2 ms to minimize.
[2024-05-28 15:39:01] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 2 ms to minimize.
[2024-05-28 15:39:03] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 50 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 16/16 constraints]
After SMT, in 59269ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 59300ms
[2024-05-28 15:39:13] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:39:13] [INFO ] Invariant cache hit.
[2024-05-28 15:39:13] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 15:39:13] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:39:13] [INFO ] Invariant cache hit.
[2024-05-28 15:39:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:39:19] [INFO ] Implicit Places using invariants and state equation in 5661 ms returned []
Implicit Place search using SMT with State Equation took 5994 ms to find 0 implicit places.
Running 1600 sub problems to find dead transitions.
[2024-05-28 15:39:19] [INFO ] Flow matrix only has 1582 transitions (discarded 24 similar events)
[2024-05-28 15:39:19] [INFO ] Invariant cache hit.
[2024-05-28 15:39:19] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-05-28 15:39:50] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 224 places in 342 ms of which 4 ms to minimize.
[2024-05-28 15:39:51] [INFO ] Deduced a trap composed of 98 places in 326 ms of which 3 ms to minimize.
[2024-05-28 15:39:52] [INFO ] Deduced a trap composed of 122 places in 357 ms of which 3 ms to minimize.
[2024-05-28 15:39:52] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:39:53] [INFO ] Deduced a trap composed of 210 places in 335 ms of which 4 ms to minimize.
[2024-05-28 15:39:53] [INFO ] Deduced a trap composed of 239 places in 336 ms of which 3 ms to minimize.
[2024-05-28 15:39:54] [INFO ] Deduced a trap composed of 268 places in 385 ms of which 3 ms to minimize.
[2024-05-28 15:39:55] [INFO ] Deduced a trap composed of 246 places in 460 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/2018 variables, and 45 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
[2024-05-28 15:40:16] [INFO ] Deduced a trap composed of 219 places in 389 ms of which 3 ms to minimize.
[2024-05-28 15:40:17] [INFO ] Deduced a trap composed of 195 places in 484 ms of which 3 ms to minimize.
[2024-05-28 15:40:17] [INFO ] Deduced a trap composed of 49 places in 428 ms of which 2 ms to minimize.
[2024-05-28 15:40:17] [INFO ] Deduced a trap composed of 53 places in 340 ms of which 2 ms to minimize.
[2024-05-28 15:40:20] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 1 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 240 places in 363 ms of which 4 ms to minimize.
[2024-05-28 15:40:34] [INFO ] Deduced a trap composed of 199 places in 334 ms of which 3 ms to minimize.
[2024-05-28 15:40:35] [INFO ] Deduced a trap composed of 220 places in 404 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/2018 variables, and 53 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/18 constraints, Generalized P Invariants (flows): 21/22 constraints, State Equation: 0/436 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1600 constraints, Known Traps: 19/19 constraints]
After SMT, in 80647ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 80665ms
Finished structural reductions in LTL mode , in 1 iterations and 145986 ms. Remains : 436/436 places, 1606/1606 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 109 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 576 steps (9 resets) in 14 ms. (38 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 40106 reset in 779 ms.
Product exploration explored 100000 steps with 39919 reset in 778 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 182 ms :[p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 30 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 1606/1606 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 436 transition count 1606
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 32 Pre rules applied. Total rules applied 24 place count 436 transition count 1654
Deduced a syphon composed of 56 places in 1 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 56 place count 436 transition count 1654
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 428 transition count 1646
Deduced a syphon composed of 48 places in 2 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 428 transition count 1646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 96 places in 2 ms
Iterating global reduction 1 with 48 rules applied. Total rules applied 120 place count 428 transition count 1646
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 136 place count 412 transition count 1630
Deduced a syphon composed of 84 places in 4 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 152 place count 412 transition count 1630
Deduced a syphon composed of 84 places in 2 ms
Applied a total of 152 rules in 181 ms. Remains 412 /436 variables (removed 24) and now considering 1630/1606 (removed -24) transitions.
Running 1624 sub problems to find dead transitions.
[2024-05-28 15:40:43] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
// Phase 1: matrix 1606 rows 412 cols
[2024-05-28 15:40:43] [INFO ] Computed 40 invariants in 63 ms
[2024-05-28 15:40:43] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1624 unsolved
[2024-05-28 15:41:17] [INFO ] Deduced a trap composed of 57 places in 416 ms of which 50 ms to minimize.
[2024-05-28 15:41:18] [INFO ] Deduced a trap composed of 57 places in 430 ms of which 76 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 57 places in 713 ms of which 95 ms to minimize.
[2024-05-28 15:41:19] [INFO ] Deduced a trap composed of 57 places in 731 ms of which 28 ms to minimize.
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
[2024-05-28 15:41:21] [INFO ] Deduced a trap composed of 189 places in 1126 ms of which 30 ms to minimize.
SMT process timed out in 37978ms, After SMT, problems are : Problem set: 0 solved, 1624 unsolved
Search for dead transitions found 0 dead transitions in 38001ms
[2024-05-28 15:41:21] [INFO ] Redundant transitions in 177 ms returned []
Running 1624 sub problems to find dead transitions.
[2024-05-28 15:41:21] [INFO ] Flow matrix only has 1606 transitions (discarded 24 similar events)
[2024-05-28 15:41:21] [INFO ] Invariant cache hit.
[2024-05-28 15:41:21] [INFO ] State equation strengthened by 160 read => feed constraints.

BK_STOP 1716910884049

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="PolyORBLF-COL-S06J04T04"
export BK_EXAMINATION="LTLFireability"
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 PolyORBLF-COL-S06J04T04, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446500172"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T04.tgz
mv PolyORBLF-COL-S06J04T04 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;