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.r297-tall-167873950900762.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 ltsminxred
Input is PolyORBNT-PT-S10J30, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900762
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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

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

=== Now, execution of the tool begins

BK_START 1679639405332

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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 06:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 06:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 06:30:08] [INFO ] Load time of PNML (sax parser for PT used): 650 ms
[2023-03-24 06:30:08] [INFO ] Transformed 664 places.
[2023-03-24 06:30:08] [INFO ] Transformed 12050 transitions.
[2023-03-24 06:30:08] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 1061 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 105 ms.
[2023-03-24 06:30:08] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 06:30:08] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 06:30:08] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-24 06:30:08] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-24 06:30:08] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 631 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 181 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-24 06:30:09] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-24 06:30:09] [INFO ] Computed 92 place invariants in 138 ms
[2023-03-24 06:30:11] [INFO ] Dead Transitions using invariants and state equation in 2009 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-24 06:30:11] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-24 06:30:11] [INFO ] Computed 92 place invariants in 44 ms
[2023-03-24 06:30:11] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-24 06:30:11] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 06:30:11] [INFO ] Invariant cache hit.
[2023-03-24 06:30:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:30:11] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 12 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3000 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 631 out of 664 places after structural reductions.
[2023-03-24 06:30:12] [INFO ] Flatten gal took : 315 ms
[2023-03-24 06:30:13] [INFO ] Flatten gal took : 264 ms
[2023-03-24 06:30:14] [INFO ] Input system was already deterministic with 1325 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1421 ms. (steps per millisecond=7 ) properties (out of 83) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 76) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8 ) properties (out of 76) seen :7
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 69) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 69) seen :13
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=24 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 56) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 56) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 52) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 48) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 44) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 43) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 40) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 39) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :1
Running SMT prover for 25 properties.
[2023-03-24 06:30:16] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-24 06:30:16] [INFO ] Invariant cache hit.
[2023-03-24 06:30:17] [INFO ] [Real]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-24 06:30:17] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 34 ms returned sat
[2023-03-24 06:30:17] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:22
[2023-03-24 06:30:18] [INFO ] [Nat]Absence check using 62 positive place invariants in 23 ms returned sat
[2023-03-24 06:30:18] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 35 ms returned sat
[2023-03-24 06:30:21] [INFO ] After 2685ms SMT Verify possible using state equation in natural domain returned unsat :20 sat :5
[2023-03-24 06:30:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:30:23] [INFO ] After 2067ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :20 sat :5
[2023-03-24 06:30:24] [INFO ] Deduced a trap composed of 307 places in 383 ms of which 7 ms to minimize.
[2023-03-24 06:30:24] [INFO ] Deduced a trap composed of 305 places in 399 ms of which 2 ms to minimize.
[2023-03-24 06:30:24] [INFO ] Deduced a trap composed of 305 places in 391 ms of which 2 ms to minimize.
[2023-03-24 06:30:25] [INFO ] Deduced a trap composed of 303 places in 392 ms of which 2 ms to minimize.
[2023-03-24 06:30:25] [INFO ] Deduced a trap composed of 293 places in 400 ms of which 1 ms to minimize.
[2023-03-24 06:30:26] [INFO ] Deduced a trap composed of 315 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:30:26] [INFO ] Deduced a trap composed of 311 places in 369 ms of which 1 ms to minimize.
[2023-03-24 06:30:26] [INFO ] Deduced a trap composed of 309 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:30:27] [INFO ] Deduced a trap composed of 305 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:30:27] [INFO ] Deduced a trap composed of 307 places in 380 ms of which 1 ms to minimize.
[2023-03-24 06:30:28] [INFO ] Deduced a trap composed of 294 places in 360 ms of which 0 ms to minimize.
[2023-03-24 06:30:28] [INFO ] Deduced a trap composed of 303 places in 358 ms of which 0 ms to minimize.
[2023-03-24 06:30:29] [INFO ] Deduced a trap composed of 303 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:30:29] [INFO ] Deduced a trap composed of 303 places in 356 ms of which 1 ms to minimize.
[2023-03-24 06:30:30] [INFO ] Deduced a trap composed of 319 places in 355 ms of which 1 ms to minimize.
[2023-03-24 06:30:30] [INFO ] Deduced a trap composed of 305 places in 352 ms of which 1 ms to minimize.
[2023-03-24 06:30:31] [INFO ] Deduced a trap composed of 301 places in 357 ms of which 0 ms to minimize.
[2023-03-24 06:30:31] [INFO ] Deduced a trap composed of 319 places in 351 ms of which 1 ms to minimize.
[2023-03-24 06:30:31] [INFO ] Deduced a trap composed of 324 places in 348 ms of which 0 ms to minimize.
[2023-03-24 06:30:32] [INFO ] Deduced a trap composed of 307 places in 360 ms of which 1 ms to minimize.
[2023-03-24 06:30:32] [INFO ] Deduced a trap composed of 311 places in 365 ms of which 1 ms to minimize.
[2023-03-24 06:30:33] [INFO ] Deduced a trap composed of 313 places in 372 ms of which 1 ms to minimize.
[2023-03-24 06:30:33] [INFO ] Deduced a trap composed of 313 places in 350 ms of which 1 ms to minimize.
[2023-03-24 06:30:34] [INFO ] Deduced a trap composed of 303 places in 372 ms of which 0 ms to minimize.
[2023-03-24 06:30:34] [INFO ] Deduced a trap composed of 301 places in 360 ms of which 1 ms to minimize.
[2023-03-24 06:30:34] [INFO ] Deduced a trap composed of 301 places in 356 ms of which 1 ms to minimize.
[2023-03-24 06:30:35] [INFO ] Deduced a trap composed of 301 places in 361 ms of which 1 ms to minimize.
[2023-03-24 06:30:35] [INFO ] Deduced a trap composed of 317 places in 346 ms of which 1 ms to minimize.
[2023-03-24 06:30:36] [INFO ] Deduced a trap composed of 307 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:30:36] [INFO ] Deduced a trap composed of 298 places in 369 ms of which 0 ms to minimize.
[2023-03-24 06:30:37] [INFO ] Deduced a trap composed of 305 places in 381 ms of which 1 ms to minimize.
[2023-03-24 06:30:37] [INFO ] Deduced a trap composed of 299 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:30:38] [INFO ] Deduced a trap composed of 313 places in 360 ms of which 2 ms to minimize.
[2023-03-24 06:30:38] [INFO ] Deduced a trap composed of 307 places in 367 ms of which 1 ms to minimize.
[2023-03-24 06:30:39] [INFO ] Deduced a trap composed of 316 places in 367 ms of which 2 ms to minimize.
[2023-03-24 06:30:39] [INFO ] Deduced a trap composed of 310 places in 366 ms of which 1 ms to minimize.
[2023-03-24 06:30:40] [INFO ] Deduced a trap composed of 313 places in 395 ms of which 1 ms to minimize.
[2023-03-24 06:30:40] [INFO ] Deduced a trap composed of 311 places in 368 ms of which 0 ms to minimize.
[2023-03-24 06:30:41] [INFO ] Deduced a trap composed of 305 places in 353 ms of which 1 ms to minimize.
[2023-03-24 06:30:41] [INFO ] Deduced a trap composed of 293 places in 358 ms of which 1 ms to minimize.
[2023-03-24 06:30:42] [INFO ] Deduced a trap composed of 295 places in 366 ms of which 0 ms to minimize.
[2023-03-24 06:30:42] [INFO ] Deduced a trap composed of 303 places in 366 ms of which 1 ms to minimize.
[2023-03-24 06:30:43] [INFO ] Deduced a trap composed of 309 places in 361 ms of which 0 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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 06:30:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:30:43] [INFO ] After 25300ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:22
Fused 25 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 44 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 80 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 80 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 148 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 149 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 584 transition count 1255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 154 place count 582 transition count 1253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 582 transition count 1252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 581 transition count 1252
Applied a total of 156 rules in 307 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-24 06:30:43] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-24 06:30:43] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-24 06:30:44] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1348 ms. Remains : 581/664 places, 1252/1325 transitions.
Incomplete random walk after 10000 steps, including 668 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-24 06:30:44] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-24 06:30:44] [INFO ] Invariant cache hit.
[2023-03-24 06:30:45] [INFO ] [Real]Absence check using 62 positive place invariants in 20 ms returned sat
[2023-03-24 06:30:45] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 38 ms returned sat
[2023-03-24 06:30:45] [INFO ] After 877ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-24 06:30:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:30:46] [INFO ] After 105ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-24 06:30:46] [INFO ] After 221ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-24 06:30:46] [INFO ] After 1399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:1
[2023-03-24 06:30:46] [INFO ] [Nat]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-24 06:30:46] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-24 06:30:48] [INFO ] After 1805ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 06:30:48] [INFO ] After 440ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 06:30:49] [INFO ] Deduced a trap composed of 239 places in 341 ms of which 2 ms to minimize.
[2023-03-24 06:30:49] [INFO ] Deduced a trap composed of 238 places in 344 ms of which 1 ms to minimize.
[2023-03-24 06:30:50] [INFO ] Deduced a trap composed of 231 places in 357 ms of which 1 ms to minimize.
[2023-03-24 06:30:50] [INFO ] Deduced a trap composed of 231 places in 283 ms of which 0 ms to minimize.
[2023-03-24 06:30:50] [INFO ] Deduced a trap composed of 235 places in 314 ms of which 1 ms to minimize.
[2023-03-24 06:30:51] [INFO ] Deduced a trap composed of 231 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:30:51] [INFO ] Deduced a trap composed of 231 places in 323 ms of which 2 ms to minimize.
[2023-03-24 06:30:52] [INFO ] Deduced a trap composed of 243 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:30:52] [INFO ] Deduced a trap composed of 233 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:30:53] [INFO ] Deduced a trap composed of 237 places in 342 ms of which 1 ms to minimize.
[2023-03-24 06:30:53] [INFO ] Deduced a trap composed of 233 places in 329 ms of which 1 ms to minimize.
[2023-03-24 06:30:54] [INFO ] Deduced a trap composed of 227 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:30:54] [INFO ] Deduced a trap composed of 237 places in 347 ms of which 4 ms to minimize.
[2023-03-24 06:30:54] [INFO ] Deduced a trap composed of 239 places in 337 ms of which 1 ms to minimize.
[2023-03-24 06:30:55] [INFO ] Deduced a trap composed of 244 places in 313 ms of which 1 ms to minimize.
[2023-03-24 06:30:55] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 1 ms to minimize.
[2023-03-24 06:30:56] [INFO ] Deduced a trap composed of 234 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:30:56] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:30:57] [INFO ] Deduced a trap composed of 237 places in 314 ms of which 1 ms to minimize.
[2023-03-24 06:30:57] [INFO ] Deduced a trap composed of 241 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:30:57] [INFO ] Deduced a trap composed of 243 places in 319 ms of which 2 ms to minimize.
[2023-03-24 06:30:58] [INFO ] Deduced a trap composed of 241 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:30:58] [INFO ] Deduced a trap composed of 223 places in 312 ms of which 2 ms to minimize.
[2023-03-24 06:30:58] [INFO ] Deduced a trap composed of 236 places in 318 ms of which 4 ms to minimize.
[2023-03-24 06:30:59] [INFO ] Deduced a trap composed of 234 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:30:59] [INFO ] Deduced a trap composed of 234 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:31:00] [INFO ] Deduced a trap composed of 235 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:31:00] [INFO ] Deduced a trap composed of 233 places in 329 ms of which 0 ms to minimize.
[2023-03-24 06:31:01] [INFO ] Deduced a trap composed of 239 places in 348 ms of which 1 ms to minimize.
[2023-03-24 06:31:01] [INFO ] Deduced a trap composed of 228 places in 326 ms of which 0 ms to minimize.
[2023-03-24 06:31:01] [INFO ] Deduced a trap composed of 224 places in 320 ms of which 0 ms to minimize.
[2023-03-24 06:31:02] [INFO ] Deduced a trap composed of 241 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:31:03] [INFO ] Deduced a trap composed of 231 places in 330 ms of which 0 ms to minimize.
[2023-03-24 06:31:04] [INFO ] Deduced a trap composed of 232 places in 318 ms of which 0 ms to minimize.
[2023-03-24 06:31:04] [INFO ] Deduced a trap composed of 237 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:31:04] [INFO ] Deduced a trap composed of 227 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:31:05] [INFO ] Deduced a trap composed of 249 places in 341 ms of which 0 ms to minimize.
[2023-03-24 06:31:05] [INFO ] Deduced a trap composed of 233 places in 328 ms of which 1 ms to minimize.
[2023-03-24 06:31:06] [INFO ] Deduced a trap composed of 234 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:31:07] [INFO ] Deduced a trap composed of 235 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:31:07] [INFO ] Deduced a trap composed of 233 places in 318 ms of which 1 ms to minimize.
[2023-03-24 06:31:08] [INFO ] Deduced a trap composed of 235 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:31:08] [INFO ] Deduced a trap composed of 237 places in 322 ms of which 0 ms to minimize.
[2023-03-24 06:31:08] [INFO ] Deduced a trap composed of 227 places in 328 ms of which 0 ms to minimize.
[2023-03-24 06:31:09] [INFO ] Deduced a trap composed of 235 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:31:09] [INFO ] Deduced a trap composed of 241 places in 321 ms of which 0 ms to minimize.
[2023-03-24 06:31:11] [INFO ] Deduced a trap composed of 247 places in 317 ms of which 1 ms to minimize.
[2023-03-24 06:31:11] [INFO ] Deduced a trap composed of 235 places in 309 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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 06:31:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:31:11] [INFO ] After 25166ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1 real:1
Parikh walk visited 1 properties in 4 ms.
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 1252/1252 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 581 transition count 1251
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 580 transition count 1251
Applied a total of 2 rules in 68 ms. Remains 580 /581 variables (removed 1) and now considering 1251/1252 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 580/581 places, 1251/1252 transitions.
Incomplete random walk after 10000 steps, including 727 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 298560 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :{}
Probabilistic random walk after 298560 steps, saw 48863 distinct states, run finished after 3002 ms. (steps per millisecond=99 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 06:31:14] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-24 06:31:14] [INFO ] Computed 82 place invariants in 19 ms
[2023-03-24 06:31:14] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 06:31:14] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 31 ms returned sat
[2023-03-24 06:31:14] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:31:14] [INFO ] [Nat]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-24 06:31:14] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 23 ms returned sat
[2023-03-24 06:31:16] [INFO ] After 1140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:31:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:31:16] [INFO ] After 180ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 06:31:16] [INFO ] Deduced a trap composed of 139 places in 337 ms of which 0 ms to minimize.
[2023-03-24 06:31:17] [INFO ] Deduced a trap composed of 236 places in 332 ms of which 1 ms to minimize.
[2023-03-24 06:31:17] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:31:17] [INFO ] Deduced a trap composed of 241 places in 335 ms of which 0 ms to minimize.
[2023-03-24 06:31:18] [INFO ] Deduced a trap composed of 236 places in 330 ms of which 1 ms to minimize.
[2023-03-24 06:31:18] [INFO ] Deduced a trap composed of 230 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:31:19] [INFO ] Deduced a trap composed of 237 places in 327 ms of which 0 ms to minimize.
[2023-03-24 06:31:19] [INFO ] Deduced a trap composed of 212 places in 333 ms of which 1 ms to minimize.
[2023-03-24 06:31:19] [INFO ] Deduced a trap composed of 242 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:31:20] [INFO ] Deduced a trap composed of 256 places in 346 ms of which 0 ms to minimize.
[2023-03-24 06:31:21] [INFO ] Deduced a trap composed of 224 places in 313 ms of which 1 ms to minimize.
[2023-03-24 06:31:21] [INFO ] Deduced a trap composed of 228 places in 325 ms of which 0 ms to minimize.
[2023-03-24 06:31:22] [INFO ] Deduced a trap composed of 230 places in 339 ms of which 0 ms to minimize.
[2023-03-24 06:31:22] [INFO ] Deduced a trap composed of 237 places in 310 ms of which 0 ms to minimize.
[2023-03-24 06:31:23] [INFO ] Deduced a trap composed of 245 places in 306 ms of which 1 ms to minimize.
[2023-03-24 06:31:23] [INFO ] Deduced a trap composed of 231 places in 315 ms of which 0 ms to minimize.
[2023-03-24 06:31:23] [INFO ] Deduced a trap composed of 222 places in 313 ms of which 0 ms to minimize.
[2023-03-24 06:31:24] [INFO ] Deduced a trap composed of 239 places in 312 ms of which 0 ms to minimize.
[2023-03-24 06:31:24] [INFO ] Deduced a trap composed of 232 places in 311 ms of which 1 ms to minimize.
[2023-03-24 06:31:24] [INFO ] Deduced a trap composed of 234 places in 312 ms of which 1 ms to minimize.
[2023-03-24 06:31:25] [INFO ] Deduced a trap composed of 245 places in 306 ms of which 0 ms to minimize.
[2023-03-24 06:31:26] [INFO ] Deduced a trap composed of 236 places in 326 ms of which 1 ms to minimize.
[2023-03-24 06:31:26] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:31:27] [INFO ] Deduced a trap composed of 232 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:31:27] [INFO ] Deduced a trap composed of 230 places in 321 ms of which 1 ms to minimize.
[2023-03-24 06:31:28] [INFO ] Deduced a trap composed of 234 places in 325 ms of which 1 ms to minimize.
[2023-03-24 06:31:28] [INFO ] Deduced a trap composed of 230 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:31:29] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:31:30] [INFO ] Deduced a trap composed of 236 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:31:30] [INFO ] Deduced a trap composed of 228 places in 323 ms of which 1 ms to minimize.
[2023-03-24 06:31:30] [INFO ] Deduced a trap composed of 232 places in 327 ms of which 1 ms to minimize.
[2023-03-24 06:31:31] [INFO ] Deduced a trap composed of 232 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:31:31] [INFO ] Deduced a trap composed of 241 places in 322 ms of which 0 ms to minimize.
[2023-03-24 06:31:31] [INFO ] Deduced a trap composed of 231 places in 315 ms of which 1 ms to minimize.
[2023-03-24 06:31:32] [INFO ] Deduced a trap composed of 232 places in 321 ms of which 0 ms to minimize.
[2023-03-24 06:31:32] [INFO ] Deduced a trap composed of 234 places in 314 ms of which 1 ms to minimize.
[2023-03-24 06:31:33] [INFO ] Deduced a trap composed of 234 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:31:33] [INFO ] Deduced a trap composed of 230 places in 322 ms of which 1 ms to minimize.
[2023-03-24 06:31:33] [INFO ] Deduced a trap composed of 230 places in 347 ms of which 1 ms to minimize.
[2023-03-24 06:31:34] [INFO ] Deduced a trap composed of 241 places in 305 ms of which 1 ms to minimize.
[2023-03-24 06:31:34] [INFO ] Deduced a trap composed of 236 places in 319 ms of which 1 ms to minimize.
[2023-03-24 06:31:35] [INFO ] Deduced a trap composed of 226 places in 314 ms of which 0 ms to minimize.
[2023-03-24 06:31:36] [INFO ] Deduced a trap composed of 230 places in 305 ms of which 0 ms to minimize.
[2023-03-24 06:31:37] [INFO ] Deduced a trap composed of 228 places in 323 ms of which 0 ms to minimize.
[2023-03-24 06:31:37] [INFO ] Deduced a trap composed of 232 places in 311 ms of which 1 ms to minimize.
[2023-03-24 06:31:37] [INFO ] Deduced a trap composed of 226 places in 324 ms of which 1 ms to minimize.
[2023-03-24 06:31:38] [INFO ] Deduced a trap composed of 232 places in 308 ms of which 1 ms to minimize.
[2023-03-24 06:31:38] [INFO ] Deduced a trap composed of 230 places in 322 ms of which 0 ms to minimize.
[2023-03-24 06:31:38] [INFO ] Deduced a trap composed of 236 places in 313 ms of which 1 ms to minimize.
[2023-03-24 06:31:39] [INFO ] Deduced a trap composed of 228 places in 315 ms of which 0 ms to minimize.
[2023-03-24 06:31:39] [INFO ] Deduced a trap composed of 232 places in 320 ms of which 1 ms to minimize.
[2023-03-24 06:31:40] [INFO ] Deduced a trap composed of 230 places in 311 ms of which 0 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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-24 06:31:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 06:31:40] [INFO ] After 25212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 33 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 31 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-24 06:31:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:31:40] [INFO ] Invariant cache hit.
[2023-03-24 06:31:40] [INFO ] Implicit Places using invariants in 734 ms returned []
[2023-03-24 06:31:40] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:31:40] [INFO ] Invariant cache hit.
[2023-03-24 06:31:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 06:31:46] [INFO ] Implicit Places using invariants and state equation in 6096 ms returned []
Implicit Place search using SMT with State Equation took 6831 ms to find 0 implicit places.
[2023-03-24 06:31:47] [INFO ] Redundant transitions in 88 ms returned []
[2023-03-24 06:31:47] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-24 06:31:47] [INFO ] Invariant cache hit.
[2023-03-24 06:31:47] [INFO ] Dead Transitions using invariants and state equation in 732 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7690 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
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 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 134 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-24 06:31:47] [INFO ] Computed 82 place invariants in 22 ms
[2023-03-24 06:31:48] [INFO ] [Real]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-24 06:31:48] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-24 06:31:48] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 06:31:48] [INFO ] [Nat]Absence check using 62 positive place invariants in 12 ms returned sat
[2023-03-24 06:31:48] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-24 06:31:48] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 06:31:49] [INFO ] Deduced a trap composed of 232 places in 278 ms of which 1 ms to minimize.
[2023-03-24 06:31:49] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 1 ms to minimize.
[2023-03-24 06:31:49] [INFO ] Deduced a trap composed of 224 places in 305 ms of which 1 ms to minimize.
[2023-03-24 06:31:50] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-24 06:31:50] [INFO ] Deduced a trap composed of 234 places in 279 ms of which 1 ms to minimize.
[2023-03-24 06:31:50] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:31:51] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 1 ms to minimize.
[2023-03-24 06:31:51] [INFO ] Deduced a trap composed of 232 places in 273 ms of which 0 ms to minimize.
[2023-03-24 06:31:51] [INFO ] Deduced a trap composed of 224 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:31:52] [INFO ] Deduced a trap composed of 230 places in 275 ms of which 1 ms to minimize.
[2023-03-24 06:31:52] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 1 ms to minimize.
[2023-03-24 06:31:52] [INFO ] Deduced a trap composed of 220 places in 273 ms of which 0 ms to minimize.
[2023-03-24 06:31:53] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 1 ms to minimize.
[2023-03-24 06:31:53] [INFO ] Deduced a trap composed of 232 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:31:53] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 0 ms to minimize.
[2023-03-24 06:31:53] [INFO ] Deduced a trap composed of 230 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:31:54] [INFO ] Deduced a trap composed of 222 places in 275 ms of which 1 ms to minimize.
[2023-03-24 06:31:54] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:31:54] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 0 ms to minimize.
[2023-03-24 06:31:55] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 0 ms to minimize.
[2023-03-24 06:31:55] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-24 06:31:55] [INFO ] Deduced a trap composed of 234 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:31:56] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:31:56] [INFO ] Deduced a trap composed of 224 places in 271 ms of which 1 ms to minimize.
[2023-03-24 06:31:56] [INFO ] Deduced a trap composed of 236 places in 274 ms of which 0 ms to minimize.
[2023-03-24 06:31:57] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:31:57] [INFO ] Deduced a trap composed of 234 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:31:57] [INFO ] Deduced a trap composed of 232 places in 275 ms of which 1 ms to minimize.
[2023-03-24 06:31:58] [INFO ] Deduced a trap composed of 218 places in 271 ms of which 1 ms to minimize.
[2023-03-24 06:31:58] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:31:58] [INFO ] Deduced a trap composed of 248 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:31:59] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:31:59] [INFO ] Deduced a trap composed of 240 places in 303 ms of which 0 ms to minimize.
[2023-03-24 06:31:59] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 0 ms to minimize.
[2023-03-24 06:32:00] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:32:01] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 0 ms to minimize.
[2023-03-24 06:32:01] [INFO ] Deduced a trap composed of 224 places in 276 ms of which 1 ms to minimize.
[2023-03-24 06:32:02] [INFO ] Deduced a trap composed of 218 places in 274 ms of which 1 ms to minimize.
[2023-03-24 06:32:02] [INFO ] Deduced a trap composed of 230 places in 272 ms of which 0 ms to minimize.
[2023-03-24 06:32:02] [INFO ] Deduced a trap composed of 228 places in 278 ms of which 0 ms to minimize.
[2023-03-24 06:32:03] [INFO ] Deduced a trap composed of 221 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:32:03] [INFO ] Deduced a trap composed of 233 places in 275 ms of which 0 ms to minimize.
[2023-03-24 06:32:03] [INFO ] Deduced a trap composed of 224 places in 273 ms of which 0 ms to minimize.
[2023-03-24 06:32:04] [INFO ] Deduced a trap composed of 233 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:32:06] [INFO ] Deduced a trap composed of 226 places in 267 ms of which 0 ms to minimize.
[2023-03-24 06:32:06] [INFO ] Deduced a trap composed of 220 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:32:06] [INFO ] Deduced a trap composed of 230 places in 271 ms of which 1 ms to minimize.
[2023-03-24 06:32:07] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 1 ms to minimize.
[2023-03-24 06:32:07] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 0 ms to minimize.
[2023-03-24 06:32:08] [INFO ] Deduced a trap composed of 224 places in 275 ms of which 0 ms to minimize.
[2023-03-24 06:32:08] [INFO ] Deduced a trap composed of 255 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:32:08] [INFO ] Deduced a trap composed of 238 places in 279 ms of which 0 ms to minimize.
[2023-03-24 06:32:09] [INFO ] Deduced a trap composed of 214 places in 276 ms of which 1 ms to minimize.
[2023-03-24 06:32:09] [INFO ] Deduced a trap composed of 254 places in 281 ms of which 1 ms to minimize.
[2023-03-24 06:32:10] [INFO ] Deduced a trap composed of 229 places in 270 ms of which 1 ms to minimize.
[2023-03-24 06:32:10] [INFO ] Deduced a trap composed of 224 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:32:10] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 1 ms to minimize.
[2023-03-24 06:32:11] [INFO ] Deduced a trap composed of 249 places in 265 ms of which 1 ms to minimize.
[2023-03-24 06:32:11] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:32:11] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 0 ms to minimize.
[2023-03-24 06:32:12] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 1 ms to minimize.
[2023-03-24 06:32:12] [INFO ] Deduced a trap composed of 230 places in 260 ms of which 0 ms to minimize.
[2023-03-24 06:32:12] [INFO ] Deduced a trap composed of 218 places in 264 ms of which 1 ms to minimize.
[2023-03-24 06:32:13] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 0 ms to minimize.
[2023-03-24 06:32:13] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-24 06:32:14] [INFO ] Deduced a trap composed of 228 places in 282 ms of which 1 ms to minimize.
[2023-03-24 06:32:14] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 0 ms to minimize.
[2023-03-24 06:32:14] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-24 06:32:15] [INFO ] Deduced a trap composed of 242 places in 281 ms of which 1 ms to minimize.
[2023-03-24 06:32:15] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 0 ms to minimize.
[2023-03-24 06:32:15] [INFO ] Deduced a trap composed of 240 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:32:16] [INFO ] Deduced a trap composed of 222 places in 306 ms of which 1 ms to minimize.
[2023-03-24 06:32:16] [INFO ] Deduced a trap composed of 224 places in 289 ms of which 0 ms to minimize.
[2023-03-24 06:32:17] [INFO ] Deduced a trap composed of 223 places in 288 ms of which 0 ms to minimize.
[2023-03-24 06:32:17] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 0 ms to minimize.
[2023-03-24 06:32:17] [INFO ] Deduced a trap composed of 237 places in 280 ms of which 0 ms to minimize.
[2023-03-24 06:32:18] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 1 ms to minimize.
[2023-03-24 06:32:18] [INFO ] Deduced a trap composed of 228 places in 279 ms of which 0 ms to minimize.
[2023-03-24 06:32:18] [INFO ] Deduced a trap composed of 232 places in 291 ms of which 0 ms to minimize.
[2023-03-24 06:32:19] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 1 ms to minimize.
[2023-03-24 06:32:19] [INFO ] Deduced a trap composed of 227 places in 282 ms of which 0 ms to minimize.
[2023-03-24 06:32:19] [INFO ] Deduced a trap composed of 226 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:32:19] [INFO ] Deduced a trap composed of 237 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:32:20] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 1 ms to minimize.
[2023-03-24 06:32:20] [INFO ] Deduced a trap composed of 224 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:32:20] [INFO ] Deduced a trap composed of 228 places in 273 ms of which 0 ms to minimize.
[2023-03-24 06:32:21] [INFO ] Deduced a trap composed of 234 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:32:21] [INFO ] Deduced a trap composed of 230 places in 279 ms of which 2 ms to minimize.
[2023-03-24 06:32:21] [INFO ] Deduced a trap composed of 227 places in 284 ms of which 0 ms to minimize.
[2023-03-24 06:32:22] [INFO ] Deduced a trap composed of 230 places in 273 ms of which 1 ms to minimize.
[2023-03-24 06:32:22] [INFO ] Deduced a trap composed of 225 places in 278 ms of which 1 ms to minimize.
[2023-03-24 06:32:22] [INFO ] Deduced a trap composed of 226 places in 270 ms of which 1 ms to minimize.
[2023-03-24 06:32:23] [INFO ] Deduced a trap composed of 230 places in 266 ms of which 1 ms to minimize.
[2023-03-24 06:32:23] [INFO ] Deduced a trap composed of 232 places in 302 ms of which 1 ms to minimize.
[2023-03-24 06:32:23] [INFO ] Deduced a trap composed of 222 places in 281 ms of which 1 ms to minimize.
[2023-03-24 06:32:24] [INFO ] Deduced a trap composed of 235 places in 282 ms of which 0 ms to minimize.
[2023-03-24 06:32:24] [INFO ] Deduced a trap composed of 240 places in 272 ms of which 0 ms to minimize.
[2023-03-24 06:32:25] [INFO ] Deduced a trap composed of 234 places in 281 ms of which 0 ms to minimize.
[2023-03-24 06:32:25] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 0 ms to minimize.
[2023-03-24 06:32:26] [INFO ] Deduced a trap composed of 227 places in 266 ms of which 0 ms to minimize.
[2023-03-24 06:32:26] [INFO ] Deduced a trap composed of 230 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:32:27] [INFO ] Deduced a trap composed of 236 places in 285 ms of which 0 ms to minimize.
[2023-03-24 06:32:27] [INFO ] Deduced a trap composed of 240 places in 276 ms of which 0 ms to minimize.
[2023-03-24 06:32:28] [INFO ] Deduced a trap composed of 220 places in 286 ms of which 0 ms to minimize.
[2023-03-24 06:32:28] [INFO ] Deduced a trap composed of 224 places in 291 ms of which 1 ms to minimize.
[2023-03-24 06:32:28] [INFO ] Deduced a trap composed of 226 places in 279 ms of which 0 ms to minimize.
[2023-03-24 06:32:29] [INFO ] Deduced a trap composed of 240 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:32:29] [INFO ] Deduced a trap composed of 226 places in 291 ms of which 0 ms to minimize.
[2023-03-24 06:32:29] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 1 ms to minimize.
[2023-03-24 06:32:30] [INFO ] Deduced a trap composed of 226 places in 280 ms of which 1 ms to minimize.
[2023-03-24 06:32:30] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 1 ms to minimize.
[2023-03-24 06:32:30] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 3 ms to minimize.
[2023-03-24 06:32:31] [INFO ] Deduced a trap composed of 232 places in 277 ms of which 1 ms to minimize.
[2023-03-24 06:32:31] [INFO ] Deduced a trap composed of 228 places in 287 ms of which 2 ms to minimize.
[2023-03-24 06:32:31] [INFO ] Deduced a trap composed of 230 places in 282 ms of which 1 ms to minimize.
[2023-03-24 06:32:32] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 0 ms to minimize.
[2023-03-24 06:32:32] [INFO ] Deduced a trap composed of 226 places in 286 ms of which 1 ms to minimize.
[2023-03-24 06:32:33] [INFO ] Deduced a trap composed of 234 places in 270 ms of which 1 ms to minimize.
[2023-03-24 06:32:33] [INFO ] Deduced a trap composed of 238 places in 283 ms of which 0 ms to minimize.
[2023-03-24 06:32:42] [INFO ] Trap strengthening (SAT) tested/added 119/119 trap constraints in 53678 ms
[2023-03-24 06:32:42] [INFO ] After 54408ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 06:32:42] [INFO ] After 54538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 06:32:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-24 06:32:42] [INFO ] Flatten gal took : 125 ms
[2023-03-24 06:32:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-24 06:32:43] [INFO ] Flatten gal took : 170 ms
[2023-03-24 06:32:44] [INFO ] Input system was already deterministic with 1325 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 72 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 100 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-24 06:32:44] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-24 06:32:44] [INFO ] Computed 82 place invariants in 17 ms
[2023-03-24 06:32:45] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 958 ms. Remains : 582/664 places, 1253/1325 transitions.
[2023-03-24 06:32:45] [INFO ] Flatten gal took : 69 ms
[2023-03-24 06:32:45] [INFO ] Flatten gal took : 77 ms
[2023-03-24 06:32:45] [INFO ] Input system was already deterministic with 1253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 26 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:45] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 06:32:45] [INFO ] Computed 82 place invariants in 42 ms
[2023-03-24 06:32:46] [INFO ] Dead Transitions using invariants and state equation in 1306 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:46] [INFO ] Flatten gal took : 69 ms
[2023-03-24 06:32:46] [INFO ] Flatten gal took : 76 ms
[2023-03-24 06:32:47] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 663 transition count 1324
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 663 transition count 1324
Applied a total of 2 rules in 18 ms. Remains 663 /664 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 663 cols
[2023-03-24 06:32:47] [INFO ] Computed 92 place invariants in 17 ms
[2023-03-24 06:32:48] [INFO ] Dead Transitions using invariants and state equation in 1302 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1322 ms. Remains : 663/664 places, 1324/1325 transitions.
[2023-03-24 06:32:48] [INFO ] Flatten gal took : 57 ms
[2023-03-24 06:32:48] [INFO ] Flatten gal took : 62 ms
[2023-03-24 06:32:48] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 26 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 06:32:48] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-24 06:32:49] [INFO ] Dead Transitions using invariants and state equation in 1298 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1327 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:50] [INFO ] Flatten gal took : 53 ms
[2023-03-24 06:32:50] [INFO ] Flatten gal took : 55 ms
[2023-03-24 06:32:50] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:50] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:32:50] [INFO ] Invariant cache hit.
[2023-03-24 06:32:51] [INFO ] Dead Transitions using invariants and state equation in 1205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1232 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:51] [INFO ] Flatten gal took : 61 ms
[2023-03-24 06:32:51] [INFO ] Flatten gal took : 72 ms
[2023-03-24 06:32:51] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 20 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:51] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:32:51] [INFO ] Invariant cache hit.
[2023-03-24 06:32:52] [INFO ] Dead Transitions using invariants and state equation in 1204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1226 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:53] [INFO ] Flatten gal took : 55 ms
[2023-03-24 06:32:53] [INFO ] Flatten gal took : 59 ms
[2023-03-24 06:32:53] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Applied a total of 0 rules in 5 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
[2023-03-24 06:32:53] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-24 06:32:53] [INFO ] Computed 92 place invariants in 23 ms
[2023-03-24 06:32:54] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 664/664 places, 1325/1325 transitions.
[2023-03-24 06:32:54] [INFO ] Flatten gal took : 56 ms
[2023-03-24 06:32:54] [INFO ] Flatten gal took : 62 ms
[2023-03-24 06:32:54] [INFO ] Input system was already deterministic with 1325 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 13 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-24 06:32:54] [INFO ] Computed 82 place invariants in 36 ms
[2023-03-24 06:32:56] [INFO ] Dead Transitions using invariants and state equation in 1275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1289 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:56] [INFO ] Flatten gal took : 63 ms
[2023-03-24 06:32:56] [INFO ] Flatten gal took : 73 ms
[2023-03-24 06:32:56] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:56] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:32:56] [INFO ] Invariant cache hit.
[2023-03-24 06:32:57] [INFO ] Dead Transitions using invariants and state equation in 1215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:57] [INFO ] Flatten gal took : 55 ms
[2023-03-24 06:32:57] [INFO ] Flatten gal took : 57 ms
[2023-03-24 06:32:57] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:57] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:32:57] [INFO ] Invariant cache hit.
[2023-03-24 06:32:59] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1223 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:32:59] [INFO ] Flatten gal took : 54 ms
[2023-03-24 06:32:59] [INFO ] Flatten gal took : 57 ms
[2023-03-24 06:32:59] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:32:59] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:32:59] [INFO ] Invariant cache hit.
[2023-03-24 06:33:00] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1240 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:33:00] [INFO ] Flatten gal took : 53 ms
[2023-03-24 06:33:00] [INFO ] Flatten gal took : 56 ms
[2023-03-24 06:33:00] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 24 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:33:00] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:33:00] [INFO ] Invariant cache hit.
[2023-03-24 06:33:01] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1226 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:33:02] [INFO ] Flatten gal took : 69 ms
[2023-03-24 06:33:02] [INFO ] Flatten gal took : 55 ms
[2023-03-24 06:33:02] [INFO ] Input system was already deterministic with 1324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-24 06:33:02] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-24 06:33:02] [INFO ] Invariant cache hit.
[2023-03-24 06:33:03] [INFO ] Dead Transitions using invariants and state equation in 1207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1232 ms. Remains : 653/664 places, 1324/1325 transitions.
[2023-03-24 06:33:03] [INFO ] Flatten gal took : 53 ms
[2023-03-24 06:33:03] [INFO ] Flatten gal took : 56 ms
[2023-03-24 06:33:03] [INFO ] Input system was already deterministic with 1324 transitions.
[2023-03-24 06:33:03] [INFO ] Flatten gal took : 110 ms
[2023-03-24 06:33:04] [INFO ] Flatten gal took : 127 ms
[2023-03-24 06:33:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 35 ms.
[2023-03-24 06:33:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 8 ms.
Total runtime 177359 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/1365/ctl_0_ --ctl=/tmp/1365/ctl_1_ --ctl=/tmp/1365/ctl_2_ --ctl=/tmp/1365/ctl_3_ --ctl=/tmp/1365/ctl_4_ --ctl=/tmp/1365/ctl_5_ --ctl=/tmp/1365/ctl_6_ --ctl=/tmp/1365/ctl_7_ --ctl=/tmp/1365/ctl_8_ --ctl=/tmp/1365/ctl_9_ --ctl=/tmp/1365/ctl_10_ --ctl=/tmp/1365/ctl_11_ --ctl=/tmp/1365/ctl_12_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14863532 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16072024 kB

BK_TIME_CONFINEMENT_REACHED

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PolyORBNT-PT-S10J30, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950900762"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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