fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r128-tall-162075419600282
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-0500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2603.903 396455.00 501437.00 2886.20 T normal

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.r128-tall-162075419600282.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 JoinFreeModules-PT-0500, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-tall-162075419600282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 135K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 24 11:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 24 11:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 2.9M 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1620857790308

Running Version 0
[2021-05-12 22:16:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -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, 1800]
[2021-05-12 22:16:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 22:16:32] [INFO ] Load time of PNML (sax parser for PT used): 324 ms
[2021-05-12 22:16:32] [INFO ] Transformed 2501 places.
[2021-05-12 22:16:32] [INFO ] Transformed 4001 transitions.
[2021-05-12 22:16:32] [INFO ] Parsed PT model containing 2501 places and 4001 transitions in 383 ms.
Starting structural reductions, iteration 0 : 2501/2501 places, 4001/4001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 4001
Applied a total of 1 rules in 219 ms. Remains 2500 /2501 variables (removed 1) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-12 22:16:33] [INFO ] Computed 500 place invariants in 45 ms
[2021-05-12 22:16:35] [INFO ] Dead Transitions using invariants and state equation in 2193 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-12 22:16:35] [INFO ] Computed 500 place invariants in 17 ms
[2021-05-12 22:16:35] [INFO ] Implicit Places using invariants in 525 ms returned []
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-12 22:16:35] [INFO ] Computed 500 place invariants in 10 ms
[2021-05-12 22:16:37] [INFO ] Implicit Places using invariants and state equation in 1614 ms returned []
Implicit Place search using SMT with State Equation took 2141 ms to find 0 implicit places.
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-12 22:16:37] [INFO ] Computed 500 place invariants in 9 ms
[2021-05-12 22:16:39] [INFO ] Dead Transitions using invariants and state equation in 1999 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2500/2501 places, 4001/4001 transitions.
Discarding 2000 transitions out of 4001. Remains 2001
[2021-05-12 22:16:39] [INFO ] Initial state test concluded for 1 properties.
Incomplete random walk after 10027 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 2000) seen :33
Probabilistic random walk after 30001 steps, saw 29953 distinct states, run finished after 4015 ms. (steps per millisecond=7 ) properties seen :{1=1, 5=1, 9=1, 13=1, 17=1, 24=1, 28=1, 32=1, 36=1, 40=1, 44=1, 48=1, 52=1, 56=1, 63=1, 67=1, 71=1, 75=1, 79=1, 83=1, 87=1, 91=1, 95=1, 99=1, 103=1, 107=1, 111=1, 115=1, 119=1, 123=1, 127=1, 131=1, 135=1, 139=1, 143=1, 147=1, 151=1, 155=1, 159=1, 163=1, 167=1, 171=1, 178=1, 182=1, 186=1, 190=1, 194=1, 198=1, 202=1, 206=1, 210=1, 214=1, 218=1, 222=1, 226=1, 230=1, 234=1, 238=1, 242=1, 246=1, 250=1, 254=1, 258=1, 262=1, 266=1, 270=1, 274=1, 278=1, 282=1, 286=1, 290=1, 294=1, 298=1, 302=1, 304=1, 308=1, 312=1, 316=1, 320=1, 324=1, 328=1, 332=1, 336=1, 340=1, 344=1, 351=1, 355=1, 359=1, 363=1, 367=1, 371=1, 375=1, 379=1, 383=1, 387=1, 391=1, 395=1, 399=1, 403=1, 407=1, 411=1, 415=1, 419=1, 423=1, 427=1, 431=1, 435=1, 439=1, 443=1, 447=1, 451=1, 453=1, 457=1, 461=1, 465=1, 469=1, 473=1, 477=1, 481=1, 485=1, 489=1, 493=1, 497=1, 501=1, 505=1, 509=1, 513=1, 517=1, 521=1, 525=1, 529=1, 533=1, 537=1, 541=1, 545=1, 549=1, 553=1, 557=1, 561=1, 563=1, 567=1, 571=1, 575=1, 579=1, 583=1, 587=1, 591=1, 595=1, 599=1, 603=1, 607=1, 611=1, 615=1, 619=1, 623=1, 627=1, 631=1, 635=1, 639=1, 643=1, 647=1, 651=1, 655=1, 659=1, 663=1, 667=1, 671=1, 675=1, 679=1, 683=1, 687=1, 691=1, 695=1, 699=1, 703=1, 707=1, 711=1, 718=1, 722=1, 726=1, 730=1, 734=1, 738=1, 742=1, 746=1, 750=1, 754=1, 758=1, 762=1, 766=1, 770=1, 774=1, 778=1, 782=1, 786=1, 790=1, 794=1, 798=1, 802=1, 806=1, 810=1, 814=1, 818=1, 822=1, 826=1, 830=1, 834=1, 838=1, 842=1, 846=1, 850=1, 854=1, 858=1, 862=1, 866=1, 870=1, 874=1, 878=1, 882=1, 892=1, 896=1, 900=1, 904=1, 908=1, 912=1, 916=1, 920=1, 924=1, 928=1, 932=1, 936=1, 940=1, 944=1, 948=1, 952=1, 956=1, 960=1, 964=1, 968=1, 972=1, 974=1, 981=1, 985=1, 989=1, 993=1, 997=1, 1001=1, 1005=1, 1009=1, 1013=1, 1017=1, 1021=1, 1025=1, 1029=1, 1033=1, 1040=1, 1044=1, 1048=1, 1052=1, 1056=1, 1060=1, 1064=1, 1068=1, 1072=1, 1076=1, 1080=1, 1084=1, 1088=1, 1095=1, 1099=1, 1103=1, 1107=1, 1111=1, 1115=1, 1119=1, 1123=1, 1127=1, 1131=1, 1135=1, 1142=1, 1146=1, 1150=1, 1154=1, 1158=1, 1162=1, 1166=1, 1170=1, 1174=1, 1178=1, 1182=1, 1186=1, 1190=1, 1194=1, 1198=1, 1202=1, 1206=1, 1210=1, 1214=1, 1218=1, 1222=1, 1226=1, 1228=1, 1232=1, 1236=1, 1240=1, 1244=1, 1248=1, 1252=1, 1256=1, 1260=1, 1264=1, 1268=1, 1272=1, 1276=1, 1280=1, 1284=1, 1288=1, 1292=1, 1296=1, 1300=1, 1304=1, 1308=1, 1312=1, 1316=1, 1320=1, 1324=1, 1328=1, 1332=1, 1336=1, 1340=1, 1344=1, 1351=1, 1353=1, 1357=1, 1361=1, 1365=1, 1369=1, 1373=1, 1377=1, 1381=1, 1385=1, 1389=1, 1393=1, 1397=1, 1401=1, 1405=1, 1409=1, 1413=1, 1417=1, 1421=1, 1425=1, 1429=1, 1433=1, 1437=1, 1441=1, 1446=1, 1450=1, 1454=1, 1458=1, 1462=1, 1466=1, 1470=1, 1474=1, 1478=1, 1482=1, 1486=1, 1490=1, 1494=1, 1498=1, 1502=1, 1506=1, 1510=1, 1514=1, 1518=1, 1522=1, 1526=1, 1530=1, 1534=1, 1538=1, 1542=1, 1546=1, 1550=1, 1554=1, 1558=1, 1562=1, 1566=1, 1570=1, 1574=1, 1578=1, 1582=1, 1589=1, 1593=1, 1597=1, 1601=1, 1605=1, 1609=1, 1613=1, 1617=1, 1621=1, 1625=1, 1629=1, 1633=1, 1637=1, 1641=1, 1645=1, 1649=1, 1653=1, 1657=1, 1661=1, 1665=1, 1669=1, 1673=1, 1677=1, 1681=1, 1685=1, 1689=1, 1693=1, 1697=1, 1701=1, 1705=1, 1709=1, 1713=1, 1717=1, 1721=1, 1725=1, 1729=1, 1733=1, 1737=1, 1741=1, 1745=1, 1749=1, 1753=1, 1757=1, 1761=1, 1765=1, 1769=1, 1773=1, 1777=1, 1781=1, 1785=1, 1789=1, 1793=1, 1797=1, 1801=1, 1805=1, 1809=1, 1813=1, 1817=1, 1821=1, 1825=1, 1829=1, 1833=1, 1837=1, 1841=1, 1845=1, 1849=1, 1853=1, 1857=1, 1861=1, 1865=1, 1869=1, 1873=1, 1877=1, 1881=1, 1885=1, 1889=1, 1893=1, 1897=1, 1901=1, 1903=1, 1907=1, 1911=1, 1915=1, 1919=1, 1923=1, 1927=1, 1931=1, 1935=1, 1939=1, 1943=1, 1947=1, 1951=1, 1958=1, 1962=1, 1965=1, 1966=1}
Running SMT prover for 1481 properties.
// Phase 1: matrix 4001 rows 2500 cols
[2021-05-12 22:16:43] [INFO ] Computed 500 place invariants in 8 ms
[2021-05-12 22:17:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
Fused 1481 Parikh solutions to 1 different solutions.
Support contains 1481 out of 2500 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 2495 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.12 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 3992
Applied a total of 2 rules in 320 ms. Remains 2495 /2500 variables (removed 5) and now considering 3992/4001 (removed 9) transitions.
// Phase 1: matrix 3992 rows 2495 cols
[2021-05-12 22:17:09] [INFO ] Computed 499 place invariants in 17 ms
[2021-05-12 22:17:11] [INFO ] Dead Transitions using invariants and state equation in 1950 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2495/2500 places, 3992/4001 transitions.
[2021-05-12 22:17:11] [INFO ] Flatten gal took : 254 ms
[2021-05-12 22:17:11] [INFO ] Flatten gal took : 140 ms
[2021-05-12 22:17:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3995336498816435386.gal : 42 ms
[2021-05-12 22:17:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1847996212858486120.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3995336498816435386.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1847996212858486120.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality3995336498816435386.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1847996212858486120.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1847996212858486120.prop.
SDD proceeding with computation,1481 properties remain. new max is 4
SDD size :1 after 8
Reachability property qltransition_1 is true.
SDD proceeding with computation,1480 properties remain. new max is 4
SDD size :8 after 25
SDD proceeding with computation,1480 properties remain. new max is 8
SDD size :25 after 50
SDD proceeding with computation,1480 properties remain. new max is 16
SDD size :50 after 116
Detected timeout of ITS tools.
[2021-05-12 22:17:26] [INFO ] Flatten gal took : 112 ms
[2021-05-12 22:17:26] [INFO ] Applying decomposition
[2021-05-12 22:17:27] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13828222458681371893.txt, -o, /tmp/graph13828222458681371893.bin, -w, /tmp/graph13828222458681371893.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph13828222458681371893.bin, -l, -1, -v, -w, /tmp/graph13828222458681371893.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:17:30] [INFO ] Decomposing Gal with order
[2021-05-12 22:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:17:30] [INFO ] Flatten gal took : 96 ms
[2021-05-12 22:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:17:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2530865013744207605.gal : 22 ms
[2021-05-12 22:17:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11989335798853348025.prop : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2530865013744207605.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11989335798853348025.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality2530865013744207605.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11989335798853348025.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11989335798853348025.prop.
SDD proceeding with computation,1480 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1480 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,1480 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,1480 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,1480 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,1480 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,1480 properties remain. new max is 256
SDD size :3104 after 11747
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13567221305289083556
[2021-05-12 22:17:46] [INFO ] Built C files in 76ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13567221305289083556
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13567221305289083556]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13567221305289083556] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13567221305289083556] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 23065 ms. (steps per millisecond=43 ) properties (out of 1480) seen :1439
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2306 ms. (steps per millisecond=43 ) properties (out of 41) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2247 ms. (steps per millisecond=44 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2219 ms. (steps per millisecond=45 ) properties (out of 39) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2222 ms. (steps per millisecond=45 ) properties (out of 39) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2235 ms. (steps per millisecond=44 ) properties (out of 37) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2245 ms. (steps per millisecond=44 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2221 ms. (steps per millisecond=45 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2220 ms. (steps per millisecond=45 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2285 ms. (steps per millisecond=43 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2226 ms. (steps per millisecond=44 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2236 ms. (steps per millisecond=44 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2222 ms. (steps per millisecond=45 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2254 ms. (steps per millisecond=44 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2208 ms. (steps per millisecond=45 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2259 ms. (steps per millisecond=44 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2202 ms. (steps per millisecond=45 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2233 ms. (steps per millisecond=44 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2221 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2222 ms. (steps per millisecond=45 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2212 ms. (steps per millisecond=45 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2234 ms. (steps per millisecond=44 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2208 ms. (steps per millisecond=45 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2209 ms. (steps per millisecond=45 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2231 ms. (steps per millisecond=44 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2245 ms. (steps per millisecond=44 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2194 ms. (steps per millisecond=45 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
// Phase 1: matrix 3992 rows 2495 cols
[2021-05-12 22:19:09] [INFO ] Computed 499 place invariants in 6 ms
[2021-05-12 22:19:09] [INFO ] [Real]Absence check using 499 positive place invariants in 123 ms returned sat
[2021-05-12 22:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:19:10] [INFO ] [Real]Absence check using state equation in 1143 ms returned sat
[2021-05-12 22:19:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:19:11] [INFO ] [Nat]Absence check using 499 positive place invariants in 108 ms returned sat
[2021-05-12 22:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:19:25] [INFO ] [Nat]Absence check using state equation in 13936 ms returned unknown
[2021-05-12 22:19:25] [INFO ] [Real]Absence check using 499 positive place invariants in 110 ms returned sat
[2021-05-12 22:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:19:26] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2021-05-12 22:19:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:19:27] [INFO ] [Nat]Absence check using 499 positive place invariants in 98 ms returned sat
[2021-05-12 22:19:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:19:46] [INFO ] [Nat]Absence check using state equation in 18900 ms returned sat
[2021-05-12 22:19:46] [INFO ] Deduced a trap composed of 3 places in 468 ms of which 9 ms to minimize.
[2021-05-12 22:19:46] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2021-05-12 22:19:47] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2021-05-12 22:19:47] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2021-05-12 22:19:47] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2021-05-12 22:19:47] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2021-05-12 22:19:47] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2021-05-12 22:19:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2021-05-12 22:19:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2021-05-12 22:19:49] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2021-05-12 22:19:49] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2021-05-12 22:19:49] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2021-05-12 22:19:50] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2021-05-12 22:19:51] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2021-05-12 22:19:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 22:19:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2021-05-12 22:19:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2021-05-12 22:19:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2021-05-12 22:19:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2021-05-12 22:19:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 22:19:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 22:19:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 22:19:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2021-05-12 22:19:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 8 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 22:19:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 22:19:55] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 22:19:55] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 9131 ms
[2021-05-12 22:19:55] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 206 ms.
[2021-05-12 22:20:11] [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 1
[2021-05-12 22:20:12] [INFO ] [Real]Absence check using 499 positive place invariants in 99 ms returned sat
[2021-05-12 22:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:20:13] [INFO ] [Real]Absence check using state equation in 1200 ms returned sat
[2021-05-12 22:20:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:20:13] [INFO ] [Nat]Absence check using 499 positive place invariants in 96 ms returned sat
[2021-05-12 22:20:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:20:24] [INFO ] [Nat]Absence check using state equation in 10368 ms returned sat
[2021-05-12 22:20:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2021-05-12 22:20:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2021-05-12 22:20:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 22:20:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2021-05-12 22:20:24] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 22:20:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
[2021-05-12 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 5 ms to minimize.
[2021-05-12 22:20:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 22:20:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 22:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 22:20:28] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 22:20:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 22:20:29] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 22:20:29] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 5155 ms
[2021-05-12 22:20:29] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 189 ms.
[2021-05-12 22:20:35] [INFO ] Added : 35 causal constraints over 7 iterations in 5939 ms. Result :sat
[2021-05-12 22:20:35] [INFO ] [Real]Absence check using 499 positive place invariants in 91 ms returned sat
[2021-05-12 22:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:20:36] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2021-05-12 22:20:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:20:37] [INFO ] [Nat]Absence check using 499 positive place invariants in 99 ms returned sat
[2021-05-12 22:20:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:20:52] [INFO ] [Nat]Absence check using state equation in 15601 ms returned unknown
[2021-05-12 22:20:53] [INFO ] [Real]Absence check using 499 positive place invariants in 95 ms returned sat
[2021-05-12 22:20:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:20:54] [INFO ] [Real]Absence check using state equation in 1170 ms returned sat
[2021-05-12 22:20:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:20:54] [INFO ] [Nat]Absence check using 499 positive place invariants in 99 ms returned sat
[2021-05-12 22:20:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:21:09] [INFO ] [Nat]Absence check using state equation in 14593 ms returned unknown
[2021-05-12 22:21:09] [INFO ] [Real]Absence check using 499 positive place invariants in 105 ms returned sat
[2021-05-12 22:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 22:21:10] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2021-05-12 22:21:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 22:21:11] [INFO ] [Nat]Absence check using 499 positive place invariants in 103 ms returned sat
[2021-05-12 22:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 22:21:21] [INFO ] [Nat]Absence check using state equation in 9861 ms returned sat
[2021-05-12 22:21:21] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2021-05-12 22:21:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2021-05-12 22:21:21] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2021-05-12 22:21:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2021-05-12 22:21:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2021-05-12 22:21:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 22:21:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2021-05-12 22:21:22] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2021-05-12 22:21:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2021-05-12 22:21:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2021-05-12 22:21:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 22:21:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 22:21:26] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 22:21:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 22:21:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 22:21:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 22:21:26] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 5400 ms
[2021-05-12 22:21:26] [INFO ] Computed and/alt/rep : 2994/7485/2994 causal constraints (skipped 0 transitions) in 179 ms.
[2021-05-12 22:21:34] [INFO ] Added : 45 causal constraints over 9 iterations in 8166 ms. Result :unknown
Fused 6 Parikh solutions to 3 different solutions.
Interrupted Parikh walk after 501227 steps, including 4 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties (out of 6) seen :2
Interrupted Parikh walk after 520039 steps, including 4 resets, run timeout after 30001 ms. (steps per millisecond=17 ) properties (out of 4) seen :2
Support contains 2 out of 2495 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2495/2495 places, 3992/3992 transitions.
Graph (complete) has 5988 edges and 2495 vertex of which 10 are kept as prefixes of interest. Removing 2485 places using SCC suffix rule.2 ms
Discarding 2485 places :
Also discarding 3976 output transitions
Drop transitions removed 3976 transitions
Applied a total of 1 rules in 7 ms. Remains 10 /2495 variables (removed 2485) and now considering 16/3992 (removed 3976) transitions.
Finished structural reductions, in 1 iterations. Remains : 10/2495 places, 16/3992 transitions.
[2021-05-12 22:22:34] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:22:34] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:22:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13442360082501245718.gal : 1 ms
[2021-05-12 22:22:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6245734603076757451.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality13442360082501245718.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6245734603076757451.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality13442360082501245718.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6245734603076757451.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6245734603076757451.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
Reachability property qltransition_201 is true.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :8 after 25
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :25 after 50
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :50 after 116
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :116 after 314
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :314 after 974
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :974 after 3336
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3336 after 12194
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :12194 after 46219
Detected timeout of ITS tools.
[2021-05-12 22:22:49] [INFO ] Flatten gal took : 1 ms
[2021-05-12 22:22:49] [INFO ] Applying decomposition
[2021-05-12 22:22:49] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15936112620877010405.txt, -o, /tmp/graph15936112620877010405.bin, -w, /tmp/graph15936112620877010405.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15936112620877010405.bin, -l, -1, -v, -w, /tmp/graph15936112620877010405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 22:22:49] [INFO ] Decomposing Gal with order
[2021-05-12 22:22:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 22:22:49] [INFO ] Flatten gal took : 20 ms
[2021-05-12 22:22:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 22:22:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16454357702865347100.gal : 0 ms
[2021-05-12 22:22:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15724387182010475392.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16454357702865347100.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15724387182010475392.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16454357702865347100.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15724387182010475392.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15724387182010475392.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 263
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :263 after 9469
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :9469 after 9469
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9469 after 18384
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :18384 after 38107
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :38107 after 84787
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :84787 after 162585
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :162585 after 286966
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10488999830617686589
[2021-05-12 22:23:04] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10488999830617686589
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin10488999830617686589]
Compilation finished in 116 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin10488999830617686589]
Link finished in 42 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, -i, qltransition_713==true], workingDir=/tmp/ltsmin10488999830617686589]
LTSmin run took 614 ms.
Found Violation
Able to resolve query QuasiLiveness after proving 2001 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK LTSMIN DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE SAT_SMT EXPLICIT

BK_STOP 1620858186763

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -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 1800 -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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 JoinFreeModules-PT-0500, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-tall-162075419600282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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