fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r180-tall-165277027900482
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for PolyORBNT-COL-S10J20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8152.144 1800000.00 2317811.00 5357.40 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r180-tall-165277027900482.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is PolyORBNT-COL-S10J20, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-165277027900482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 356K
-rw-r--r-- 1 mcc users 9.3K Apr 30 04:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 30 04:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 30 03:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 92K May 10 09:34 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 1652833617946

Running Version 0
[2022-05-18 00:26:59] [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]
[2022-05-18 00:26:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 00:26:59] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-18 00:27:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-18 00:27:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 614 ms
[2022-05-18 00:27:00] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2022-05-18 00:27:00] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2022-05-18 00:27:00] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2022-05-18 00:27:00] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2022-05-18 00:27:00] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2022-05-18 00:27:00] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2022-05-18 00:27:00] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 494 PT places and 11822.0 transition bindings in 27 ms.
[2022-05-18 00:27:00] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 62 ms.
[2022-05-18 00:27:00] [INFO ] Unfolded HLPN properties in 1 ms.
[2022-05-18 00:27:00] [INFO ] Unfolded HLPN to a Petri net with 494 places and 1670 transitions in 13 ms.
[2022-05-18 00:27:00] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_1011474307488570061.dot
[2022-05-18 00:27:00] [INFO ] Initial state test concluded for 2 properties.
Deduced a syphon composed of 20 places in 8 ms
Reduce places removed 20 places and 20 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=12 ) properties (out of 30) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-05-18 00:27:01] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2022-05-18 00:27:01] [INFO ] Computed 72 place invariants in 96 ms
[2022-05-18 00:27:02] [INFO ] [Real]Absence check using 65 positive place invariants in 40 ms returned sat
[2022-05-18 00:27:02] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:02] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-05-18 00:27:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:02] [INFO ] [Nat]Absence check using 65 positive place invariants in 31 ms returned sat
[2022-05-18 00:27:02] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:03] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2022-05-18 00:27:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:27:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 123 ms returned sat
[2022-05-18 00:27:03] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 192 ms.
[2022-05-18 00:27:05] [INFO ] Deduced a trap composed of 19 places in 366 ms of which 4 ms to minimize.
[2022-05-18 00:27:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2022-05-18 00:27:05] [INFO ] Added : 34 causal constraints over 7 iterations in 1647 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-18 00:27:05] [INFO ] [Real]Absence check using 65 positive place invariants in 22 ms returned sat
[2022-05-18 00:27:05] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:05] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2022-05-18 00:27:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:06] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-18 00:27:06] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 00:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:07] [INFO ] [Nat]Absence check using state equation in 1683 ms returned sat
[2022-05-18 00:27:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 41 ms returned sat
[2022-05-18 00:27:08] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 226 ms.
[2022-05-18 00:27:08] [INFO ] Added : 12 causal constraints over 3 iterations in 595 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2022-05-18 00:27:08] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 00:27:08] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 00:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:09] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-05-18 00:27:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:09] [INFO ] [Nat]Absence check using 65 positive place invariants in 18 ms returned sat
[2022-05-18 00:27:09] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:09] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-05-18 00:27:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 136 ms returned sat
[2022-05-18 00:27:10] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 142 ms.
[2022-05-18 00:27:10] [INFO ] Added : 7 causal constraints over 2 iterations in 390 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-18 00:27:10] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 00:27:10] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:11] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-05-18 00:27:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:11] [INFO ] [Nat]Absence check using 65 positive place invariants in 17 ms returned sat
[2022-05-18 00:27:11] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-18 00:27:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:11] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2022-05-18 00:27:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2022-05-18 00:27:12] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 142 ms.
[2022-05-18 00:27:12] [INFO ] Added : 7 causal constraints over 2 iterations in 379 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 00:27:12] [INFO ] [Real]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-18 00:27:12] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 11 ms returned sat
[2022-05-18 00:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:13] [INFO ] [Real]Absence check using state equation in 580 ms returned sat
[2022-05-18 00:27:13] [INFO ] [Real]Added 1 Read/Feed constraints in 428 ms returned sat
[2022-05-18 00:27:13] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 142 ms.
[2022-05-18 00:27:13] [INFO ] Added : 5 causal constraints over 1 iterations in 384 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-05-18 00:27:14] [INFO ] [Real]Absence check using 65 positive place invariants in 29 ms returned sat
[2022-05-18 00:27:14] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 36 ms returned sat
[2022-05-18 00:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:15] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2022-05-18 00:27:15] [INFO ] [Real]Added 1 Read/Feed constraints in 14 ms returned sat
[2022-05-18 00:27:15] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 120 ms.
[2022-05-18 00:27:15] [INFO ] Added : 5 causal constraints over 1 iterations in 311 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-05-18 00:27:15] [INFO ] [Real]Absence check using 65 positive place invariants in 31 ms returned sat
[2022-05-18 00:27:15] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 00:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:16] [INFO ] [Real]Absence check using state equation in 386 ms returned sat
[2022-05-18 00:27:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:16] [INFO ] [Nat]Absence check using 65 positive place invariants in 19 ms returned sat
[2022-05-18 00:27:16] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:16] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-05-18 00:27:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2022-05-18 00:27:17] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 113 ms.
[2022-05-18 00:27:17] [INFO ] Added : 7 causal constraints over 2 iterations in 400 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-05-18 00:27:17] [INFO ] [Real]Absence check using 65 positive place invariants in 16 ms returned sat
[2022-05-18 00:27:17] [INFO ] [Real]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:17] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2022-05-18 00:27:18] [INFO ] [Real]Added 1 Read/Feed constraints in 30 ms returned sat
[2022-05-18 00:27:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:27:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 15 ms returned sat
[2022-05-18 00:27:18] [INFO ] [Nat]Absence check using 65 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-18 00:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:27:18] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2022-05-18 00:27:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2022-05-18 00:27:19] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 149 ms.
[2022-05-18 00:27:19] [INFO ] Added : 7 causal constraints over 2 iterations in 389 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 15200 steps, including 914 resets, run finished after 288 ms. (steps per millisecond=52 ) properties (out of 8) seen :3 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 157 resets, run finished after 58 ms. (steps per millisecond=67 ) properties (out of 5) seen :2 could not realise parikh vector
Incomplete Parikh walk after 2600 steps, including 119 resets, run finished after 15 ms. (steps per millisecond=173 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 1400 steps, including 94 resets, run finished after 9 ms. (steps per millisecond=155 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1000 steps, including 95 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 800 steps, including 88 resets, run finished after 7 ms. (steps per millisecond=114 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2500 steps, including 116 resets, run finished after 13 ms. (steps per millisecond=192 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1300 steps, including 92 resets, run finished after 8 ms. (steps per millisecond=162 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 24 out of 474 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 464 transition count 1624
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 62 place count 438 transition count 1599
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 112 place count 413 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 412 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 412 transition count 1598
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 410 transition count 1596
Applied a total of 118 rules in 424 ms. Remains 410 /474 variables (removed 64) and now considering 1596/1650 (removed 54) transitions.
[2022-05-18 00:27:20] [INFO ] Flow matrix only has 1587 transitions (discarded 9 similar events)
// Phase 1: matrix 1587 rows 410 cols
[2022-05-18 00:27:20] [INFO ] Computed 62 place invariants in 90 ms
[2022-05-18 00:27:21] [INFO ] Dead Transitions using invariants and state equation in 1018 ms returned [370, 371, 372, 373, 374, 375, 376, 377, 378, 379, 380, 381, 382, 383, 384, 385, 386, 387, 388, 389, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 406, 407, 408, 409, 411, 412, 413, 414, 415, 417, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 446, 447, 448, 449, 450, 452, 455, 456, 457, 458, 459, 460, 462, 465, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 502, 503, 504, 505, 506, 508, 511, 512, 513, 514, 515, 516, 518, 521, 525, 526, 527, 528, 529, 530, 531, 533, 536, 540, 545, 546, 547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 586, 587, 588, 589, 590, 592, 595, 596, 597, 598, 599, 600, 602, 605, 609, 610, 611, 612, 613, 614, 615, 617, 620, 624, 629, 630, 631, 632, 633, 634, 635, 636, 638, 641, 645, 650, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 669, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 691, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 706, 707, 708, 709, 710, 712, 715, 716, 717, 718, 719, 720, 722, 725, 729, 730, 731, 732, 733, 734, 735, 737, 740, 744, 749, 750, 751, 752, 753, 754, 755, 756, 758, 761, 765, 770, 776, 777, 778, 779, 780, 781, 782, 783, 784, 786, 789, 793, 798, 804, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, 842, 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 871, 872, 873, 874, 875, 877, 880, 881, 882, 883, 884, 885, 887, 890, 894, 895, 896, 897, 898, 899, 900, 902, 905, 909, 914, 915, 916, 917, 918, 919, 920, 921, 923, 926, 930, 935, 941, 942, 943, 944, 945, 946, 947, 948, 949, 951, 954, 958, 963, 969, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 987, 990, 994, 999, 1005, 1012, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1091, 1092, 1093, 1094, 1095, 1097, 1100, 1101, 1102, 1103, 1104, 1105, 1107, 1110, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1122, 1125, 1129, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1143, 1146, 1150, 1155, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1171, 1174, 1178, 1183, 1189, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1207, 1210, 1214, 1219, 1225, 1232, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1252, 1255, 1259, 1264, 1270, 1277, 1285, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1307, 1310, 1314, 1319, 1325, 1332, 1340, 1349, 1359]
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions :[1359, 1349, 1340, 1332, 1325, 1319, 1314, 1310, 1307, 1305, 1304, 1303, 1302, 1301, 1300, 1299, 1298, 1297, 1296, 1295, 1294, 1285, 1277, 1270, 1264, 1259, 1255, 1252, 1250, 1249, 1248, 1247, 1246, 1245, 1244, 1243, 1242, 1241, 1240, 1232, 1225, 1219, 1214, 1210, 1207, 1205, 1204, 1203, 1202, 1201, 1200, 1199, 1198, 1197, 1196, 1189, 1183, 1178, 1174, 1171, 1169, 1168, 1167, 1166, 1165, 1164, 1163, 1162, 1161, 1155, 1150, 1146, 1143, 1141, 1140, 1139, 1138, 1137, 1136, 1135, 1134, 1129, 1125, 1122, 1120, 1119, 1118, 1117, 1116, 1115, 1114, 1110, 1107, 1105, 1104, 1103, 1102, 1101, 1100, 1097, 1095, 1094, 1093, 1092, 1091, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1082, 1081, 1080, 1079, 1078, 1077, 1076, 1075, 1074, 1073, 1072, 1071, 1070, 1069, 1068, 1067, 1066, 1065, 1064, 1063, 1062, 1061, 1060, 1059, 1058, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1047, 1046, 1045, 1044, 1043, 1042, 1041, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1033, 1032, 1031, 1030, 1029, 1028, 1027, 1026, 1025, 1024, 1023, 1022, 1021, 1020, 1012, 1005, 999, 994, 990, 987, 985, 984, 983, 982, 981, 980, 979, 978, 977, 976, 969, 963, 958, 954, 951, 949, 948, 947, 946, 945, 944, 943, 942, 941, 935, 930, 926, 923, 921, 920, 919, 918, 917, 916, 915, 914, 909, 905, 902, 900, 899, 898, 897, 896, 895, 894, 890, 887, 885, 884, 883, 882, 881, 880, 877, 875, 874, 873, 872, 871, 869, 868, 867, 866, 865, 864, 863, 862, 861, 860, 859, 858, 857, 856, 855, 854, 853, 852, 851, 850, 849, 848, 847, 846, 845, 844, 843, 842, 841, 840, 839, 838, 837, 836, 835, 834, 833, 832, 831, 830, 829, 828, 827, 826, 825, 824, 823, 822, 821, 820, 819, 818, 817, 816, 815, 814, 813, 812, 811, 804, 798, 793, 789, 786, 784, 783, 782, 781, 780, 779, 778, 777, 776, 770, 765, 761, 758, 756, 755, 754, 753, 752, 751, 750, 749, 744, 740, 737, 735, 734, 733, 732, 731, 730, 729, 725, 722, 720, 719, 718, 717, 716, 715, 712, 710, 709, 708, 707, 706, 704, 703, 702, 701, 700, 699, 698, 697, 696, 695, 694, 693, 692, 691, 690, 689, 688, 687, 686, 685, 684, 683, 682, 681, 680, 679, 678, 677, 676, 675, 674, 673, 672, 671, 670, 669, 668, 667, 666, 665, 664, 663, 662, 661, 660, 659, 658, 657, 656, 650, 645, 641, 638, 636, 635, 634, 633, 632, 631, 630, 629, 624, 620, 617, 615, 614, 613, 612, 611, 610, 609, 605, 602, 600, 599, 598, 597, 596, 595, 592, 590, 589, 588, 587, 586, 584, 583, 582, 581, 580, 579, 578, 577, 576, 575, 574, 573, 572, 571, 570, 569, 568, 567, 566, 565, 564, 563, 562, 561, 560, 559, 558, 557, 556, 555, 554, 553, 552, 551, 550, 549, 548, 547, 546, 545, 540, 536, 533, 531, 530, 529, 528, 527, 526, 525, 521, 518, 516, 515, 514, 513, 512, 511, 508, 506, 505, 504, 503, 502, 500, 499, 498, 497, 496, 495, 494, 493, 492, 491, 490, 489, 488, 487, 486, 485, 484, 483, 482, 481, 480, 479, 478, 477, 476, 475, 474, 473, 472, 471, 470, 469, 465, 462, 460, 459, 458, 457, 456, 455, 452, 450, 449, 448, 447, 446, 444, 443, 442, 441, 440, 439, 438, 437, 436, 435, 434, 433, 432, 431, 430, 429, 428, 427, 426, 425, 424, 423, 422, 421, 420, 417, 415, 414, 413, 412, 411, 409, 408, 407, 406, 405, 404, 403, 402, 401, 400, 399, 398, 397, 396, 395, 394, 393, 392, 391, 389, 388, 387, 386, 385, 384, 383, 382, 381, 380, 379, 378, 377, 376, 375, 374, 373, 372, 371, 370]
Starting structural reductions, iteration 1 : 410/474 places, 981/1650 transitions.
Applied a total of 0 rules in 50 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 410/474 places, 981/1650 transitions.
[2022-05-18 00:27:22] [INFO ] Flatten gal took : 334 ms
[2022-05-18 00:27:22] [INFO ] Flatten gal took : 123 ms
[2022-05-18 00:27:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16516760596013649468.gal : 24 ms
[2022-05-18 00:27:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6350741204041571554.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/ReachabilityCardinality16516760596013649468.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6350741204041571554.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/ReachabilityCardinality16516760596013649468.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6350741204041571554.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6350741204041571554.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :96986 after 248582
Detected timeout of ITS tools.
[2022-05-18 00:27:37] [INFO ] Flatten gal took : 86 ms
[2022-05-18 00:27:37] [INFO ] Applying decomposition
[2022-05-18 00:27:37] [INFO ] Flatten gal took : 85 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/graph1848311857379892424.txt, -o, /tmp/graph1848311857379892424.bin, -w, /tmp/graph1848311857379892424.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/graph1848311857379892424.bin, -l, -1, -v, -w, /tmp/graph1848311857379892424.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:27:37] [INFO ] Decomposing Gal with order
[2022-05-18 00:27:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:27:37] [INFO ] Removed a total of 2800 redundant transitions.
[2022-05-18 00:27:37] [INFO ] Flatten gal took : 201 ms
[2022-05-18 00:27:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 48 ms.
[2022-05-18 00:27:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11095387867622663812.gal : 12 ms
[2022-05-18 00:27:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16589389423939624915.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/ReachabilityCardinality11095387867622663812.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16589389423939624915.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/ReachabilityCardinality11095387867622663812.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16589389423939624915.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16589389423939624915.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 524564
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :524564 after 524564
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :524564 after 653240
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :653240 after 653256
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :653256 after 653276
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9747187627226606504
[2022-05-18 00:27:53] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9747187627226606504
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/ltsmin9747187627226606504]
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/ltsmin9747187627226606504] 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/ltsmin9747187627226606504] 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 1000000 steps, including 72909 resets, run finished after 9142 ms. (steps per millisecond=109 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 9714 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:28:06] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:28:06] [INFO ] Computed 62 place invariants in 26 ms
[2022-05-18 00:28:06] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 00:28:06] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:28:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:06] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-18 00:28:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:28:06] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-18 00:28:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:28:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 11 ms returned sat
[2022-05-18 00:28:07] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-18 00:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:28:07] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2022-05-18 00:28:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2022-05-18 00:28:07] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 1 ms to minimize.
[2022-05-18 00:28:07] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:28:08] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:28:08] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:28:08] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:28:08] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:28:09] [INFO ] Deduced a trap composed of 163 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:28:09] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:28:09] [INFO ] Deduced a trap composed of 171 places in 248 ms of which 1 ms to minimize.
[2022-05-18 00:28:09] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:28:10] [INFO ] Deduced a trap composed of 160 places in 231 ms of which 1 ms to minimize.
[2022-05-18 00:28:10] [INFO ] Deduced a trap composed of 154 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:28:10] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:28:10] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:28:11] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2022-05-18 00:28:11] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 0 ms to minimize.
[2022-05-18 00:28:11] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2022-05-18 00:28:11] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 1 ms to minimize.
[2022-05-18 00:28:12] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:28:12] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2022-05-18 00:28:12] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:28:13] [INFO ] Deduced a trap composed of 161 places in 207 ms of which 1 ms to minimize.
[2022-05-18 00:28:13] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 1 ms to minimize.
[2022-05-18 00:28:13] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:28:13] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:28:14] [INFO ] Deduced a trap composed of 166 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:28:14] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:28:14] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 1 ms to minimize.
[2022-05-18 00:28:15] [INFO ] Deduced a trap composed of 162 places in 232 ms of which 1 ms to minimize.
[2022-05-18 00:28:15] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 0 ms to minimize.
[2022-05-18 00:28:15] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:28:15] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:28:16] [INFO ] Deduced a trap composed of 174 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:28:16] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 11 ms to minimize.
[2022-05-18 00:28:16] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:28:16] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:28:17] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:28:19] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:28:20] [INFO ] Deduced a trap composed of 160 places in 240 ms of which 1 ms to minimize.
[2022-05-18 00:28:21] [INFO ] Deduced a trap composed of 166 places in 215 ms of which 1 ms to minimize.
[2022-05-18 00:28:22] [INFO ] Deduced a trap composed of 166 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:28:22] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:28:23] [INFO ] Deduced a trap composed of 170 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:28:24] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2022-05-18 00:28:24] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:28:25] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:28:27] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:28:27] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:28:27] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:28:28] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:28:28] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:28:28] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:28:28] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:28:29] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:28:29] [INFO ] Deduced a trap composed of 158 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:28:29] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:28:30] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:28:30] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 11 ms to minimize.
[2022-05-18 00:28:30] [INFO ] Deduced a trap composed of 156 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:28:30] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 1 ms to minimize.
[2022-05-18 00:28:31] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:28:31] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:28:31] [INFO ] Deduced a trap composed of 160 places in 223 ms of which 1 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 154 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:28:32] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:28:33] [INFO ] Deduced a trap composed of 164 places in 199 ms of which 1 ms to minimize.
[2022-05-18 00:28:33] [INFO ] Deduced a trap composed of 164 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:28:33] [INFO ] Deduced a trap composed of 162 places in 217 ms of which 0 ms to minimize.
[2022-05-18 00:28:34] [INFO ] Deduced a trap composed of 154 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:28:34] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2022-05-18 00:28:35] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 1 ms to minimize.
[2022-05-18 00:28:35] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:28:35] [INFO ] Deduced a trap composed of 162 places in 189 ms of which 1 ms to minimize.
[2022-05-18 00:28:35] [INFO ] Deduced a trap composed of 160 places in 217 ms of which 0 ms to minimize.
[2022-05-18 00:28:36] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:28:36] [INFO ] Deduced a trap composed of 166 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:28:36] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:28:36] [INFO ] Deduced a trap composed of 164 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:28:37] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:28:37] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:28:37] [INFO ] Deduced a trap composed of 164 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:28:38] [INFO ] Deduced a trap composed of 166 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:28:38] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:28:38] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:28:39] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:28:39] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-18 00:28:41] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:28:41] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:28:41] [INFO ] Deduced a trap composed of 161 places in 222 ms of which 0 ms to minimize.
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 169 places in 222 ms of which 1 ms to minimize.
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 159 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:28:42] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 1 ms to minimize.
[2022-05-18 00:28:43] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:28:43] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:28:44] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:28:44] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:28:45] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:28:45] [INFO ] Deduced a trap composed of 168 places in 217 ms of which 0 ms to minimize.
[2022-05-18 00:28:46] [INFO ] Deduced a trap composed of 160 places in 197 ms of which 0 ms to minimize.
[2022-05-18 00:28:46] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:28:49] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 1 ms to minimize.
[2022-05-18 00:28:50] [INFO ] Deduced a trap composed of 162 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:28:50] [INFO ] Deduced a trap composed of 166 places in 207 ms of which 1 ms to minimize.
[2022-05-18 00:28:50] [INFO ] Deduced a trap composed of 166 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:28:51] [INFO ] Deduced a trap composed of 160 places in 220 ms of which 1 ms to minimize.
[2022-05-18 00:28:51] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:28:51] [INFO ] Deduced a trap composed of 156 places in 218 ms of which 1 ms to minimize.
[2022-05-18 00:28:51] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 2 ms to minimize.
[2022-05-18 00:28:52] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 1 ms to minimize.
[2022-05-18 00:28:52] [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: Stream close... while checking expression at index 0
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 22 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
[2022-05-18 00:28:52] [INFO ] Flatten gal took : 65 ms
[2022-05-18 00:28:52] [INFO ] Flatten gal took : 63 ms
[2022-05-18 00:28:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7515361954755147710.gal : 12 ms
[2022-05-18 00:28:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13284364284120394319.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/ReachabilityCardinality7515361954755147710.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13284364284120394319.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/ReachabilityCardinality7515361954755147710.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13284364284120394319.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13284364284120394319.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
Detected timeout of ITS tools.
[2022-05-18 00:29:07] [INFO ] Flatten gal took : 110 ms
[2022-05-18 00:29:07] [INFO ] Applying decomposition
[2022-05-18 00:29:07] [INFO ] Flatten gal took : 61 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/graph14628628034989248753.txt, -o, /tmp/graph14628628034989248753.bin, -w, /tmp/graph14628628034989248753.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/graph14628628034989248753.bin, -l, -1, -v, -w, /tmp/graph14628628034989248753.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:29:07] [INFO ] Decomposing Gal with order
[2022-05-18 00:29:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:29:08] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-18 00:29:08] [INFO ] Flatten gal took : 149 ms
[2022-05-18 00:29:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 269 labels/synchronizations in 52 ms.
[2022-05-18 00:29:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5865498942728751338.gal : 10 ms
[2022-05-18 00:29:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1036241926716527824.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/ReachabilityCardinality5865498942728751338.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1036241926716527824.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/ReachabilityCardinality5865498942728751338.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1036241926716527824.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1036241926716527824.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10131569083133238595
[2022-05-18 00:29:23] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10131569083133238595
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/ltsmin10131569083133238595]
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/ltsmin10131569083133238595] 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/ltsmin10131569083133238595] 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 1000000 steps, including 72678 resets, run finished after 9019 ms. (steps per millisecond=110 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9639 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5859066 steps, run timeout after 30001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 5859066 steps, saw 1016394 distinct states, run finished after 30011 ms. (steps per millisecond=195 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-05-18 00:30:04] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:30:04] [INFO ] Computed 62 place invariants in 17 ms
[2022-05-18 00:30:05] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2022-05-18 00:30:05] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:30:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:05] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2022-05-18 00:30:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:30:05] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-18 00:30:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:30:05] [INFO ] [Nat]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-18 00:30:05] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-18 00:30:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:05] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-05-18 00:30:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 72 ms returned sat
[2022-05-18 00:30:05] [INFO ] Deduced a trap composed of 166 places in 219 ms of which 1 ms to minimize.
[2022-05-18 00:30:06] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2022-05-18 00:30:06] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:30:06] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:30:06] [INFO ] Deduced a trap composed of 160 places in 230 ms of which 1 ms to minimize.
[2022-05-18 00:30:07] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:30:07] [INFO ] Deduced a trap composed of 163 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:30:07] [INFO ] Deduced a trap composed of 161 places in 217 ms of which 1 ms to minimize.
[2022-05-18 00:30:08] [INFO ] Deduced a trap composed of 171 places in 218 ms of which 1 ms to minimize.
[2022-05-18 00:30:08] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:30:08] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:30:08] [INFO ] Deduced a trap composed of 154 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:30:09] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:30:09] [INFO ] Deduced a trap composed of 162 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:30:09] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:30:09] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:30:10] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2022-05-18 00:30:10] [INFO ] Deduced a trap composed of 166 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:30:10] [INFO ] Deduced a trap composed of 160 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:30:10] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:30:11] [INFO ] Deduced a trap composed of 166 places in 229 ms of which 1 ms to minimize.
[2022-05-18 00:30:11] [INFO ] Deduced a trap composed of 161 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:11] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 1 ms to minimize.
[2022-05-18 00:30:11] [INFO ] Deduced a trap composed of 168 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:12] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 1 ms to minimize.
[2022-05-18 00:30:12] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 1 ms to minimize.
[2022-05-18 00:30:12] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:13] [INFO ] Deduced a trap composed of 152 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:30:13] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:13] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:30:14] [INFO ] Deduced a trap composed of 160 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:30:14] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:30:14] [INFO ] Deduced a trap composed of 174 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:30:14] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:15] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:30:15] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:30:15] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2022-05-18 00:30:17] [INFO ] Deduced a trap composed of 169 places in 201 ms of which 1 ms to minimize.
[2022-05-18 00:30:19] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:30:19] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:20] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:30:21] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2022-05-18 00:30:21] [INFO ] Deduced a trap composed of 170 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:30:22] [INFO ] Deduced a trap composed of 162 places in 226 ms of which 1 ms to minimize.
[2022-05-18 00:30:22] [INFO ] Deduced a trap composed of 156 places in 198 ms of which 0 ms to minimize.
[2022-05-18 00:30:23] [INFO ] Deduced a trap composed of 168 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:30:25] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 1 ms to minimize.
[2022-05-18 00:30:25] [INFO ] Deduced a trap composed of 162 places in 213 ms of which 0 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Deduced a trap composed of 164 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2022-05-18 00:30:26] [INFO ] Deduced a trap composed of 166 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:30:27] [INFO ] Deduced a trap composed of 166 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:27] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:30:27] [INFO ] Deduced a trap composed of 158 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:30:27] [INFO ] Deduced a trap composed of 160 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:30:28] [INFO ] Deduced a trap composed of 158 places in 222 ms of which 1 ms to minimize.
[2022-05-18 00:30:28] [INFO ] Deduced a trap composed of 160 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:30:28] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2022-05-18 00:30:29] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:30:29] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:30:29] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:29] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 0 ms to minimize.
[2022-05-18 00:30:30] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:30:30] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:30:30] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:30:30] [INFO ] Deduced a trap composed of 166 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:30:31] [INFO ] Deduced a trap composed of 164 places in 185 ms of which 1 ms to minimize.
[2022-05-18 00:30:31] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:30:31] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 1 ms to minimize.
[2022-05-18 00:30:32] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 1 ms to minimize.
[2022-05-18 00:30:32] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:30:33] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:30:33] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:30:33] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 1 ms to minimize.
[2022-05-18 00:30:33] [INFO ] Deduced a trap composed of 160 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:30:34] [INFO ] Deduced a trap composed of 165 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:30:34] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:30:34] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:30:34] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:30:35] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:30:35] [INFO ] Deduced a trap composed of 160 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:30:35] [INFO ] Deduced a trap composed of 164 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:30:35] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:30:36] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2022-05-18 00:30:36] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2022-05-18 00:30:36] [INFO ] Deduced a trap composed of 158 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:30:37] [INFO ] Deduced a trap composed of 160 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:30:39] [INFO ] Deduced a trap composed of 162 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:30:39] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:30:39] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:30:39] [INFO ] Deduced a trap composed of 169 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:30:40] [INFO ] Deduced a trap composed of 171 places in 190 ms of which 0 ms to minimize.
[2022-05-18 00:30:40] [INFO ] Deduced a trap composed of 159 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:40] [INFO ] Deduced a trap composed of 165 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:41] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 0 ms to minimize.
[2022-05-18 00:30:41] [INFO ] Deduced a trap composed of 165 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:42] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2022-05-18 00:30:42] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2022-05-18 00:30:43] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:30:43] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2022-05-18 00:30:44] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:30:44] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:30:47] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:30:47] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 0 ms to minimize.
[2022-05-18 00:30:48] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 1 ms to minimize.
[2022-05-18 00:30:48] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:30:48] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:30:48] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 1 ms to minimize.
[2022-05-18 00:30:49] [INFO ] Deduced a trap composed of 156 places in 215 ms of which 0 ms to minimize.
[2022-05-18 00:30:49] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:49] [INFO ] Deduced a trap composed of 160 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:30:50] [INFO ] Deduced a trap composed of 172 places in 219 ms of which 1 ms to minimize.
[2022-05-18 00:30:50] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2022-05-18 00:30:50] [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: Stream close... while checking expression at index 0
Support contains 1 out of 410 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Starting structural reductions, iteration 0 : 410/410 places, 981/981 transitions.
Applied a total of 0 rules in 26 ms. Remains 410 /410 variables (removed 0) and now considering 981/981 (removed 0) transitions.
[2022-05-18 00:30:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:30:50] [INFO ] Computed 62 place invariants in 21 ms
[2022-05-18 00:30:50] [INFO ] Implicit Places using invariants in 340 ms returned []
[2022-05-18 00:30:50] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:30:50] [INFO ] Computed 62 place invariants in 13 ms
[2022-05-18 00:30:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:30:52] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
[2022-05-18 00:30:52] [INFO ] Redundant transitions in 57 ms returned []
[2022-05-18 00:30:52] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:30:52] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-18 00:30:52] [INFO ] Dead Transitions using invariants and state equation in 400 ms returned []
Finished structural reductions, in 1 iterations. Remains : 410/410 places, 981/981 transitions.
Incomplete random walk after 100000 steps, including 7326 resets, run finished after 1041 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 00:30:53] [INFO ] Flow matrix only has 972 transitions (discarded 9 similar events)
// Phase 1: matrix 972 rows 410 cols
[2022-05-18 00:30:53] [INFO ] Computed 62 place invariants in 19 ms
[2022-05-18 00:30:53] [INFO ] [Real]Absence check using 55 positive place invariants in 12 ms returned sat
[2022-05-18 00:30:53] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:53] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2022-05-18 00:30:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-18 00:30:53] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-18 00:30:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:30:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 15 ms returned sat
[2022-05-18 00:30:54] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:30:54] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-05-18 00:30:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 71 ms returned sat
[2022-05-18 00:30:54] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2022-05-18 00:30:54] [INFO ] Deduced a trap composed of 164 places in 251 ms of which 0 ms to minimize.
[2022-05-18 00:30:55] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2022-05-18 00:30:55] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:30:55] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:30:55] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:30:56] [INFO ] Deduced a trap composed of 163 places in 225 ms of which 0 ms to minimize.
[2022-05-18 00:30:56] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 1 ms to minimize.
[2022-05-18 00:30:56] [INFO ] Deduced a trap composed of 171 places in 212 ms of which 1 ms to minimize.
[2022-05-18 00:30:56] [INFO ] Deduced a trap composed of 162 places in 201 ms of which 0 ms to minimize.
[2022-05-18 00:30:57] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 2 ms to minimize.
[2022-05-18 00:30:57] [INFO ] Deduced a trap composed of 154 places in 215 ms of which 1 ms to minimize.
[2022-05-18 00:30:57] [INFO ] Deduced a trap composed of 162 places in 214 ms of which 2 ms to minimize.
[2022-05-18 00:30:58] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2022-05-18 00:30:58] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 0 ms to minimize.
[2022-05-18 00:30:58] [INFO ] Deduced a trap composed of 164 places in 218 ms of which 1 ms to minimize.
[2022-05-18 00:30:58] [INFO ] Deduced a trap composed of 168 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:30:59] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:30:59] [INFO ] Deduced a trap composed of 160 places in 210 ms of which 0 ms to minimize.
[2022-05-18 00:30:59] [INFO ] Deduced a trap composed of 168 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:30:59] [INFO ] Deduced a trap composed of 166 places in 221 ms of which 1 ms to minimize.
[2022-05-18 00:31:00] [INFO ] Deduced a trap composed of 161 places in 205 ms of which 0 ms to minimize.
[2022-05-18 00:31:00] [INFO ] Deduced a trap composed of 162 places in 208 ms of which 1 ms to minimize.
[2022-05-18 00:31:00] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:31:00] [INFO ] Deduced a trap composed of 162 places in 210 ms of which 1 ms to minimize.
[2022-05-18 00:31:01] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 0 ms to minimize.
[2022-05-18 00:31:01] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 1 ms to minimize.
[2022-05-18 00:31:01] [INFO ] Deduced a trap composed of 152 places in 209 ms of which 0 ms to minimize.
[2022-05-18 00:31:02] [INFO ] Deduced a trap composed of 162 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:31:02] [INFO ] Deduced a trap composed of 160 places in 212 ms of which 0 ms to minimize.
[2022-05-18 00:31:02] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:31:02] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:31:03] [INFO ] Deduced a trap composed of 174 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:31:03] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:31:03] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:31:03] [INFO ] Deduced a trap composed of 166 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:31:04] [INFO ] Deduced a trap composed of 160 places in 190 ms of which 1 ms to minimize.
[2022-05-18 00:31:06] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:31:07] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 1 ms to minimize.
[2022-05-18 00:31:08] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:31:09] [INFO ] Deduced a trap composed of 166 places in 196 ms of which 0 ms to minimize.
[2022-05-18 00:31:09] [INFO ] Deduced a trap composed of 168 places in 189 ms of which 0 ms to minimize.
[2022-05-18 00:31:09] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:31:11] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2022-05-18 00:31:11] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:31:11] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:31:13] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2022-05-18 00:31:14] [INFO ] Deduced a trap composed of 11 places in 255 ms of which 0 ms to minimize.
[2022-05-18 00:31:14] [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: Stream close... while checking expression at index 0
[2022-05-18 00:31:14] [INFO ] Flatten gal took : 55 ms
[2022-05-18 00:31:14] [INFO ] Flatten gal took : 53 ms
[2022-05-18 00:31:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5101815911924821165.gal : 6 ms
[2022-05-18 00:31:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14497966823599246960.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/ReachabilityCardinality5101815911924821165.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14497966823599246960.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/ReachabilityCardinality5101815911924821165.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14497966823599246960.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14497966823599246960.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
Detected timeout of ITS tools.
[2022-05-18 00:31:29] [INFO ] Flatten gal took : 54 ms
[2022-05-18 00:31:29] [INFO ] Applying decomposition
[2022-05-18 00:31:29] [INFO ] Flatten gal took : 50 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/graph670329204448019795.txt, -o, /tmp/graph670329204448019795.bin, -w, /tmp/graph670329204448019795.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/graph670329204448019795.bin, -l, -1, -v, -w, /tmp/graph670329204448019795.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:31:29] [INFO ] Decomposing Gal with order
[2022-05-18 00:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:31:29] [INFO ] Removed a total of 2740 redundant transitions.
[2022-05-18 00:31:29] [INFO ] Flatten gal took : 101 ms
[2022-05-18 00:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 27 ms.
[2022-05-18 00:31:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14358902535917885831.gal : 9 ms
[2022-05-18 00:31:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15286216609980052870.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/ReachabilityCardinality14358902535917885831.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15286216609980052870.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/ReachabilityCardinality14358902535917885831.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15286216609980052870.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15286216609980052870.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17689886908506791510
[2022-05-18 00:31:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17689886908506791510
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/ltsmin17689886908506791510]
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/ltsmin17689886908506791510] 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/ltsmin17689886908506791510] 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)
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 410 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 410 transition count 971
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 409 transition count 971
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 409 transition count 970
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 408 transition count 970
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 408 transition count 960
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 398 transition count 960
Applied a total of 33 rules in 143 ms. Remains 398 /410 variables (removed 12) and now considering 960/981 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 960 rows 398 cols
[2022-05-18 00:31:46] [INFO ] Computed 62 place invariants in 11 ms
[2022-05-18 00:31:46] [INFO ] [Real]Absence check using 55 positive place invariants in 15 ms returned sat
[2022-05-18 00:31:46] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 00:31:46] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-18 00:31:46] [INFO ] Deduced a trap composed of 160 places in 253 ms of which 0 ms to minimize.
[2022-05-18 00:31:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 297 ms
[2022-05-18 00:31:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 00:31:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 10 ms returned sat
[2022-05-18 00:31:46] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-18 00:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 00:31:47] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2022-05-18 00:31:47] [INFO ] Deduced a trap composed of 160 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:31:47] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2022-05-18 00:31:47] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 0 ms to minimize.
[2022-05-18 00:31:47] [INFO ] Deduced a trap composed of 160 places in 171 ms of which 1 ms to minimize.
[2022-05-18 00:31:48] [INFO ] Deduced a trap composed of 160 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:31:48] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:31:48] [INFO ] Deduced a trap composed of 160 places in 167 ms of which 1 ms to minimize.
[2022-05-18 00:31:48] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:31:48] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 0 ms to minimize.
[2022-05-18 00:31:49] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:31:49] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 11 ms to minimize.
[2022-05-18 00:31:49] [INFO ] Deduced a trap composed of 154 places in 165 ms of which 1 ms to minimize.
[2022-05-18 00:31:49] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2022-05-18 00:31:49] [INFO ] Deduced a trap composed of 166 places in 203 ms of which 0 ms to minimize.
[2022-05-18 00:31:50] [INFO ] Deduced a trap composed of 166 places in 161 ms of which 0 ms to minimize.
[2022-05-18 00:31:50] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 1 ms to minimize.
[2022-05-18 00:31:50] [INFO ] Deduced a trap composed of 166 places in 165 ms of which 0 ms to minimize.
[2022-05-18 00:31:50] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:31:50] [INFO ] Deduced a trap composed of 168 places in 164 ms of which 0 ms to minimize.
[2022-05-18 00:31:51] [INFO ] Deduced a trap composed of 158 places in 166 ms of which 0 ms to minimize.
[2022-05-18 00:31:51] [INFO ] Deduced a trap composed of 168 places in 173 ms of which 1 ms to minimize.
[2022-05-18 00:31:51] [INFO ] Deduced a trap composed of 160 places in 157 ms of which 0 ms to minimize.
[2022-05-18 00:31:51] [INFO ] Deduced a trap composed of 164 places in 159 ms of which 0 ms to minimize.
[2022-05-18 00:31:51] [INFO ] Deduced a trap composed of 162 places in 159 ms of which 0 ms to minimize.
[2022-05-18 00:31:52] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 1 ms to minimize.
[2022-05-18 00:31:52] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 0 ms to minimize.
[2022-05-18 00:31:52] [INFO ] Deduced a trap composed of 152 places in 167 ms of which 0 ms to minimize.
[2022-05-18 00:31:52] [INFO ] Deduced a trap composed of 156 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:31:52] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:31:53] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 0 ms to minimize.
[2022-05-18 00:31:53] [INFO ] Deduced a trap composed of 152 places in 164 ms of which 1 ms to minimize.
[2022-05-18 00:31:53] [INFO ] Deduced a trap composed of 152 places in 163 ms of which 1 ms to minimize.
[2022-05-18 00:31:53] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2022-05-18 00:31:53] [INFO ] Deduced a trap composed of 150 places in 167 ms of which 1 ms to minimize.
[2022-05-18 00:31:54] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:31:54] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 1 ms to minimize.
[2022-05-18 00:31:54] [INFO ] Deduced a trap composed of 162 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:31:54] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2022-05-18 00:31:54] [INFO ] Deduced a trap composed of 156 places in 173 ms of which 1 ms to minimize.
[2022-05-18 00:31:55] [INFO ] Deduced a trap composed of 162 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:31:55] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 0 ms to minimize.
[2022-05-18 00:31:55] [INFO ] Deduced a trap composed of 162 places in 158 ms of which 0 ms to minimize.
[2022-05-18 00:31:55] [INFO ] Deduced a trap composed of 156 places in 160 ms of which 0 ms to minimize.
[2022-05-18 00:31:56] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2022-05-18 00:31:56] [INFO ] Deduced a trap composed of 156 places in 159 ms of which 0 ms to minimize.
[2022-05-18 00:31:56] [INFO ] Deduced a trap composed of 156 places in 161 ms of which 0 ms to minimize.
[2022-05-18 00:31:56] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:31:56] [INFO ] Deduced a trap composed of 166 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:31:57] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 1 ms to minimize.
[2022-05-18 00:31:57] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:31:57] [INFO ] Deduced a trap composed of 154 places in 177 ms of which 1 ms to minimize.
[2022-05-18 00:31:57] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2022-05-18 00:31:57] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:31:58] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:31:58] [INFO ] Deduced a trap composed of 158 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:31:58] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 1 ms to minimize.
[2022-05-18 00:31:58] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:31:59] [INFO ] Deduced a trap composed of 158 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:31:59] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:31:59] [INFO ] Deduced a trap composed of 158 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:31:59] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:31:59] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 1 ms to minimize.
[2022-05-18 00:32:00] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:32:00] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 1 ms to minimize.
[2022-05-18 00:32:00] [INFO ] Deduced a trap composed of 158 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:32:00] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:32:01] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:32:01] [INFO ] Deduced a trap composed of 160 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:32:01] [INFO ] Deduced a trap composed of 160 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:32:01] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:32:01] [INFO ] Deduced a trap composed of 160 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:32:02] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 1 ms to minimize.
[2022-05-18 00:32:02] [INFO ] Deduced a trap composed of 154 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:32:02] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 1 ms to minimize.
[2022-05-18 00:32:02] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:32:03] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:32:03] [INFO ] Deduced a trap composed of 154 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:32:03] [INFO ] Deduced a trap composed of 156 places in 195 ms of which 0 ms to minimize.
[2022-05-18 00:32:03] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 1 ms to minimize.
[2022-05-18 00:32:03] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 1 ms to minimize.
[2022-05-18 00:32:04] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 1 ms to minimize.
[2022-05-18 00:32:04] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 1 ms to minimize.
[2022-05-18 00:32:04] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 1 ms to minimize.
[2022-05-18 00:32:05] [INFO ] Deduced a trap composed of 166 places in 173 ms of which 0 ms to minimize.
[2022-05-18 00:32:05] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 1 ms to minimize.
[2022-05-18 00:32:05] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:32:05] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 0 ms to minimize.
[2022-05-18 00:32:06] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 1 ms to minimize.
[2022-05-18 00:32:06] [INFO ] Deduced a trap composed of 168 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:32:07] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:32:07] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 1 ms to minimize.
[2022-05-18 00:32:07] [INFO ] Deduced a trap composed of 156 places in 174 ms of which 1 ms to minimize.
[2022-05-18 00:32:07] [INFO ] Deduced a trap composed of 164 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:32:07] [INFO ] Deduced a trap composed of 156 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:32:08] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 1 ms to minimize.
[2022-05-18 00:32:08] [INFO ] Deduced a trap composed of 162 places in 160 ms of which 1 ms to minimize.
[2022-05-18 00:32:08] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 0 ms to minimize.
[2022-05-18 00:32:08] [INFO ] Deduced a trap composed of 162 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:32:08] [INFO ] Deduced a trap composed of 156 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:32:09] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:32:09] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:32:09] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:32:09] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:32:09] [INFO ] Deduced a trap composed of 160 places in 180 ms of which 1 ms to minimize.
[2022-05-18 00:32:10] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2022-05-18 00:32:10] [INFO ] Deduced a trap composed of 158 places in 176 ms of which 1 ms to minimize.
[2022-05-18 00:32:10] [INFO ] Deduced a trap composed of 162 places in 185 ms of which 1 ms to minimize.
[2022-05-18 00:32:10] [INFO ] Deduced a trap composed of 158 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:32:11] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:32:11] [INFO ] Deduced a trap composed of 165 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:32:11] [INFO ] Deduced a trap composed of 160 places in 178 ms of which 0 ms to minimize.
[2022-05-18 00:32:11] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 1 ms to minimize.
[2022-05-18 00:32:12] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2022-05-18 00:32:12] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:32:12] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:32:12] [INFO ] Deduced a trap composed of 154 places in 179 ms of which 1 ms to minimize.
[2022-05-18 00:32:13] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 0 ms to minimize.
[2022-05-18 00:32:13] [INFO ] Deduced a trap composed of 162 places in 165 ms of which 0 ms to minimize.
[2022-05-18 00:32:13] [INFO ] Deduced a trap composed of 160 places in 193 ms of which 0 ms to minimize.
[2022-05-18 00:32:13] [INFO ] Deduced a trap composed of 156 places in 166 ms of which 0 ms to minimize.
[2022-05-18 00:32:14] [INFO ] Deduced a trap composed of 170 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:32:14] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 1 ms to minimize.
[2022-05-18 00:32:15] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 1 ms to minimize.
[2022-05-18 00:32:15] [INFO ] Deduced a trap composed of 167 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:32:15] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 1 ms to minimize.
[2022-05-18 00:32:16] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 1 ms to minimize.
[2022-05-18 00:32:18] [INFO ] Deduced a trap composed of 153 places in 180 ms of which 1 ms to minimize.
[2022-05-18 00:32:18] [INFO ] Deduced a trap composed of 159 places in 180 ms of which 1 ms to minimize.
[2022-05-18 00:32:19] [INFO ] Deduced a trap composed of 165 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:32:19] [INFO ] Deduced a trap composed of 153 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:32:19] [INFO ] Deduced a trap composed of 151 places in 181 ms of which 1 ms to minimize.
[2022-05-18 00:32:19] [INFO ] Deduced a trap composed of 155 places in 183 ms of which 0 ms to minimize.
[2022-05-18 00:32:20] [INFO ] Deduced a trap composed of 163 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:32:20] [INFO ] Deduced a trap composed of 164 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:32:20] [INFO ] Deduced a trap composed of 156 places in 182 ms of which 0 ms to minimize.
[2022-05-18 00:32:22] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 1 ms to minimize.
[2022-05-18 00:32:22] [INFO ] Deduced a trap composed of 165 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:32:23] [INFO ] Deduced a trap composed of 167 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:32:23] [INFO ] Deduced a trap composed of 161 places in 188 ms of which 0 ms to minimize.
[2022-05-18 00:32:23] [INFO ] Deduced a trap composed of 163 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:32:23] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 1 ms to minimize.
[2022-05-18 00:32:24] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 0 ms to minimize.
[2022-05-18 00:32:24] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 0 ms to minimize.
[2022-05-18 00:32:24] [INFO ] Deduced a trap composed of 164 places in 184 ms of which 0 ms to minimize.
[2022-05-18 00:32:24] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 0 ms to minimize.
[2022-05-18 00:32:24] [INFO ] Deduced a trap composed of 160 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:32:25] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:32:25] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:32:25] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 1 ms to minimize.
[2022-05-18 00:32:26] [INFO ] Deduced a trap composed of 162 places in 187 ms of which 0 ms to minimize.
[2022-05-18 00:32:26] [INFO ] Deduced a trap composed of 162 places in 169 ms of which 1 ms to minimize.
[2022-05-18 00:32:26] [INFO ] Deduced a trap composed of 160 places in 168 ms of which 1 ms to minimize.
[2022-05-18 00:32:26] [INFO ] Deduced a trap composed of 162 places in 179 ms of which 0 ms to minimize.
[2022-05-18 00:32:26] [INFO ] Deduced a trap composed of 156 places in 186 ms of which 1 ms to minimize.
[2022-05-18 00:32:27] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2022-05-18 00:32:27] [INFO ] Deduced a trap composed of 156 places in 176 ms of which 0 ms to minimize.
[2022-05-18 00:32:27] [INFO ] Deduced a trap composed of 152 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:32:27] [INFO ] Deduced a trap composed of 156 places in 177 ms of which 0 ms to minimize.
[2022-05-18 00:32:27] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 1 ms to minimize.
[2022-05-18 00:32:28] [INFO ] Deduced a trap composed of 156 places in 181 ms of which 0 ms to minimize.
[2022-05-18 00:32:28] [INFO ] Deduced a trap composed of 158 places in 174 ms of which 0 ms to minimize.
[2022-05-18 00:32:28] [INFO ] Deduced a trap composed of 152 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:32:28] [INFO ] Deduced a trap composed of 160 places in 176 ms of which 1 ms to minimize.
[2022-05-18 00:32:29] [INFO ] Deduced a trap composed of 162 places in 163 ms of which 0 ms to minimize.
[2022-05-18 00:32:29] [INFO ] Deduced a trap composed of 156 places in 170 ms of which 1 ms to minimize.
[2022-05-18 00:32:29] [INFO ] Deduced a trap composed of 160 places in 183 ms of which 1 ms to minimize.
[2022-05-18 00:32:29] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 0 ms to minimize.
[2022-05-18 00:32:29] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 1 ms to minimize.
[2022-05-18 00:32:30] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2022-05-18 00:32:30] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2022-05-18 00:32:30] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 0 ms to minimize.
[2022-05-18 00:32:30] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 1 ms to minimize.
[2022-05-18 00:32:30] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2022-05-18 00:32:31] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 1 ms to minimize.
[2022-05-18 00:32:31] [INFO ] Deduced a trap composed of 157 places in 180 ms of which 0 ms to minimize.
[2022-05-18 00:32:31] [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: Stream close... while checking expression at index 0
[2022-05-18 00:32:31] [INFO ] Flatten gal took : 53 ms
[2022-05-18 00:32:32] [INFO ] Flatten gal took : 60 ms
[2022-05-18 00:32:32] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10077331714584458603.gal : 6 ms
[2022-05-18 00:32:32] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8400371543790316981.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/ReachabilityFireability10077331714584458603.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability8400371543790316981.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/ReachabilityFireability10077331714584458603.gal -t CGAL -reachable-file /tmp/ReachabilityFireability8400371543790316981.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability8400371543790316981.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
Detected timeout of ITS tools.
[2022-05-18 00:32:35] [INFO ] Flatten gal took : 52 ms
[2022-05-18 00:32:35] [INFO ] Applying decomposition
[2022-05-18 00:32:35] [INFO ] Flatten gal took : 51 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/graph2117993191028333771.txt, -o, /tmp/graph2117993191028333771.bin, -w, /tmp/graph2117993191028333771.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/graph2117993191028333771.bin, -l, -1, -v, -w, /tmp/graph2117993191028333771.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:32:35] [INFO ] Decomposing Gal with order
[2022-05-18 00:32:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:32:35] [INFO ] Removed a total of 2742 redundant transitions.
[2022-05-18 00:32:35] [INFO ] Flatten gal took : 110 ms
[2022-05-18 00:32:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 23 ms.
[2022-05-18 00:32:35] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11706499967368195019.gal : 12 ms
[2022-05-18 00:32:35] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability13635276579015914553.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/ReachabilityFireability11706499967368195019.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability13635276579015914553.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/ReachabilityFireability11706499967368195019.gal -t CGAL -reachable-file /tmp/ReachabilityFireability13635276579015914553.prop --nowitness
Loading property file /tmp/ReachabilityFireability13635276579015914553.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9434321893119663945
[2022-05-18 00:32:38] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9434321893119663945
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/ltsmin9434321893119663945]
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/ltsmin9434321893119663945] 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/ltsmin9434321893119663945] 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)
[2022-05-18 00:32:39] [INFO ] Flatten gal took : 50 ms
[2022-05-18 00:32:39] [INFO ] Flatten gal took : 50 ms
[2022-05-18 00:32:39] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability2973129558048168708.gal : 5 ms
[2022-05-18 00:32:39] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2428695430612643236.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/ReachabilityFireability2973129558048168708.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2428695430612643236.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/ReachabilityFireability2973129558048168708.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2428695430612643236.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability2428695430612643236.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
Detected timeout of ITS tools.
[2022-05-18 00:33:09] [INFO ] Flatten gal took : 62 ms
[2022-05-18 00:33:09] [INFO ] Applying decomposition
[2022-05-18 00:33:09] [INFO ] Flatten gal took : 68 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/graph18346535645554065337.txt, -o, /tmp/graph18346535645554065337.bin, -w, /tmp/graph18346535645554065337.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/graph18346535645554065337.bin, -l, -1, -v, -w, /tmp/graph18346535645554065337.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:33:09] [INFO ] Decomposing Gal with order
[2022-05-18 00:33:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:33:10] [INFO ] Removed a total of 2742 redundant transitions.
[2022-05-18 00:33:10] [INFO ] Flatten gal took : 96 ms
[2022-05-18 00:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 284 labels/synchronizations in 19 ms.
[2022-05-18 00:33:10] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6201674753871226251.gal : 7 ms
[2022-05-18 00:33:10] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3133860667684390094.prop : 61 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/ReachabilityFireability6201674753871226251.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability3133860667684390094.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/ReachabilityFireability6201674753871226251.gal -t CGAL -reachable-file /tmp/ReachabilityFireability3133860667684390094.prop --nowitness
Loading property file /tmp/ReachabilityFireability3133860667684390094.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5964388858103041511
[2022-05-18 00:33:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5964388858103041511
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/ltsmin5964388858103041511]
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/ltsmin5964388858103041511] killed by timeout after 3 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/ltsmin5964388858103041511] killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-05-18 00:33:43] [INFO ] Flatten gal took : 81 ms
[2022-05-18 00:33:43] [INFO ] Flatten gal took : 48 ms
[2022-05-18 00:33:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12118998161573676204.gal : 5 ms
[2022-05-18 00:33:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability7936100163394007460.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/ReachabilityFireability12118998161573676204.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability7936100163394007460.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/ReachabilityFireability12118998161573676204.gal -t CGAL -reachable-file /tmp/ReachabilityFireability7936100163394007460.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability7936100163394007460.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.62585e+06 after 3.99829e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.99829e+06 after 4.16985e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :4.16985e+07 after 6.63609e+07
Detected timeout of ITS tools.
[2022-05-18 00:38:43] [INFO ] Flatten gal took : 53 ms
[2022-05-18 00:38:43] [INFO ] Applying decomposition
[2022-05-18 00:38:43] [INFO ] Flatten gal took : 53 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/graph3904500416301850299.txt, -o, /tmp/graph3904500416301850299.bin, -w, /tmp/graph3904500416301850299.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/graph3904500416301850299.bin, -l, -1, -v, -w, /tmp/graph3904500416301850299.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-18 00:38:43] [INFO ] Decomposing Gal with order
[2022-05-18 00:38:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 00:38:43] [INFO ] Removed a total of 2800 redundant transitions.
[2022-05-18 00:38:43] [INFO ] Flatten gal took : 92 ms
[2022-05-18 00:38:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 149 labels/synchronizations in 19 ms.
[2022-05-18 00:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability8758829815035404965.gal : 6 ms
[2022-05-18 00:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2579525922644863329.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/ReachabilityFireability8758829815035404965.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2579525922644863329.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/ReachabilityFireability8758829815035404965.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2579525922644863329.prop --nowitness
Loading property file /tmp/ReachabilityFireability2579525922644863329.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 39056
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :39056 after 39056
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :39056 after 39058
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :39058 after 45742
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :45742 after 45750
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :45750 after 45769
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :45769 after 66230
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :66230 after 66754
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :66754 after 68452
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :68452 after 238680
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :238680 after 254350
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :254350 after 313426
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :313426 after 480128
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8384279314212800569
[2022-05-18 00:43:44] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8384279314212800569
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/ltsmin8384279314212800569]
Compilation finished in 7556 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8384279314212800569]
Link finished in 69 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_11==true], workingDir=/tmp/ltsmin8384279314212800569]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.078: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.082: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.085: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.105: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.106: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.105: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.103: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.106: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.103: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.104: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.106: "qltransition_11==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.108: There are 982 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.108: State length is 410, there are 981 groups
pins2lts-mc-linux64( 0/ 8), 0.108: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.108: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.108: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.108: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.270: ~5 levels ~960 states ~7672 transitions
pins2lts-mc-linux64( 3/ 8), 0.288: ~3 levels ~1920 states ~12544 transitions
pins2lts-mc-linux64( 3/ 8), 0.333: ~4 levels ~3840 states ~49608 transitions
pins2lts-mc-linux64( 0/ 8), 0.417: ~8 levels ~7680 states ~132080 transitions
pins2lts-mc-linux64( 0/ 8), 0.588: ~8 levels ~15360 states ~298640 transitions
pins2lts-mc-linux64( 0/ 8), 0.914: ~8 levels ~30720 states ~586680 transitions
pins2lts-mc-linux64( 0/ 8), 1.389: ~8 levels ~61440 states ~778872 transitions
pins2lts-mc-linux64( 0/ 8), 2.318: ~9 levels ~122880 states ~1155864 transitions
pins2lts-mc-linux64( 3/ 8), 4.659: ~6 levels ~245760 states ~2783584 transitions
pins2lts-mc-linux64( 1/ 8), 9.905: ~7 levels ~491520 states ~7506112 transitions
pins2lts-mc-linux64( 3/ 8), 18.812: ~7 levels ~983040 states ~13100472 transitions
pins2lts-mc-linux64( 3/ 8), 34.550: ~7 levels ~1966080 states ~20434520 transitions
pins2lts-mc-linux64( 0/ 8), 75.610: ~11 levels ~3932160 states ~54670208 transitions
pins2lts-mc-linux64( 7/ 8), 139.540: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 139.722:
pins2lts-mc-linux64( 0/ 8), 139.722: mean standard work distribution: 13.4% (states) 8.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 139.723:
pins2lts-mc-linux64( 0/ 8), 139.723: Explored 5622319 states 106335382 transitions, fanout: 18.913
pins2lts-mc-linux64( 0/ 8), 139.723: Total exploration time 139.610 sec (139.440 sec minimum, 139.474 sec on average)
pins2lts-mc-linux64( 0/ 8), 139.723: States per second: 40272, Transitions per second: 761660
pins2lts-mc-linux64( 0/ 8), 139.723:
pins2lts-mc-linux64( 0/ 8), 139.723: Queue width: 8B, total height: 27624442, memory: 210.76MB
pins2lts-mc-linux64( 0/ 8), 139.723: Tree memory: 509.7MB, 16.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 139.723: Tree fill ratio (roots/leafs): 24.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 139.723: Stored 989 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 139.723: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 139.723: Est. total memory use: 720.4MB (~1234.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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_11==true], workingDir=/tmp/ltsmin8384279314212800569]
255
java.lang.RuntimeException: Unexpected exception when executing 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_11==true], workingDir=/tmp/ltsmin8384279314212800569]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-05-18 00:46:11] [INFO ] Flatten gal took : 72 ms
[2022-05-18 00:46:11] [INFO ] Flatten gal took : 49 ms
[2022-05-18 00:46:11] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12428231136699011070.gal : 4 ms
[2022-05-18 00:46:11] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14618410304455445166.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/ReachabilityFireability12428231136699011070.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability14618410304455445166.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/ReachabilityFireability12428231136699011070.gal -t CGAL -reachable-file /tmp/ReachabilityFireability14618410304455445166.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityFireability14618410304455445166.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 64
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :64 after 129
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :129 after 130
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :130 after 131
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :131 after 149
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :149 after 229
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :229 after 824
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :824 after 1311
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1311 after 6148
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6148 after 29402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29402 after 96986
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :96986 after 248582
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248582 after 599618
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :599618 after 1.62585e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.62585e+06 after 3.99829e+06
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.99829e+06 after 4.16985e+07
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :4.16985e+07 after 6.63609e+07

BK_TIME_CONFINEMENT_REACHED

--------------------
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="PolyORBNT-COL-S10J20"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is PolyORBNT-COL-S10J20, 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 r180-tall-165277027900482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J20.tgz
mv PolyORBNT-COL-S10J20 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 ;