Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048876000948.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FamilyReunion-PT-L00020M0002C001P001G001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048876000948
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 129K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 838K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 276K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 998K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 23 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 23 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 49K Mar 22 18:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Mar 22 18:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 24 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.3M May 5 16:51 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 FamilyReunion-PT-L00020M0002C001P001G001-00
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-01
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-02
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-03
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-04
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-05
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-06
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-07
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-08
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-09
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-10
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-11
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-12
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-13
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-14
FORMULA_NAME FamilyReunion-PT-L00020M0002C001P001G001-15

=== Now, execution of the tool begins

BK_START 1620712931299

Running Version 0
[2021-05-11 06:02:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 06:02:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 06:02:13] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-11 06:02:13] [INFO ] Transformed 3271 places.
[2021-05-11 06:02:13] [INFO ] Transformed 2753 transitions.
[2021-05-11 06:02:13] [INFO ] Parsed PT model containing 3271 places and 2753 transitions in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
[2021-05-11 06:02:13] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 11 places and 0 transitions.
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 784 out of 3260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3260/3260 places, 2753/2753 transitions.
Reduce places removed 72 places and 0 transitions.
Discarding 312 places :
Implicit places reduction removed 312 places
Iterating post reduction 0 with 384 rules applied. Total rules applied 384 place count 2876 transition count 2753
Discarding 186 places :
Symmetric choice reduction at 1 with 186 rule applications. Total rules 570 place count 2690 transition count 2547
Iterating global reduction 1 with 186 rules applied. Total rules applied 756 place count 2690 transition count 2547
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 1 with 21 rules applied. Total rules applied 777 place count 2669 transition count 2547
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 840 place count 2606 transition count 2464
Iterating global reduction 2 with 63 rules applied. Total rules applied 903 place count 2606 transition count 2464
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 924 place count 2585 transition count 2464
Applied a total of 924 rules in 984 ms. Remains 2585 /3260 variables (removed 675) and now considering 2464/2753 (removed 289) transitions.
// Phase 1: matrix 2464 rows 2585 cols
[2021-05-11 06:02:14] [INFO ] Computed 346 place invariants in 124 ms
[2021-05-11 06:02:15] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-11 06:02:15] [INFO ] Implicit Places using invariants in 1033 ms returned [251, 1921]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1064 ms to find 2 implicit places.
// Phase 1: matrix 2464 rows 2583 cols
[2021-05-11 06:02:15] [INFO ] Computed 344 place invariants in 66 ms
[2021-05-11 06:02:17] [INFO ] Dead Transitions using invariants and state equation in 1677 ms returned []
Starting structural reductions, iteration 1 : 2583/3260 places, 2464/2753 transitions.
Applied a total of 0 rules in 77 ms. Remains 2583 /2583 variables (removed 0) and now considering 2464/2464 (removed 0) transitions.
// Phase 1: matrix 2464 rows 2583 cols
[2021-05-11 06:02:17] [INFO ] Computed 344 place invariants in 66 ms
[2021-05-11 06:02:19] [INFO ] Dead Transitions using invariants and state equation in 1731 ms returned []
Finished structural reductions, in 2 iterations. Remains : 2583/3260 places, 2464/2753 transitions.
[2021-05-11 06:02:19] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-11 06:02:19] [INFO ] Flatten gal took : 173 ms
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FamilyReunion-PT-L00020M0002C001P001G001-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-11 06:02:19] [INFO ] Flatten gal took : 115 ms
[2021-05-11 06:02:19] [INFO ] Input system was already deterministic with 2464 transitions.
Incomplete random walk after 100000 steps, including 82 resets, run finished after 800 ms. (steps per millisecond=125 ) properties (out of 21) seen :20
Running SMT prover for 1 properties.
// Phase 1: matrix 2464 rows 2583 cols
[2021-05-11 06:02:20] [INFO ] Computed 344 place invariants in 26 ms
[2021-05-11 06:02:21] [INFO ] [Real]Absence check using 0 positive and 344 generalized place invariants in 96 ms returned sat
[2021-05-11 06:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 06:02:22] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2021-05-11 06:02:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 06:02:22] [INFO ] [Nat]Absence check using 0 positive and 344 generalized place invariants in 93 ms returned sat
[2021-05-11 06:02:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 06:02:23] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2021-05-11 06:02:24] [INFO ] Computed and/alt/rep : 2271/2966/2271 causal constraints (skipped 172 transitions) in 140 ms.
[2021-05-11 06:02:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U (p1&&X(F((p2||X(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 107 out of 2583 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2583/2583 places, 2464/2464 transitions.
Reduce places removed 4 places and 0 transitions.
Discarding 66 places :
Implicit places reduction removed 66 places
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 2513 transition count 2464
Discarding 130 places :
Symmetric choice reduction at 1 with 130 rule applications. Total rules 200 place count 2383 transition count 2333
Iterating global reduction 1 with 130 rules applied. Total rules applied 330 place count 2383 transition count 2333
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 1 with 41 rules applied. Total rules applied 371 place count 2363 transition count 2312
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 394 place count 2340 transition count 2249
Iterating global reduction 2 with 23 rules applied. Total rules applied 417 place count 2340 transition count 2249
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 2 with 21 rules applied. Total rules applied 438 place count 2319 transition count 2249
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 481 place count 2276 transition count 2186
Iterating global reduction 3 with 43 rules applied. Total rules applied 524 place count 2276 transition count 2186
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 587 place count 2213 transition count 2123
Iterating global reduction 3 with 63 rules applied. Total rules applied 650 place count 2213 transition count 2123
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 20 places :
Implicit places reduction removed 20 places
Iterating post reduction 3 with 41 rules applied. Total rules applied 691 place count 2193 transition count 2102
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 733 place count 2151 transition count 2060
Iterating global reduction 4 with 42 rules applied. Total rules applied 775 place count 2151 transition count 2060
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 817 place count 2109 transition count 2018
Iterating global reduction 4 with 42 rules applied. Total rules applied 859 place count 2109 transition count 2018
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 901 place count 2067 transition count 1976
Iterating global reduction 4 with 42 rules applied. Total rules applied 943 place count 2067 transition count 1976
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 985 place count 2025 transition count 1934
Iterating global reduction 4 with 42 rules applied. Total rules applied 1027 place count 2025 transition count 1934
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1069 place count 1983 transition count 1892
Iterating global reduction 4 with 42 rules applied. Total rules applied 1111 place count 1983 transition count 1892
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1153 place count 1941 transition count 1850
Iterating global reduction 4 with 42 rules applied. Total rules applied 1195 place count 1941 transition count 1850
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1237 place count 1899 transition count 1808
Iterating global reduction 4 with 42 rules applied. Total rules applied 1279 place count 1899 transition count 1808
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1321 place count 1857 transition count 1766
Iterating global reduction 4 with 42 rules applied. Total rules applied 1363 place count 1857 transition count 1766
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1405 place count 1815 transition count 1724
Iterating global reduction 4 with 42 rules applied. Total rules applied 1447 place count 1815 transition count 1724
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1489 place count 1773 transition count 1682
Iterating global reduction 4 with 42 rules applied. Total rules applied 1531 place count 1773 transition count 1682
Discarding 42 places :
Symmetric choice reduction at 4 with 42 rule applications. Total rules 1573 place count 1731 transition count 1640
Iterating global reduction 4 with 42 rules applied. Total rules applied 1615 place count 1731 transition count 1640
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Discarding 21 places :
Implicit places reduction removed 21 places
Iterating post reduction 4 with 63 rules applied. Total rules applied 1678 place count 1710 transition count 1598
Applied a total of 1678 rules in 1371 ms. Remains 1710 /2583 variables (removed 873) and now considering 1598/2464 (removed 866) transitions.
// Phase 1: matrix 1598 rows 1710 cols
[2021-05-11 06:02:43] [INFO ] Computed 194 place invariants in 19 ms
[2021-05-11 06:02:44] [INFO ] Implicit Places using invariants in 499 ms returned [273, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453, 454, 455, 456, 457, 458, 459, 460, 461, 462, 740, 741, 742, 743, 744, 745, 746, 747, 748, 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 803, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1499]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 510 ms to find 66 implicit places.
// Phase 1: matrix 1598 rows 1644 cols
[2021-05-11 06:02:44] [INFO ] Computed 128 place invariants in 15 ms
[2021-05-11 06:02:45] [INFO ] Dead Transitions using invariants and state equation in 811 ms returned []
Starting structural reductions, iteration 1 : 1644/2583 places, 1598/2464 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 1603 transition count 1557
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 1603 transition count 1557
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 1583 transition count 1517
Iterating global reduction 0 with 20 rules applied. Total rules applied 122 place count 1583 transition count 1517
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 142 place count 1563 transition count 1477
Iterating global reduction 0 with 20 rules applied. Total rules applied 162 place count 1563 transition count 1477
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 182 place count 1543 transition count 1457
Iterating global reduction 0 with 20 rules applied. Total rules applied 202 place count 1543 transition count 1457
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 222 place count 1523 transition count 1437
Iterating global reduction 0 with 20 rules applied. Total rules applied 242 place count 1523 transition count 1437
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 282 place count 1483 transition count 1397
Iterating global reduction 0 with 40 rules applied. Total rules applied 322 place count 1483 transition count 1397
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 342 place count 1463 transition count 1357
Iterating global reduction 0 with 20 rules applied. Total rules applied 362 place count 1463 transition count 1357
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 382 place count 1443 transition count 1337
Iterating global reduction 0 with 20 rules applied. Total rules applied 402 place count 1443 transition count 1337
Applied a total of 402 rules in 924 ms. Remains 1443 /1644 variables (removed 201) and now considering 1337/1598 (removed 261) transitions.
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:46] [INFO ] Computed 128 place invariants in 7 ms
[2021-05-11 06:02:46] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:46] [INFO ] Computed 128 place invariants in 7 ms
[2021-05-11 06:02:47] [INFO ] Implicit Places using invariants and state equation in 795 ms returned []
Implicit Place search using SMT with State Equation took 1055 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1443/2583 places, 1337/2464 transitions.
Stuttering acceptance computed with spot in 737 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : FamilyReunion-PT-L00020M0002C001P001G001-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ (ADD s1107 s1108 s1109 s1110 s1111 s1112 s1113 s1114 s1115 s1116 s1117 s1118 s1119 s1120 s1121 s1122 s1123 s1124 s1125 s1126 s1127 s1128 s1129 s1130 s1131 s1132 s1133 s1134 s1135 s1136 s1137 s1138 s1139 s1140 s1141 s1142 s1143 s1144 s1145 s1146 s1147 s1148) (ADD s1233 s1234 s1235 s1236 s1237 s1238 s1239 s1240 s1241 s1242 s1243 s1244 s1245 s1246 s1247 s1248 s1249 s1250 s1251 s1252 s1253 s1254 s1255 s1256 s1257 s1258 s1259 s1260 s1261 s1262 s1263 s1264 s1265 s1266 s1267 s1268 s1269 s1270 s1271 s1272 s1273 s1274)), p0:(LEQ 2 (ADD s918 s919 s920 s921 s922 s923 s924 s925 s926 s927 s928 s929 s930 s931 s932 s933 s934 s935 s936 s937 s938)), p2:(LEQ 1 (ADD s554 s555))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 107 reset in 389 ms.
Product exploration explored 100000 steps with 107 reset in 359 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1443 transition count 1337
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), p1, (NOT p0), (NOT p2)]
Adopting property with smaller alphabet thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 86 out of 1443 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1443/1443 places, 1337/1337 transitions.
Applied a total of 0 rules in 56 ms. Remains 1443 /1443 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:49] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:02:49] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:49] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:02:50] [INFO ] Implicit Places using invariants and state equation in 807 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:50] [INFO ] Computed 128 place invariants in 7 ms
[2021-05-11 06:02:51] [INFO ] Dead Transitions using invariants and state equation in 683 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1443/1443 places, 1337/1337 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 208 reset in 391 ms.
Product exploration explored 100000 steps with 207 reset in 387 ms.
Applying partial POR strategy [true, true, true]
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p1 (NOT p2))]
Support contains 86 out of 1443 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 1443/1443 places, 1337/1337 transitions.
Performed 506 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 506 rules applied. Total rules applied 506 place count 1443 transition count 1337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 507 place count 1443 transition count 1336
Performed 506 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 506 Pre rules applied. Total rules applied 507 place count 1443 transition count 1589
Deduced a syphon composed of 1012 places in 0 ms
Iterating global reduction 2 with 506 rules applied. Total rules applied 1013 place count 1443 transition count 1589
Discarding 673 places :
Symmetric choice reduction at 2 with 673 rule applications. Total rules 1686 place count 770 transition count 916
Deduced a syphon composed of 339 places in 0 ms
Iterating global reduction 2 with 673 rules applied. Total rules applied 2359 place count 770 transition count 916
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 384 places in 1 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 2404 place count 770 transition count 916
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 2470 place count 704 transition count 850
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 2536 place count 704 transition count 850
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 339 places in 1 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2557 place count 704 transition count 892
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 2578 place count 683 transition count 850
Deduced a syphon composed of 318 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 2599 place count 683 transition count 850
Deduced a syphon composed of 318 places in 0 ms
Applied a total of 2599 rules in 505 ms. Remains 683 /1443 variables (removed 760) and now considering 850/1337 (removed 487) transitions.
[2021-05-11 06:02:52] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 850 rows 683 cols
[2021-05-11 06:02:52] [INFO ] Computed 128 place invariants in 5 ms
[2021-05-11 06:02:53] [INFO ] Dead Transitions using invariants and state equation in 368 ms returned []
Finished structural reductions, in 1 iterations. Remains : 683/1443 places, 850/1337 transitions.
Product exploration explored 100000 steps with 9562 reset in 593 ms.
Product exploration explored 100000 steps with 9789 reset in 570 ms.
Starting structural reductions, iteration 0 : 1443/1443 places, 1337/1337 transitions.
Applied a total of 0 rules in 60 ms. Remains 1443 /1443 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:54] [INFO ] Computed 128 place invariants in 21 ms
[2021-05-11 06:02:54] [INFO ] Implicit Places using invariants in 300 ms returned []
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:54] [INFO ] Computed 128 place invariants in 6 ms
[2021-05-11 06:02:55] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1144 ms to find 0 implicit places.
// Phase 1: matrix 1337 rows 1443 cols
[2021-05-11 06:02:55] [INFO ] Computed 128 place invariants in 11 ms
[2021-05-11 06:02:56] [INFO ] Dead Transitions using invariants and state equation in 638 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1443/1443 places, 1337/1337 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:835)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:825)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1620712977633

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="FamilyReunion-PT-L00020M0002C001P001G001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is FamilyReunion-PT-L00020M0002C001P001G001, 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 r083-tall-162048876000948"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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