Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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 1678866377569

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S05J80
Not applying reductions.
Model is COL
QuasiLiveness COL
Running Version 202303021504
[2023-03-15 07:46:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-15 07:46:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 07:46:19] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 07:46:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 07:46:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2023-03-15 07:46:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 20 ms.
[2023-03-15 07:46:19] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 68 ms.
[2023-03-15 07:46:19] [INFO ] Unfolded 38 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 07:46:20] [INFO ] Reduced 555 identical enabling conditions.
[2023-03-15 07:46:20] [INFO ] Reduced 90 identical enabling conditions.
[2023-03-15 07:46:20] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 80 places in 13 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 697 resets, run finished after 606 ms. (steps per millisecond=16 ) properties (out of 36) seen :29
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :3
[2023-03-15 07:46:20] [INFO ] Flatten gal took : 592 ms
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2023-03-15 07:46:20] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-15 07:46:21] [INFO ] Flatten gal took : 121 ms
[2023-03-15 07:46:21] [INFO ] Computed 182 place invariants in 155 ms
[2023-03-15 07:46:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14498207538777794923.gal : 57 ms
[2023-03-15 07:46:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6951562716632818429.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14498207538777794923.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6951562716632818429.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6951562716632818429.prop.
[2023-03-15 07:46:21] [INFO ] [Real]Absence check using 175 positive place invariants in 60 ms returned sat
[2023-03-15 07:46:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 07:46:22] [INFO ] After 1082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:46:22] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-15 07:46:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 3
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :3 after 6
Reachability property qltransition_20 is true.
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :6 after 14
Reachability property qltransition_25 is true.
Reachability property qltransition_14 is true.
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 41
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41 after 42
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 60
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :60 after 78
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :78 after 125
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :125 after 141
[2023-03-15 07:46:26] [INFO ] After 3812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:46:26] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :141 after 236
[2023-03-15 07:46:27] [INFO ] After 797ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:46:27] [INFO ] After 948ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-15 07:46:27] [INFO ] After 5087ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 177 place count 1098 transition count 1524
Deduced a syphon composed of 85 places in 2 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 347 place count 1013 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 348 place count 1012 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 353 place count 1010 transition count 1521
Applied a total of 353 rules in 428 ms. Remains 1010 /1189 variables (removed 179) and now considering 1521/1695 (removed 174) transitions.
[2023-03-15 07:46:27] [INFO ] Flow matrix only has 1517 transitions (discarded 4 similar events)
// Phase 1: matrix 1517 rows 1010 cols
[2023-03-15 07:46:27] [INFO ] Computed 177 place invariants in 101 ms
[2023-03-15 07:46:28] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1010/1189 places, 1426/1695 transitions.
Applied a total of 0 rules in 95 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1677 ms. Remains : 1010/1189 places, 1426/1695 transitions.
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :236 after 386
Incomplete random walk after 1000000 steps, including 52326 resets, run finished after 6639 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2702 resets, run finished after 1534 ms. (steps per millisecond=651 ) properties (out of 1) seen :0
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :386 after 1632
Interrupted probabilistic random walk after 2359545 steps, run timeout after 24001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 2359545 steps, saw 737188 distinct states, run finished after 24005 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:47:01] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-15 07:47:01] [INFO ] Computed 177 place invariants in 40 ms
[2023-03-15 07:47:01] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 07:47:01] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 07:47:01] [INFO ] After 746ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:02] [INFO ] [Nat]Absence check using 170 positive place invariants in 50 ms returned sat
[2023-03-15 07:47:02] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 07:47:02] [INFO ] After 518ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:02] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1632 after 5499
[2023-03-15 07:47:03] [INFO ] After 408ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:03] [INFO ] Deduced a trap composed of 320 places in 380 ms of which 1 ms to minimize.
[2023-03-15 07:47:04] [INFO ] Deduced a trap composed of 320 places in 393 ms of which 2 ms to minimize.
[2023-03-15 07:47:04] [INFO ] Deduced a trap composed of 314 places in 325 ms of which 2 ms to minimize.
[2023-03-15 07:47:04] [INFO ] Deduced a trap composed of 317 places in 298 ms of which 1 ms to minimize.
[2023-03-15 07:47:05] [INFO ] Deduced a trap composed of 311 places in 300 ms of which 1 ms to minimize.
[2023-03-15 07:47:05] [INFO ] Deduced a trap composed of 320 places in 300 ms of which 0 ms to minimize.
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 332 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-15 07:47:06] [INFO ] Deduced a trap composed of 332 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 323 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:47:07] [INFO ] Deduced a trap composed of 311 places in 328 ms of which 1 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 329 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:47:08] [INFO ] Deduced a trap composed of 332 places in 329 ms of which 0 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 332 places in 340 ms of which 1 ms to minimize.
[2023-03-15 07:47:09] [INFO ] Deduced a trap composed of 314 places in 328 ms of which 1 ms to minimize.
[2023-03-15 07:47:10] [INFO ] Deduced a trap composed of 317 places in 303 ms of which 1 ms to minimize.
[2023-03-15 07:47:10] [INFO ] Deduced a trap composed of 329 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:47:11] [INFO ] Deduced a trap composed of 338 places in 332 ms of which 1 ms to minimize.
[2023-03-15 07:47:11] [INFO ] Deduced a trap composed of 338 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:47:11] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 1 ms to minimize.
[2023-03-15 07:47:12] [INFO ] Deduced a trap composed of 308 places in 363 ms of which 1 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 335 places in 616 ms of which 1 ms to minimize.
[2023-03-15 07:47:13] [INFO ] Deduced a trap composed of 317 places in 373 ms of which 1 ms to minimize.
[2023-03-15 07:47:14] [INFO ] Deduced a trap composed of 338 places in 350 ms of which 1 ms to minimize.
[2023-03-15 07:47:14] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 1 ms to minimize.
[2023-03-15 07:47:16] [INFO ] Deduced a trap composed of 308 places in 493 ms of which 1 ms to minimize.
[2023-03-15 07:47:16] [INFO ] Deduced a trap composed of 326 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:47:17] [INFO ] Deduced a trap composed of 332 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:47:17] [INFO ] Deduced a trap composed of 329 places in 328 ms of which 1 ms to minimize.
[2023-03-15 07:47:18] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 1 ms to minimize.
[2023-03-15 07:47:18] [INFO ] Deduced a trap composed of 335 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:47:19] [INFO ] Deduced a trap composed of 323 places in 338 ms of which 4 ms to minimize.
[2023-03-15 07:47:20] [INFO ] Deduced a trap composed of 320 places in 329 ms of which 5 ms to minimize.
[2023-03-15 07:47:20] [INFO ] Deduced a trap composed of 347 places in 332 ms of which 1 ms to minimize.
[2023-03-15 07:47:20] [INFO ] Deduced a trap composed of 329 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:47:21] [INFO ] Deduced a trap composed of 320 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:47:30] [INFO ] Trap strengthening (SAT) tested/added 37/37 trap constraints in 27471 ms
[2023-03-15 07:47:31] [INFO ] After 28285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:47:31] [INFO ] After 29025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 60 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 52 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 07:47:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:47:31] [INFO ] Invariant cache hit.
[2023-03-15 07:47:32] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2023-03-15 07:47:32] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:47:32] [INFO ] Invariant cache hit.
[2023-03-15 07:47:33] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5499 after 12819
[2023-03-15 07:47:37] [INFO ] Implicit Places using invariants and state equation in 4875 ms returned []
Implicit Place search using SMT with State Equation took 6305 ms to find 0 implicit places.
[2023-03-15 07:47:37] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-15 07:47:37] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:47:37] [INFO ] Invariant cache hit.
[2023-03-15 07:47:38] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7526 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5119 resets, run finished after 774 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:47:39] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:47:39] [INFO ] Invariant cache hit.
[2023-03-15 07:47:39] [INFO ] [Real]Absence check using 170 positive place invariants in 46 ms returned sat
[2023-03-15 07:47:39] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 07:47:39] [INFO ] After 411ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:47:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:47:40] [INFO ] After 49ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:47:40] [INFO ] After 142ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:40] [INFO ] After 743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:47:40] [INFO ] [Nat]Absence check using 170 positive place invariants in 33 ms returned sat
[2023-03-15 07:47:40] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 07:47:40] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:41] [INFO ] After 501ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:47:41] [INFO ] Deduced a trap composed of 308 places in 652 ms of which 1 ms to minimize.
[2023-03-15 07:47:42] [INFO ] Deduced a trap composed of 311 places in 659 ms of which 5 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 326 places in 2289 ms of which 33 ms to minimize.
[2023-03-15 07:47:45] [INFO ] Deduced a trap composed of 323 places in 631 ms of which 1 ms to minimize.
[2023-03-15 07:47:46] [INFO ] Deduced a trap composed of 320 places in 678 ms of which 2 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 320 places in 337 ms of which 1 ms to minimize.
[2023-03-15 07:47:47] [INFO ] Deduced a trap composed of 320 places in 717 ms of which 2 ms to minimize.
[2023-03-15 07:47:48] [INFO ] Deduced a trap composed of 311 places in 658 ms of which 2 ms to minimize.
[2023-03-15 07:47:49] [INFO ] Deduced a trap composed of 326 places in 616 ms of which 2 ms to minimize.
[2023-03-15 07:47:50] [INFO ] Deduced a trap composed of 320 places in 629 ms of which 2 ms to minimize.
[2023-03-15 07:47:50] [INFO ] Deduced a trap composed of 335 places in 361 ms of which 1 ms to minimize.
[2023-03-15 07:47:51] [INFO ] Deduced a trap composed of 332 places in 348 ms of which 1 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 317 places in 631 ms of which 4 ms to minimize.
[2023-03-15 07:47:52] [INFO ] Deduced a trap composed of 347 places in 655 ms of which 1 ms to minimize.
[2023-03-15 07:47:53] [INFO ] Deduced a trap composed of 341 places in 634 ms of which 1 ms to minimize.
[2023-03-15 07:47:53] [INFO ] Deduced a trap composed of 326 places in 372 ms of which 1 ms to minimize.
[2023-03-15 07:47:54] [INFO ] Deduced a trap composed of 326 places in 623 ms of which 4 ms to minimize.
[2023-03-15 07:47:56] [INFO ] Deduced a trap composed of 302 places in 694 ms of which 27 ms to minimize.
[2023-03-15 07:47:57] [INFO ] Deduced a trap composed of 332 places in 667 ms of which 2 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 314 places in 625 ms of which 2 ms to minimize.
[2023-03-15 07:47:59] [INFO ] Deduced a trap composed of 308 places in 685 ms of which 1 ms to minimize.
[2023-03-15 07:48:00] [INFO ] Deduced a trap composed of 323 places in 628 ms of which 2 ms to minimize.
[2023-03-15 07:48:01] [INFO ] Deduced a trap composed of 338 places in 650 ms of which 2 ms to minimize.
[2023-03-15 07:48:02] [INFO ] Deduced a trap composed of 323 places in 597 ms of which 2 ms to minimize.
[2023-03-15 07:48:02] [INFO ] Deduced a trap composed of 341 places in 575 ms of which 4 ms to minimize.
[2023-03-15 07:48:03] [INFO ] Deduced a trap composed of 341 places in 710 ms of which 27 ms to minimize.
[2023-03-15 07:48:04] [INFO ] Deduced a trap composed of 332 places in 1415 ms of which 1 ms to minimize.
[2023-03-15 07:48:05] [INFO ] Deduced a trap composed of 305 places in 354 ms of which 1 ms to minimize.
[2023-03-15 07:48:05] [INFO ] Deduced a trap composed of 317 places in 360 ms of which 2 ms to minimize.
[2023-03-15 07:48:07] [INFO ] Deduced a trap composed of 320 places in 364 ms of which 9 ms to minimize.
[2023-03-15 07:48:08] [INFO ] Deduced a trap composed of 335 places in 361 ms of which 1 ms to minimize.
[2023-03-15 07:48:09] [INFO ] Deduced a trap composed of 335 places in 354 ms of which 1 ms to minimize.
[2023-03-15 07:48:09] [INFO ] Deduced a trap composed of 308 places in 644 ms of which 2 ms to minimize.
[2023-03-15 07:48:10] [INFO ] Deduced a trap composed of 326 places in 622 ms of which 2 ms to minimize.
[2023-03-15 07:48:14] [INFO ] Deduced a trap composed of 323 places in 637 ms of which 2 ms to minimize.
[2023-03-15 07:48:15] [INFO ] Deduced a trap composed of 308 places in 625 ms of which 1 ms to minimize.
[2023-03-15 07:48:16] [INFO ] Deduced a trap composed of 317 places in 624 ms of which 1 ms to minimize.
[2023-03-15 07:48:17] [INFO ] Deduced a trap composed of 344 places in 610 ms of which 2 ms to minimize.
[2023-03-15 07:48:26] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 45176 ms
[2023-03-15 07:48:26] [INFO ] After 46068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:48:26] [INFO ] After 46666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 52012 resets, run finished after 6232 ms. (steps per millisecond=160 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2706 resets, run finished after 1511 ms. (steps per millisecond=661 ) properties (out of 1) seen :0
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :12819 after 28107
Interrupted probabilistic random walk after 2016890 steps, run timeout after 21001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 2016890 steps, saw 627753 distinct states, run finished after 21001 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:48:55] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:48:55] [INFO ] Invariant cache hit.
[2023-03-15 07:48:55] [INFO ] [Real]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 07:48:55] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 07:48:55] [INFO ] After 211ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:48:55] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-15 07:48:55] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 07:48:56] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:48:56] [INFO ] After 548ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:48:57] [INFO ] Deduced a trap composed of 308 places in 339 ms of which 1 ms to minimize.
[2023-03-15 07:48:57] [INFO ] Deduced a trap composed of 311 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:48:58] [INFO ] Deduced a trap composed of 326 places in 332 ms of which 1 ms to minimize.
[2023-03-15 07:48:58] [INFO ] Deduced a trap composed of 323 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:48:58] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:48:59] [INFO ] Deduced a trap composed of 320 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:48:59] [INFO ] Deduced a trap composed of 320 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:49:00] [INFO ] Deduced a trap composed of 311 places in 330 ms of which 0 ms to minimize.
[2023-03-15 07:49:00] [INFO ] Deduced a trap composed of 326 places in 335 ms of which 1 ms to minimize.
[2023-03-15 07:49:01] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-15 07:49:01] [INFO ] Deduced a trap composed of 335 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:49:01] [INFO ] Deduced a trap composed of 332 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:49:02] [INFO ] Deduced a trap composed of 317 places in 337 ms of which 1 ms to minimize.
[2023-03-15 07:49:03] [INFO ] Deduced a trap composed of 347 places in 335 ms of which 1 ms to minimize.
[2023-03-15 07:49:03] [INFO ] Deduced a trap composed of 341 places in 300 ms of which 1 ms to minimize.
[2023-03-15 07:49:03] [INFO ] Deduced a trap composed of 326 places in 344 ms of which 1 ms to minimize.
[2023-03-15 07:49:04] [INFO ] Deduced a trap composed of 326 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:49:05] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 0 ms to minimize.
[2023-03-15 07:49:06] [INFO ] Deduced a trap composed of 332 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 1 ms to minimize.
[2023-03-15 07:49:07] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 323 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:49:08] [INFO ] Deduced a trap composed of 338 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 323 places in 336 ms of which 0 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 341 places in 305 ms of which 1 ms to minimize.
[2023-03-15 07:49:09] [INFO ] Deduced a trap composed of 341 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Deduced a trap composed of 332 places in 325 ms of which 0 ms to minimize.
[2023-03-15 07:49:10] [INFO ] Deduced a trap composed of 305 places in 344 ms of which 1 ms to minimize.
[2023-03-15 07:49:11] [INFO ] Deduced a trap composed of 317 places in 332 ms of which 1 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 320 places in 332 ms of which 0 ms to minimize.
[2023-03-15 07:49:13] [INFO ] Deduced a trap composed of 335 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 335 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:49:14] [INFO ] Deduced a trap composed of 308 places in 330 ms of which 0 ms to minimize.
[2023-03-15 07:49:15] [INFO ] Deduced a trap composed of 326 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:49:18] [INFO ] Deduced a trap composed of 323 places in 340 ms of which 1 ms to minimize.
[2023-03-15 07:49:19] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 0 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 317 places in 336 ms of which 1 ms to minimize.
[2023-03-15 07:49:20] [INFO ] Deduced a trap composed of 344 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:49:29] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 32993 ms
[2023-03-15 07:49:30] [INFO ] After 33881ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:49:30] [INFO ] After 34537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 97 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 48 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 07:49:30] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:49:30] [INFO ] Invariant cache hit.
[2023-03-15 07:49:32] [INFO ] Implicit Places using invariants in 1522 ms returned []
[2023-03-15 07:49:32] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:49:32] [INFO ] Invariant cache hit.
[2023-03-15 07:49:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:49:37] [INFO ] Implicit Places using invariants and state equation in 5441 ms returned []
Implicit Place search using SMT with State Equation took 6979 ms to find 0 implicit places.
[2023-03-15 07:49:37] [INFO ] Redundant transitions in 61 ms returned []
[2023-03-15 07:49:37] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:49:37] [INFO ] Invariant cache hit.
[2023-03-15 07:49:38] [INFO ] Dead Transitions using invariants and state equation in 1071 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8190 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 100000 steps, including 5262 resets, run finished after 668 ms. (steps per millisecond=149 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:49:39] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:49:39] [INFO ] Invariant cache hit.
[2023-03-15 07:49:39] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 07:49:39] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 07:49:39] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:49:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:49:39] [INFO ] After 54ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 07:49:40] [INFO ] After 133ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:49:40] [INFO ] After 754ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:49:40] [INFO ] [Nat]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 07:49:40] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-15 07:49:40] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:49:41] [INFO ] After 483ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:49:41] [INFO ] Deduced a trap composed of 308 places in 324 ms of which 2 ms to minimize.
[2023-03-15 07:49:41] [INFO ] Deduced a trap composed of 311 places in 323 ms of which 2 ms to minimize.
[2023-03-15 07:49:42] [INFO ] Deduced a trap composed of 326 places in 319 ms of which 1 ms to minimize.
[2023-03-15 07:49:42] [INFO ] Deduced a trap composed of 323 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:49:43] [INFO ] Deduced a trap composed of 320 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:49:43] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 1 ms to minimize.
[2023-03-15 07:49:43] [INFO ] Deduced a trap composed of 320 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:49:44] [INFO ] Deduced a trap composed of 311 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:49:44] [INFO ] Deduced a trap composed of 326 places in 328 ms of which 1 ms to minimize.
[2023-03-15 07:49:45] [INFO ] Deduced a trap composed of 320 places in 316 ms of which 1 ms to minimize.
[2023-03-15 07:49:45] [INFO ] Deduced a trap composed of 335 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:49:45] [INFO ] Deduced a trap composed of 332 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:49:46] [INFO ] Deduced a trap composed of 317 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:49:46] [INFO ] Deduced a trap composed of 347 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:49:47] [INFO ] Deduced a trap composed of 341 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:49:47] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:49:48] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:49:49] [INFO ] Deduced a trap composed of 302 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:49:49] [INFO ] Deduced a trap composed of 332 places in 304 ms of which 1 ms to minimize.
[2023-03-15 07:49:51] [INFO ] Deduced a trap composed of 314 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:49:51] [INFO ] Deduced a trap composed of 308 places in 303 ms of which 1 ms to minimize.
[2023-03-15 07:49:52] [INFO ] Deduced a trap composed of 323 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:49:52] [INFO ] Deduced a trap composed of 338 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:49:52] [INFO ] Deduced a trap composed of 323 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:49:53] [INFO ] Deduced a trap composed of 341 places in 309 ms of which 0 ms to minimize.
[2023-03-15 07:49:53] [INFO ] Deduced a trap composed of 341 places in 316 ms of which 1 ms to minimize.
[2023-03-15 07:49:54] [INFO ] Deduced a trap composed of 332 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:49:54] [INFO ] Deduced a trap composed of 305 places in 310 ms of which 1 ms to minimize.
[2023-03-15 07:49:54] [INFO ] Deduced a trap composed of 317 places in 313 ms of which 2 ms to minimize.
[2023-03-15 07:49:57] [INFO ] Deduced a trap composed of 320 places in 662 ms of which 2 ms to minimize.
[2023-03-15 07:49:58] [INFO ] Deduced a trap composed of 335 places in 684 ms of which 2 ms to minimize.
[2023-03-15 07:49:59] [INFO ] Deduced a trap composed of 335 places in 616 ms of which 1 ms to minimize.
[2023-03-15 07:49:59] [INFO ] Deduced a trap composed of 308 places in 705 ms of which 2 ms to minimize.
[2023-03-15 07:50:00] [INFO ] Deduced a trap composed of 326 places in 637 ms of which 2 ms to minimize.
[2023-03-15 07:50:04] [INFO ] Deduced a trap composed of 323 places in 655 ms of which 1 ms to minimize.
[2023-03-15 07:50:05] [INFO ] Deduced a trap composed of 308 places in 678 ms of which 1 ms to minimize.
[2023-03-15 07:50:06] [INFO ] Deduced a trap composed of 317 places in 723 ms of which 2 ms to minimize.
[2023-03-15 07:50:07] [INFO ] Deduced a trap composed of 344 places in 647 ms of which 1 ms to minimize.
[2023-03-15 07:50:16] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 35800 ms
[2023-03-15 07:50:17] [INFO ] After 36642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:50:17] [INFO ] After 37251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 504 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278161 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278161 steps, saw 83785 distinct states, run finished after 3014 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:50:20] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:50:20] [INFO ] Invariant cache hit.
[2023-03-15 07:50:20] [INFO ] [Real]Absence check using 170 positive place invariants in 66 ms returned sat
[2023-03-15 07:50:20] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 42 ms returned sat
[2023-03-15 07:50:20] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:50:21] [INFO ] [Nat]Absence check using 170 positive place invariants in 59 ms returned sat
[2023-03-15 07:50:21] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 51 ms returned sat
[2023-03-15 07:50:22] [INFO ] After 868ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:50:22] [INFO ] After 401ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:23] [INFO ] Deduced a trap composed of 341 places in 765 ms of which 2 ms to minimize.
[2023-03-15 07:50:24] [INFO ] Deduced a trap composed of 314 places in 666 ms of which 1 ms to minimize.
[2023-03-15 07:50:24] [INFO ] Deduced a trap composed of 311 places in 698 ms of which 2 ms to minimize.
[2023-03-15 07:50:25] [INFO ] Deduced a trap composed of 326 places in 667 ms of which 1 ms to minimize.
[2023-03-15 07:50:26] [INFO ] Deduced a trap composed of 311 places in 664 ms of which 1 ms to minimize.
[2023-03-15 07:50:27] [INFO ] Deduced a trap composed of 305 places in 687 ms of which 2 ms to minimize.
[2023-03-15 07:50:28] [INFO ] Deduced a trap composed of 332 places in 941 ms of which 1 ms to minimize.
[2023-03-15 07:50:29] [INFO ] Deduced a trap composed of 314 places in 632 ms of which 2 ms to minimize.
[2023-03-15 07:50:30] [INFO ] Deduced a trap composed of 326 places in 689 ms of which 2 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 324 places in 710 ms of which 1 ms to minimize.
[2023-03-15 07:50:31] [INFO ] Deduced a trap composed of 320 places in 622 ms of which 1 ms to minimize.
[2023-03-15 07:50:32] [INFO ] Deduced a trap composed of 326 places in 682 ms of which 1 ms to minimize.
[2023-03-15 07:50:33] [INFO ] Deduced a trap composed of 326 places in 625 ms of which 1 ms to minimize.
[2023-03-15 07:50:34] [INFO ] Deduced a trap composed of 320 places in 616 ms of which 2 ms to minimize.
[2023-03-15 07:50:34] [INFO ] Deduced a trap composed of 347 places in 593 ms of which 2 ms to minimize.
[2023-03-15 07:50:35] [INFO ] Deduced a trap composed of 332 places in 598 ms of which 1 ms to minimize.
[2023-03-15 07:50:36] [INFO ] Deduced a trap composed of 314 places in 597 ms of which 1 ms to minimize.
[2023-03-15 07:50:36] [INFO ] Deduced a trap composed of 305 places in 601 ms of which 1 ms to minimize.
[2023-03-15 07:50:38] [INFO ] Deduced a trap composed of 299 places in 972 ms of which 1 ms to minimize.
[2023-03-15 07:50:38] [INFO ] Deduced a trap composed of 326 places in 627 ms of which 2 ms to minimize.
[2023-03-15 07:50:39] [INFO ] Deduced a trap composed of 323 places in 730 ms of which 1 ms to minimize.
[2023-03-15 07:50:40] [INFO ] Deduced a trap composed of 311 places in 717 ms of which 1 ms to minimize.
[2023-03-15 07:50:41] [INFO ] Deduced a trap composed of 326 places in 636 ms of which 2 ms to minimize.
[2023-03-15 07:50:42] [INFO ] Deduced a trap composed of 332 places in 685 ms of which 2 ms to minimize.
[2023-03-15 07:50:43] [INFO ] Deduced a trap composed of 326 places in 421 ms of which 1 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 302 places in 331 ms of which 1 ms to minimize.
[2023-03-15 07:50:44] [INFO ] Deduced a trap composed of 332 places in 333 ms of which 1 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 302 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:50:45] [INFO ] Deduced a trap composed of 326 places in 334 ms of which 1 ms to minimize.
[2023-03-15 07:50:46] [INFO ] Deduced a trap composed of 353 places in 337 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:50:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:50:46] [INFO ] After 25209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 39 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 07:50:46] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:50:46] [INFO ] Invariant cache hit.
SDD proceeding with computation,1 properties remain. new max is 262144
[2023-03-15 07:50:47] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 991 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 1) seen :0
SDD size :28107 after 56829
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 296673 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 296673 steps, saw 89426 distinct states, run finished after 3003 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 07:50:50] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:50:50] [INFO ] Invariant cache hit.
[2023-03-15 07:50:50] [INFO ] [Real]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 07:50:50] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 07:50:50] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:50:50] [INFO ] [Nat]Absence check using 170 positive place invariants in 35 ms returned sat
[2023-03-15 07:50:50] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-15 07:50:51] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:50:51] [INFO ] After 339ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 07:50:51] [INFO ] Deduced a trap composed of 341 places in 314 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 311 places in 305 ms of which 1 ms to minimize.
[2023-03-15 07:50:52] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 311 places in 314 ms of which 1 ms to minimize.
[2023-03-15 07:50:53] [INFO ] Deduced a trap composed of 305 places in 314 ms of which 1 ms to minimize.
[2023-03-15 07:50:54] [INFO ] Deduced a trap composed of 332 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:50:54] [INFO ] Deduced a trap composed of 314 places in 305 ms of which 1 ms to minimize.
[2023-03-15 07:50:55] [INFO ] Deduced a trap composed of 326 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:50:55] [INFO ] Deduced a trap composed of 324 places in 316 ms of which 0 ms to minimize.
[2023-03-15 07:50:55] [INFO ] Deduced a trap composed of 320 places in 305 ms of which 1 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2023-03-15 07:50:56] [INFO ] Deduced a trap composed of 326 places in 301 ms of which 1 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 320 places in 307 ms of which 1 ms to minimize.
[2023-03-15 07:50:57] [INFO ] Deduced a trap composed of 347 places in 307 ms of which 1 ms to minimize.
[2023-03-15 07:50:58] [INFO ] Deduced a trap composed of 332 places in 320 ms of which 1 ms to minimize.
[2023-03-15 07:50:58] [INFO ] Deduced a trap composed of 314 places in 306 ms of which 1 ms to minimize.
[2023-03-15 07:50:58] [INFO ] Deduced a trap composed of 305 places in 309 ms of which 1 ms to minimize.
[2023-03-15 07:50:59] [INFO ] Deduced a trap composed of 299 places in 310 ms of which 0 ms to minimize.
[2023-03-15 07:50:59] [INFO ] Deduced a trap composed of 326 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:50:59] [INFO ] Deduced a trap composed of 323 places in 303 ms of which 1 ms to minimize.
[2023-03-15 07:51:00] [INFO ] Deduced a trap composed of 311 places in 306 ms of which 1 ms to minimize.
[2023-03-15 07:51:00] [INFO ] Deduced a trap composed of 326 places in 308 ms of which 0 ms to minimize.
[2023-03-15 07:51:01] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 1 ms to minimize.
[2023-03-15 07:51:02] [INFO ] Deduced a trap composed of 326 places in 304 ms of which 1 ms to minimize.
[2023-03-15 07:51:03] [INFO ] Deduced a trap composed of 302 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:51:03] [INFO ] Deduced a trap composed of 332 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:51:04] [INFO ] Deduced a trap composed of 302 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:51:04] [INFO ] Deduced a trap composed of 326 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:51:04] [INFO ] Deduced a trap composed of 353 places in 299 ms of which 1 ms to minimize.
[2023-03-15 07:51:05] [INFO ] Deduced a trap composed of 317 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:51:06] [INFO ] Deduced a trap composed of 311 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:51:06] [INFO ] Deduced a trap composed of 311 places in 299 ms of which 1 ms to minimize.
[2023-03-15 07:51:07] [INFO ] Deduced a trap composed of 335 places in 303 ms of which 2 ms to minimize.
[2023-03-15 07:51:07] [INFO ] Deduced a trap composed of 311 places in 303 ms of which 0 ms to minimize.
[2023-03-15 07:51:08] [INFO ] Deduced a trap composed of 317 places in 304 ms of which 1 ms to minimize.
[2023-03-15 07:51:08] [INFO ] Deduced a trap composed of 311 places in 304 ms of which 1 ms to minimize.
[2023-03-15 07:51:09] [INFO ] Deduced a trap composed of 317 places in 340 ms of which 1 ms to minimize.
[2023-03-15 07:51:09] [INFO ] Deduced a trap composed of 335 places in 307 ms of which 1 ms to minimize.
[2023-03-15 07:51:10] [INFO ] Deduced a trap composed of 311 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:51:10] [INFO ] Deduced a trap composed of 344 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:51:10] [INFO ] Deduced a trap composed of 341 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:51:11] [INFO ] Deduced a trap composed of 305 places in 321 ms of which 0 ms to minimize.
[2023-03-15 07:51:12] [INFO ] Deduced a trap composed of 311 places in 328 ms of which 0 ms to minimize.
[2023-03-15 07:51:15] [INFO ] Trap strengthening (SAT) tested/added 44/44 trap constraints in 24015 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 07:51:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 07:51:15] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 37 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 33 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-15 07:51:15] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:51:15] [INFO ] Invariant cache hit.
[2023-03-15 07:51:16] [INFO ] Implicit Places using invariants in 1394 ms returned []
[2023-03-15 07:51:16] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:51:16] [INFO ] Invariant cache hit.
[2023-03-15 07:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 07:51:22] [INFO ] Implicit Places using invariants and state equation in 5864 ms returned []
Implicit Place search using SMT with State Equation took 7274 ms to find 0 implicit places.
[2023-03-15 07:51:22] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 07:51:22] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-15 07:51:22] [INFO ] Invariant cache hit.
[2023-03-15 07:51:23] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8413 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 150 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1415 rows 1003 cols
[2023-03-15 07:51:24] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-15 07:51:24] [INFO ] [Real]Absence check using 170 positive place invariants in 32 ms returned sat
[2023-03-15 07:51:24] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 07:51:24] [INFO ] After 444ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 07:51:25] [INFO ] Deduced a trap composed of 327 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:51:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2023-03-15 07:51:25] [INFO ] After 906ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:51:25] [INFO ] After 1073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:51:25] [INFO ] [Nat]Absence check using 170 positive place invariants in 34 ms returned sat
[2023-03-15 07:51:25] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 07:51:25] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:51:26] [INFO ] Deduced a trap composed of 327 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:51:26] [INFO ] Deduced a trap composed of 312 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:26] [INFO ] Deduced a trap composed of 330 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:51:27] [INFO ] Deduced a trap composed of 327 places in 313 ms of which 0 ms to minimize.
[2023-03-15 07:51:28] [INFO ] Deduced a trap composed of 309 places in 325 ms of which 2 ms to minimize.
[2023-03-15 07:51:28] [INFO ] Deduced a trap composed of 300 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:51:28] [INFO ] Deduced a trap composed of 330 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:29] [INFO ] Deduced a trap composed of 312 places in 323 ms of which 1 ms to minimize.
[2023-03-15 07:51:29] [INFO ] Deduced a trap composed of 333 places in 330 ms of which 1 ms to minimize.
[2023-03-15 07:51:30] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:30] [INFO ] Deduced a trap composed of 330 places in 325 ms of which 0 ms to minimize.
[2023-03-15 07:51:30] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 321 places in 323 ms of which 1 ms to minimize.
[2023-03-15 07:51:31] [INFO ] Deduced a trap composed of 312 places in 329 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 327 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 0 ms to minimize.
[2023-03-15 07:51:32] [INFO ] Deduced a trap composed of 324 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 324 places in 323 ms of which 1 ms to minimize.
[2023-03-15 07:51:33] [INFO ] Deduced a trap composed of 321 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:34] [INFO ] Deduced a trap composed of 318 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:51:34] [INFO ] Deduced a trap composed of 312 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:51:34] [INFO ] Deduced a trap composed of 330 places in 322 ms of which 2 ms to minimize.
[2023-03-15 07:51:35] [INFO ] Deduced a trap composed of 321 places in 323 ms of which 1 ms to minimize.
[2023-03-15 07:51:35] [INFO ] Deduced a trap composed of 309 places in 324 ms of which 1 ms to minimize.
[2023-03-15 07:51:36] [INFO ] Deduced a trap composed of 342 places in 325 ms of which 0 ms to minimize.
[2023-03-15 07:51:36] [INFO ] Deduced a trap composed of 330 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:51:36] [INFO ] Deduced a trap composed of 321 places in 323 ms of which 1 ms to minimize.
[2023-03-15 07:51:37] [INFO ] Deduced a trap composed of 336 places in 347 ms of which 1 ms to minimize.
[2023-03-15 07:51:38] [INFO ] Deduced a trap composed of 306 places in 570 ms of which 19 ms to minimize.
[2023-03-15 07:51:38] [INFO ] Deduced a trap composed of 327 places in 610 ms of which 2 ms to minimize.
[2023-03-15 07:51:39] [INFO ] Deduced a trap composed of 324 places in 558 ms of which 1 ms to minimize.
[2023-03-15 07:51:43] [INFO ] Deduced a trap composed of 330 places in 3499 ms of which 0 ms to minimize.
[2023-03-15 07:51:44] [INFO ] Deduced a trap composed of 333 places in 680 ms of which 2 ms to minimize.
[2023-03-15 07:51:44] [INFO ] Deduced a trap composed of 291 places in 693 ms of which 2 ms to minimize.
[2023-03-15 07:51:45] [INFO ] Deduced a trap composed of 306 places in 657 ms of which 1 ms to minimize.
[2023-03-15 07:51:46] [INFO ] Deduced a trap composed of 300 places in 659 ms of which 2 ms to minimize.
[2023-03-15 07:51:47] [INFO ] Deduced a trap composed of 315 places in 653 ms of which 2 ms to minimize.
[2023-03-15 07:51:48] [INFO ] Deduced a trap composed of 330 places in 720 ms of which 1 ms to minimize.
[2023-03-15 07:51:49] [INFO ] Deduced a trap composed of 321 places in 629 ms of which 1 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 327 places in 594 ms of which 1 ms to minimize.
[2023-03-15 07:51:50] [INFO ] Deduced a trap composed of 339 places in 643 ms of which 2 ms to minimize.
[2023-03-15 07:51:51] [INFO ] Deduced a trap composed of 315 places in 715 ms of which 2 ms to minimize.
[2023-03-15 07:51:52] [INFO ] Deduced a trap composed of 333 places in 479 ms of which 1 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 339 places in 314 ms of which 0 ms to minimize.
[2023-03-15 07:51:53] [INFO ] Deduced a trap composed of 324 places in 448 ms of which 1 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 330 places in 344 ms of which 1 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 336 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:51:54] [INFO ] Deduced a trap composed of 312 places in 332 ms of which 0 ms to minimize.
[2023-03-15 07:51:55] [INFO ] Deduced a trap composed of 333 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 327 places in 321 ms of which 1 ms to minimize.
[2023-03-15 07:51:56] [INFO ] Deduced a trap composed of 315 places in 325 ms of which 0 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 300 places in 327 ms of which 0 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 306 places in 343 ms of which 1 ms to minimize.
[2023-03-15 07:51:57] [INFO ] Deduced a trap composed of 336 places in 341 ms of which 1 ms to minimize.
[2023-03-15 07:51:58] [INFO ] Deduced a trap composed of 330 places in 616 ms of which 1 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 318 places in 577 ms of which 2 ms to minimize.
[2023-03-15 07:51:59] [INFO ] Deduced a trap composed of 321 places in 602 ms of which 2 ms to minimize.
[2023-03-15 07:52:01] [INFO ] Deduced a trap composed of 312 places in 660 ms of which 1 ms to minimize.
[2023-03-15 07:52:02] [INFO ] Deduced a trap composed of 327 places in 618 ms of which 1 ms to minimize.
[2023-03-15 07:52:02] [INFO ] Deduced a trap composed of 330 places in 650 ms of which 2 ms to minimize.
[2023-03-15 07:52:04] [INFO ] Deduced a trap composed of 324 places in 661 ms of which 2 ms to minimize.
[2023-03-15 07:52:05] [INFO ] Deduced a trap composed of 318 places in 664 ms of which 1 ms to minimize.
[2023-03-15 07:52:05] [INFO ] Deduced a trap composed of 300 places in 612 ms of which 2 ms to minimize.
[2023-03-15 07:52:07] [INFO ] Deduced a trap composed of 312 places in 660 ms of which 2 ms to minimize.
[2023-03-15 07:52:08] [INFO ] Deduced a trap composed of 324 places in 631 ms of which 2 ms to minimize.
[2023-03-15 07:52:12] [INFO ] Deduced a trap composed of 321 places in 635 ms of which 2 ms to minimize.
[2023-03-15 07:52:16] [INFO ] Deduced a trap composed of 324 places in 648 ms of which 2 ms to minimize.
[2023-03-15 07:52:17] [INFO ] Deduced a trap composed of 333 places in 668 ms of which 2 ms to minimize.
[2023-03-15 07:52:18] [INFO ] Deduced a trap composed of 300 places in 683 ms of which 2 ms to minimize.
[2023-03-15 07:52:20] [INFO ] Deduced a trap composed of 318 places in 718 ms of which 1 ms to minimize.
[2023-03-15 07:52:22] [INFO ] Deduced a trap composed of 300 places in 674 ms of which 1 ms to minimize.
[2023-03-15 07:52:25] [INFO ] Deduced a trap composed of 303 places in 618 ms of which 2 ms to minimize.
[2023-03-15 07:52:34] [INFO ] Trap strengthening (SAT) tested/added 72/72 trap constraints in 68517 ms
[2023-03-15 07:52:34] [INFO ] After 69063ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:52:34] [INFO ] After 69269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1010 transition count 1422
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1010 transition count 1421
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1009 transition count 1421
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 1009 transition count 1420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 1008 transition count 1420
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 1008 transition count 1415
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 1003 transition count 1415
Applied a total of 18 rules in 310 ms. Remains 1003 /1010 variables (removed 7) and now considering 1415/1426 (removed 11) transitions.
Running SMT prover for 1 properties.
[2023-03-15 07:52:34] [INFO ] Invariant cache hit.
[2023-03-15 07:52:34] [INFO ] [Real]Absence check using 170 positive place invariants in 62 ms returned sat
[2023-03-15 07:52:35] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-15 07:52:35] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 07:52:35] [INFO ] [Nat]Absence check using 170 positive place invariants in 63 ms returned sat
[2023-03-15 07:52:35] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 07:52:36] [INFO ] After 860ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 07:52:37] [INFO ] Deduced a trap composed of 294 places in 681 ms of which 2 ms to minimize.
[2023-03-15 07:52:37] [INFO ] Deduced a trap composed of 306 places in 599 ms of which 1 ms to minimize.
[2023-03-15 07:52:38] [INFO ] Deduced a trap composed of 336 places in 675 ms of which 1 ms to minimize.
[2023-03-15 07:52:39] [INFO ] Deduced a trap composed of 333 places in 627 ms of which 3 ms to minimize.
[2023-03-15 07:52:39] [INFO ] Deduced a trap composed of 303 places in 336 ms of which 1 ms to minimize.
[2023-03-15 07:52:40] [INFO ] Deduced a trap composed of 327 places in 310 ms of which 0 ms to minimize.
[2023-03-15 07:52:40] [INFO ] Deduced a trap composed of 312 places in 310 ms of which 1 ms to minimize.
[2023-03-15 07:52:40] [INFO ] Deduced a trap composed of 315 places in 317 ms of which 1 ms to minimize.
[2023-03-15 07:52:41] [INFO ] Deduced a trap composed of 315 places in 316 ms of which 1 ms to minimize.
[2023-03-15 07:52:41] [INFO ] Deduced a trap composed of 327 places in 351 ms of which 1 ms to minimize.
[2023-03-15 07:52:42] [INFO ] Deduced a trap composed of 318 places in 324 ms of which 0 ms to minimize.
[2023-03-15 07:52:42] [INFO ] Deduced a trap composed of 324 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:52:43] [INFO ] Deduced a trap composed of 318 places in 347 ms of which 0 ms to minimize.
[2023-03-15 07:52:44] [INFO ] Deduced a trap composed of 318 places in 370 ms of which 1 ms to minimize.
[2023-03-15 07:52:44] [INFO ] Deduced a trap composed of 330 places in 342 ms of which 1 ms to minimize.
[2023-03-15 07:52:44] [INFO ] Deduced a trap composed of 318 places in 334 ms of which 1 ms to minimize.
[2023-03-15 07:52:45] [INFO ] Deduced a trap composed of 315 places in 311 ms of which 0 ms to minimize.
[2023-03-15 07:52:45] [INFO ] Deduced a trap composed of 309 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:52:46] [INFO ] Deduced a trap composed of 306 places in 322 ms of which 1 ms to minimize.
[2023-03-15 07:52:47] [INFO ] Deduced a trap composed of 330 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:52:47] [INFO ] Deduced a trap composed of 342 places in 310 ms of which 1 ms to minimize.
[2023-03-15 07:52:47] [INFO ] Deduced a trap composed of 318 places in 348 ms of which 1 ms to minimize.
[2023-03-15 07:52:48] [INFO ] Deduced a trap composed of 309 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:52:48] [INFO ] Deduced a trap composed of 315 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:52:49] [INFO ] Deduced a trap composed of 327 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 321 places in 319 ms of which 1 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 333 places in 319 ms of which 1 ms to minimize.
[2023-03-15 07:52:50] [INFO ] Deduced a trap composed of 321 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 315 places in 316 ms of which 0 ms to minimize.
[2023-03-15 07:52:51] [INFO ] Deduced a trap composed of 318 places in 321 ms of which 1 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 318 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:52:52] [INFO ] Deduced a trap composed of 330 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 318 places in 308 ms of which 1 ms to minimize.
[2023-03-15 07:52:53] [INFO ] Deduced a trap composed of 336 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:52:54] [INFO ] Deduced a trap composed of 315 places in 310 ms of which 0 ms to minimize.
[2023-03-15 07:52:54] [INFO ] Deduced a trap composed of 339 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:52:55] [INFO ] Deduced a trap composed of 309 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:52:56] [INFO ] Deduced a trap composed of 333 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:52:57] [INFO ] Deduced a trap composed of 327 places in 311 ms of which 0 ms to minimize.
[2023-03-15 07:52:57] [INFO ] Deduced a trap composed of 306 places in 327 ms of which 1 ms to minimize.
[2023-03-15 07:52:57] [INFO ] Deduced a trap composed of 312 places in 315 ms of which 0 ms to minimize.
[2023-03-15 07:52:58] [INFO ] Deduced a trap composed of 309 places in 309 ms of which 0 ms to minimize.
[2023-03-15 07:52:58] [INFO ] Deduced a trap composed of 333 places in 318 ms of which 1 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 306 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 321 places in 313 ms of which 1 ms to minimize.
[2023-03-15 07:52:59] [INFO ] Deduced a trap composed of 324 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:53:00] [INFO ] Deduced a trap composed of 327 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 309 places in 312 ms of which 0 ms to minimize.
[2023-03-15 07:53:01] [INFO ] Deduced a trap composed of 327 places in 315 ms of which 1 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 315 places in 310 ms of which 1 ms to minimize.
[2023-03-15 07:53:02] [INFO ] Deduced a trap composed of 330 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:53:03] [INFO ] Deduced a trap composed of 324 places in 321 ms of which 0 ms to minimize.
[2023-03-15 07:53:03] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 1 ms to minimize.
[2023-03-15 07:53:04] [INFO ] Deduced a trap composed of 324 places in 311 ms of which 1 ms to minimize.
[2023-03-15 07:53:04] [INFO ] Deduced a trap composed of 298 places in 326 ms of which 1 ms to minimize.
[2023-03-15 07:53:11] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 1 ms to minimize.
[2023-03-15 07:53:20] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 43752 ms
[2023-03-15 07:53:20] [INFO ] After 44720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:53:20] [INFO ] After 45070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-15 07:53:20] [INFO ] Flatten gal took : 111 ms
[2023-03-15 07:53:20] [INFO ] Flatten gal took : 82 ms
[2023-03-15 07:53:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2906843503875405254.gal : 12 ms
[2023-03-15 07:53:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14412199584585326561.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2906843503875405254.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14412199584585326561.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14412199584585326561.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 38
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :38 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 43
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :46 after 48
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :48 after 51
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :51 after 55
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :55 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 73
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :73 after 94
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :94 after 210
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :210 after 5770
Detected timeout of ITS tools.
[2023-03-15 07:53:35] [INFO ] Flatten gal took : 75 ms
[2023-03-15 07:53:35] [INFO ] Applying decomposition
[2023-03-15 07:53:35] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10916497474496168829.txt' '-o' '/tmp/graph10916497474496168829.bin' '-w' '/tmp/graph10916497474496168829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10916497474496168829.bin' '-l' '-1' '-v' '-w' '/tmp/graph10916497474496168829.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:53:35] [INFO ] Decomposing Gal with order
[2023-03-15 07:53:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:53:36] [INFO ] Removed a total of 1548 redundant transitions.
[2023-03-15 07:53:36] [INFO ] Flatten gal took : 614 ms
[2023-03-15 07:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 72 ms.
[2023-03-15 07:53:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8156633246554760507.gal : 22 ms
[2023-03-15 07:53:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8437428025449749364.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8156633246554760507.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8437428025449749364.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8437428025449749364.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16127660223689088982
[2023-03-15 07:53:51] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16127660223689088982
Running compilation step : cd /tmp/ltsmin16127660223689088982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2984 ms.
Running link step : cd /tmp/ltsmin16127660223689088982;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin16127660223689088982;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 07:54:07] [INFO ] Flatten gal took : 121 ms
[2023-03-15 07:54:07] [INFO ] Applying decomposition
[2023-03-15 07:54:07] [INFO ] Flatten gal took : 123 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13630046071820833241.txt' '-o' '/tmp/graph13630046071820833241.bin' '-w' '/tmp/graph13630046071820833241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13630046071820833241.bin' '-l' '-1' '-v' '-w' '/tmp/graph13630046071820833241.weights' '-q' '0' '-e' '0.001'
[2023-03-15 07:54:07] [INFO ] Decomposing Gal with order
[2023-03-15 07:54:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 07:54:08] [INFO ] Removed a total of 2399 redundant transitions.
[2023-03-15 07:54:08] [INFO ] Flatten gal took : 325 ms
[2023-03-15 07:54:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 115 labels/synchronizations in 88 ms.
[2023-03-15 07:54:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4575485800712322542.gal : 49 ms
[2023-03-15 07:54:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7002627386089562731.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4575485800712322542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7002627386089562731.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality7002627386089562731.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 96
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :96 after 114
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :114 after 114
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :114 after 119331
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :119331 after 124917
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :124917 after 130503
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :130503 after 138882
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :138882 after 152847
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :152847 after 191949
Detected timeout of ITS tools.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :191949 after 970827
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :970827 after 990987
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :990987 after 1.04391e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.04391e+06 after 1.14399e+06
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.14399e+06 after 1.35531e+06
Detected timeout of ITS tools.
[2023-03-15 08:04:08] [INFO ] Flatten gal took : 66 ms
[2023-03-15 08:04:08] [INFO ] Flatten gal took : 49 ms
[2023-03-15 08:04:08] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13301462510006329423.gal : 9 ms
[2023-03-15 08:04:08] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1443739335916313563.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability13301462510006329423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1443739335916313563.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityFireability1443739335916313563.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
Detected timeout of ITS tools.
[2023-03-15 08:04:12] [INFO ] Flatten gal took : 49 ms
[2023-03-15 08:04:12] [INFO ] Applying decomposition
[2023-03-15 08:04:12] [INFO ] Flatten gal took : 49 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13740112945347560352.txt' '-o' '/tmp/graph13740112945347560352.bin' '-w' '/tmp/graph13740112945347560352.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13740112945347560352.bin' '-l' '-1' '-v' '-w' '/tmp/graph13740112945347560352.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:04:12] [INFO ] Decomposing Gal with order
[2023-03-15 08:04:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:04:12] [INFO ] Removed a total of 1597 redundant transitions.
[2023-03-15 08:04:12] [INFO ] Flatten gal took : 206 ms
[2023-03-15 08:04:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 821 labels/synchronizations in 54 ms.
[2023-03-15 08:04:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4413656607656625552.gal : 20 ms
[2023-03-15 08:04:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1469072731202899262.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4413656607656625552.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1469072731202899262.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityFireability1469072731202899262.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6363588199003772049
[2023-03-15 08:04:15] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6363588199003772049
Running compilation step : cd /tmp/ltsmin6363588199003772049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6363588199003772049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6363588199003772049;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '2' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 08:04:17] [INFO ] Flatten gal took : 47 ms
[2023-03-15 08:04:17] [INFO ] Flatten gal took : 45 ms
[2023-03-15 08:04:17] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability10609943601568279949.gal : 8 ms
[2023-03-15 08:04:17] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability269015579194772440.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability10609943601568279949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability269015579194772440.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityFireability269015579194772440.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
Detected timeout of ITS tools.
[2023-03-15 08:04:47] [INFO ] Flatten gal took : 44 ms
[2023-03-15 08:04:47] [INFO ] Applying decomposition
[2023-03-15 08:04:47] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph5229608359835428468.txt' '-o' '/tmp/graph5229608359835428468.bin' '-w' '/tmp/graph5229608359835428468.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5229608359835428468.bin' '-l' '-1' '-v' '-w' '/tmp/graph5229608359835428468.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:04:48] [INFO ] Decomposing Gal with order
[2023-03-15 08:04:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:04:48] [INFO ] Removed a total of 1444 redundant transitions.
[2023-03-15 08:04:48] [INFO ] Flatten gal took : 217 ms
[2023-03-15 08:04:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 722 labels/synchronizations in 45 ms.
[2023-03-15 08:04:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11631309007352410113.gal : 15 ms
[2023-03-15 08:04:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6581714877368725250.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability11631309007352410113.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability6581714877368725250.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability6581714877368725250.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 66
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :66 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 82
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :82 after 1585
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1585 after 29749
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8347521355521208821
[2023-03-15 08:05:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8347521355521208821
Running compilation step : cd /tmp/ltsmin8347521355521208821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '6' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2783 ms.
Running link step : cd /tmp/ltsmin8347521355521208821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin8347521355521208821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 08:05:48] [INFO ] Flatten gal took : 48 ms
[2023-03-15 08:05:48] [INFO ] Flatten gal took : 46 ms
[2023-03-15 08:05:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability43638346848532283.gal : 8 ms
[2023-03-15 08:05:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17651806022735624141.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability43638346848532283.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability17651806022735624141.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityFireability17651806022735624141.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 46
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :46 after 49
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :49 after 54
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :54 after 61
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :61 after 76
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :76 after 128
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :128 after 4027
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4027 after 5274
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5274 after 6470
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :6470 after 8974
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :8974 after 18882
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :18882 after 38905
Detected timeout of ITS tools.
[2023-03-15 08:10:49] [INFO ] Flatten gal took : 46 ms
[2023-03-15 08:10:49] [INFO ] Applying decomposition
[2023-03-15 08:10:49] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12174632921574645177.txt' '-o' '/tmp/graph12174632921574645177.bin' '-w' '/tmp/graph12174632921574645177.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12174632921574645177.bin' '-l' '-1' '-v' '-w' '/tmp/graph12174632921574645177.weights' '-q' '0' '-e' '0.001'
[2023-03-15 08:10:49] [INFO ] Decomposing Gal with order
[2023-03-15 08:10:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 08:10:49] [INFO ] Removed a total of 1444 redundant transitions.
[2023-03-15 08:10:49] [INFO ] Flatten gal took : 274 ms
[2023-03-15 08:10:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 759 labels/synchronizations in 34 ms.
[2023-03-15 08:10:49] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17137945118873749278.gal : 28 ms
[2023-03-15 08:10:49] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9225852205144985572.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability17137945118873749278.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability9225852205144985572.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityFireability9225852205144985572.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 65
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :65 after 55015
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :55015 after 2.03767e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.03767e+06 after 2.03771e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2.03771e+06 after 4.18517e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.18517e+06 after 8.20988e+06
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16754908702865806333
[2023-03-15 08:15:50] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16754908702865806333
Running compilation step : cd /tmp/ltsmin16754908702865806333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '60' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2900 ms.
Running link step : cd /tmp/ltsmin16754908702865806333;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16754908702865806333;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'qltransition_11==true'
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 14011380 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16087424 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-S05J80"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is PolyORBNT-COL-S05J80, 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 r307-tall-167873961300417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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