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

About the Execution of GreatSPN+red for DLCround-PT-13a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
408.140 93407.00 121745.00 530.50 FFTTFTTTTTFFTTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r113-smll-171624274600275.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DLCround-PT-13a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-171624274600275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 13 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 13 17:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 17:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 987K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-13a-LTLCardinality-00
FORMULA_NAME DLCround-PT-13a-LTLCardinality-01
FORMULA_NAME DLCround-PT-13a-LTLCardinality-02
FORMULA_NAME DLCround-PT-13a-LTLCardinality-03
FORMULA_NAME DLCround-PT-13a-LTLCardinality-04
FORMULA_NAME DLCround-PT-13a-LTLCardinality-05
FORMULA_NAME DLCround-PT-13a-LTLCardinality-06
FORMULA_NAME DLCround-PT-13a-LTLCardinality-07
FORMULA_NAME DLCround-PT-13a-LTLCardinality-08
FORMULA_NAME DLCround-PT-13a-LTLCardinality-09
FORMULA_NAME DLCround-PT-13a-LTLCardinality-10
FORMULA_NAME DLCround-PT-13a-LTLCardinality-11
FORMULA_NAME DLCround-PT-13a-LTLCardinality-12
FORMULA_NAME DLCround-PT-13a-LTLCardinality-13
FORMULA_NAME DLCround-PT-13a-LTLCardinality-14
FORMULA_NAME DLCround-PT-13a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716414607276

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-13a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 21:50:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 21:50:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 21:50:09] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2024-05-22 21:50:09] [INFO ] Transformed 463 places.
[2024-05-22 21:50:09] [INFO ] Transformed 3847 transitions.
[2024-05-22 21:50:09] [INFO ] Found NUPN structural information;
[2024-05-22 21:50:09] [INFO ] Parsed PT model containing 463 places and 3847 transitions and 15089 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 143 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 352 transitions
Reduce redundant transitions removed 352 transitions.
FORMULA DLCround-PT-13a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 3495/3495 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 430 transition count 2896
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 430 transition count 2896
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 69 place count 430 transition count 2893
Drop transitions (Redundant composition of simpler transitions.) removed 860 transitions
Redundant transition composition rules discarded 860 transitions
Iterating global reduction 1 with 860 rules applied. Total rules applied 929 place count 430 transition count 2033
Applied a total of 929 rules in 253 ms. Remains 430 /463 variables (removed 33) and now considering 2033/3495 (removed 1462) transitions.
[2024-05-22 21:50:10] [INFO ] Flow matrix only has 230 transitions (discarded 1803 similar events)
// Phase 1: matrix 230 rows 430 cols
[2024-05-22 21:50:10] [INFO ] Computed 312 invariants in 27 ms
[2024-05-22 21:50:13] [INFO ] Implicit Places using invariants in 3009 ms returned [136, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 168, 169, 170, 171, 173, 175, 176, 177, 178, 180, 181, 182, 183, 184, 185, 186, 187, 188, 190, 191, 192, 193, 194, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 216, 217, 218, 219, 221, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 245, 246, 248, 249, 250, 251, 252, 253, 254, 255, 256, 257, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 366, 367, 368, 369, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 389, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 402, 403, 404, 405, 406, 407, 408, 409, 410, 411, 413, 414, 415, 416, 417, 418, 419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429]
Discarding 270 places :
Ensure Unique test removed 1592 transitions
Reduce isomorphic transitions removed 1592 transitions.
Implicit Place search using SMT only with invariants took 3106 ms to find 270 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/463 places, 441/3495 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 145 place count 160 transition count 296
Applied a total of 145 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 296/441 (removed 145) transitions.
[2024-05-22 21:50:13] [INFO ] Flow matrix only has 230 transitions (discarded 66 similar events)
// Phase 1: matrix 230 rows 160 cols
[2024-05-22 21:50:13] [INFO ] Computed 42 invariants in 3 ms
[2024-05-22 21:50:13] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-22 21:50:13] [INFO ] Flow matrix only has 230 transitions (discarded 66 similar events)
[2024-05-22 21:50:13] [INFO ] Invariant cache hit.
[2024-05-22 21:50:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:13] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/463 places, 296/3495 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3659 ms. Remains : 160/463 places, 296/3495 transitions.
Support contains 30 out of 160 places after structural reductions.
[2024-05-22 21:50:14] [INFO ] Flatten gal took : 68 ms
[2024-05-22 21:50:14] [INFO ] Flatten gal took : 33 ms
[2024-05-22 21:50:14] [INFO ] Input system was already deterministic with 296 transitions.
Support contains 28 out of 160 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1935 ms. (20 steps per ms) remains 10/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
[2024-05-22 21:50:15] [INFO ] Flow matrix only has 230 transitions (discarded 66 similar events)
[2024-05-22 21:50:15] [INFO ] Invariant cache hit.
[2024-05-22 21:50:15] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 1 (OVERLAPS) 14/35 variables, 21/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 125/160 variables, 21/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/42 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 229/389 variables, 160/202 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/202 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/390 variables, 1/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/390 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/390 variables, 0/203 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 203 constraints, problems are : Problem set: 2 solved, 8 unsolved in 596 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Int declared 31/390 variables, and 17 constraints, problems are : Problem set: 10 solved, 0 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 17/42 constraints, State Equation: 0/160 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 836ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DLCround-PT-13a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-13a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 25 stabilizing places and 1 stable transitions
Graph (complete) has 337 edges and 160 vertex of which 136 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
FORMULA DLCround-PT-13a-LTLCardinality-00 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' '!(G(F(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 296/296 transitions.
Graph (trivial) has 290 edges and 160 vertex of which 133 / 160 are part of one of the 18 SCC in 3 ms
Free SCC test removed 115 places
Ensure Unique test removed 272 transitions
Reduce isomorphic transitions removed 272 transitions.
Graph (complete) has 65 edges and 45 vertex of which 21 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 4 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 4 transition count 5
Applied a total of 36 rules in 19 ms. Remains 4 /160 variables (removed 156) and now considering 5/296 (removed 291) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-22 21:50:16] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 21:50:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-22 21:50:16] [INFO ] Invariant cache hit.
[2024-05-22 21:50:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-22 21:50:16] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-22 21:50:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/8 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/8 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 8 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/160 places, 5/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 4/160 places, 5/296 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLCardinality-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA DLCround-PT-13a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLCardinality-01 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 296/296 transitions.
Graph (trivial) has 295 edges and 160 vertex of which 135 / 160 are part of one of the 18 SCC in 1 ms
Free SCC test removed 117 places
Ensure Unique test removed 277 transitions
Reduce isomorphic transitions removed 277 transitions.
Graph (complete) has 60 edges and 43 vertex of which 20 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.0 ms
Discarding 23 places :
Also discarding 0 output transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 19 place count 3 transition count 2
Iterating global reduction 0 with 17 rules applied. Total rules applied 36 place count 3 transition count 2
Applied a total of 36 rules in 6 ms. Remains 3 /160 variables (removed 157) and now considering 2/296 (removed 294) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-22 21:50:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 21:50:16] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 21:50:16] [INFO ] Invariant cache hit.
[2024-05-22 21:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 21:50:16] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 21:50:16] [INFO ] Invariant cache hit.
[2024-05-22 21:50:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/160 places, 2/296 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 144 ms. Remains : 3/160 places, 2/296 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-13a-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 233 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-05-22 21:50:17] [INFO ] Invariant cache hit.
[2024-05-22 21:50:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 21:50:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-22 21:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:17] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 21:50:17] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 21:50:17] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-22 21:50:17] [INFO ] Invariant cache hit.
[2024-05-22 21:50:17] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 21:50:17] [INFO ] Invariant cache hit.
[2024-05-22 21:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 21:50:17] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 21:50:17] [INFO ] Invariant cache hit.
[2024-05-22 21:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 3/3 places, 2/2 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 21:50:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-22 21:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:18] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-22 21:50:18] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-22 21:50:18] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 21:50:18] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/5 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/5 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/4 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/5 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/5 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5/5 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 3/3 places, 2/2 transitions.
Treatment of property DLCround-PT-13a-LTLCardinality-02 finished in 1894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U G(!p0)))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 137 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 134 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 134 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 134 transition count 289
Applied a total of 30 rules in 12 ms. Remains 134 /160 variables (removed 26) and now considering 289/296 (removed 7) transitions.
[2024-05-22 21:50:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
// Phase 1: matrix 226 rows 134 cols
[2024-05-22 21:50:18] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 21:50:18] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 21:50:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:18] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 21:50:18] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2024-05-22 21:50:18] [INFO ] Invariant cache hit.
[2024-05-22 21:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/359 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/360 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 154 constraints, problems are : Problem set: 0 solved, 288 unsolved in 14720 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/359 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 288/441 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/360 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 442 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11693 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 26508ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 26518ms
Starting structural reductions in LTL mode, iteration 1 : 134/160 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26743 ms. Remains : 134/160 places, 289/296 transitions.
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, true, p0]
Running random walk in product with property : DLCround-PT-13a-LTLCardinality-04
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLCardinality-04 finished in 26927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 137 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 134 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 134 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 134 transition count 289
Applied a total of 30 rules in 7 ms. Remains 134 /160 variables (removed 26) and now considering 289/296 (removed 7) transitions.
[2024-05-22 21:50:45] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2024-05-22 21:50:45] [INFO ] Invariant cache hit.
[2024-05-22 21:50:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 21:50:45] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2024-05-22 21:50:45] [INFO ] Invariant cache hit.
[2024-05-22 21:50:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:50:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 21:50:45] [INFO ] Flow matrix only has 226 transitions (discarded 63 similar events)
[2024-05-22 21:50:45] [INFO ] Invariant cache hit.
[2024-05-22 21:50:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/359 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (OVERLAPS) 1/360 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 154 constraints, problems are : Problem set: 0 solved, 288 unsolved in 13802 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 1/134 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (OVERLAPS) 225/359 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 288/441 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 8 (OVERLAPS) 1/360 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 442 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11730 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 134/134 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 0/0 constraints]
After SMT, in 25592ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 25597ms
Starting structural reductions in LTL mode, iteration 1 : 134/160 places, 289/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25787 ms. Remains : 134/160 places, 289/296 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DLCround-PT-13a-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 486 ms.
Product exploration explored 100000 steps with 50000 reset in 318 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Graph (complete) has 307 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 1 stable transitions
Detected a total of 2/134 stabilizing places and 1/289 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-13a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-13a-LTLCardinality-08 finished in 26721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 296/296 transitions.
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 137 transition count 296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 135 transition count 292
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 135 transition count 292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 28 place count 135 transition count 291
Applied a total of 28 rules in 8 ms. Remains 135 /160 variables (removed 25) and now considering 291/296 (removed 5) transitions.
[2024-05-22 21:51:12] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
// Phase 1: matrix 227 rows 135 cols
[2024-05-22 21:51:12] [INFO ] Computed 19 invariants in 4 ms
[2024-05-22 21:51:12] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 21:51:12] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2024-05-22 21:51:12] [INFO ] Invariant cache hit.
[2024-05-22 21:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 21:51:12] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 290 sub problems to find dead transitions.
[2024-05-22 21:51:12] [INFO ] Flow matrix only has 227 transitions (discarded 64 similar events)
[2024-05-22 21:51:12] [INFO ] Invariant cache hit.
[2024-05-22 21:51:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (OVERLAPS) 1/362 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (OVERLAPS) 0/362 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 155 constraints, problems are : Problem set: 0 solved, 290 unsolved in 14272 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 1 (OVERLAPS) 1/134 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 5 (OVERLAPS) 226/361 variables, 135/154 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 290/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 8 (OVERLAPS) 1/362 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 290 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 445 constraints, problems are : Problem set: 0 solved, 290 unsolved in 12398 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 290/290 constraints, Known Traps: 0/0 constraints]
After SMT, in 26723ms problems are : Problem set: 0 solved, 290 unsolved
Search for dead transitions found 0 dead transitions in 26728ms
Starting structural reductions in LTL mode, iteration 1 : 135/160 places, 291/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26921 ms. Remains : 135/160 places, 291/296 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-13a-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-13a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-13a-LTLCardinality-11 finished in 27184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-22 21:51:39] [INFO ] Flatten gal took : 19 ms
[2024-05-22 21:51:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-22 21:51:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 296 transitions and 633 arcs took 5 ms.
Total runtime 90667 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DLCround-PT-13a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 160
TRANSITIONS: 296
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 807
MODEL NAME: /home/mcc/execution/415/model
160 places, 296 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DLCround-PT-13a-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716414700683

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DLCround-PT-13a, 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 r113-smll-171624274600275"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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