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.r393-oct2-167903717100479.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ShieldPPPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717100479
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 5.8K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 01:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 528K 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 ShieldPPPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679452654322

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:37:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:37:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:37:37] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-22 02:37:37] [INFO ] Transformed 2043 places.
[2023-03-22 02:37:37] [INFO ] Transformed 1893 transitions.
[2023-03-22 02:37:37] [INFO ] Found NUPN structural information;
[2023-03-22 02:37:37] [INFO ] Parsed PT model containing 2043 places and 1893 transitions and 5226 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1893 rows 2043 cols
[2023-03-22 02:37:38] [INFO ] Computed 331 place invariants in 24 ms
[2023-03-22 02:37:39] [INFO ] [Real]Absence check using 331 positive place invariants in 192 ms returned sat
[2023-03-22 02:37:39] [INFO ] After 1204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 02:37:40] [INFO ] [Nat]Absence check using 331 positive place invariants in 234 ms returned sat
[2023-03-22 02:37:45] [INFO ] After 4593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 02:37:46] [INFO ] Deduced a trap composed of 24 places in 916 ms of which 12 ms to minimize.
[2023-03-22 02:37:47] [INFO ] Deduced a trap composed of 23 places in 746 ms of which 3 ms to minimize.
[2023-03-22 02:37:48] [INFO ] Deduced a trap composed of 18 places in 852 ms of which 23 ms to minimize.
[2023-03-22 02:37:49] [INFO ] Deduced a trap composed of 23 places in 642 ms of which 1 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 21 places in 753 ms of which 25 ms to minimize.
[2023-03-22 02:37:50] [INFO ] Deduced a trap composed of 30 places in 609 ms of which 1 ms to minimize.
[2023-03-22 02:37:51] [INFO ] Deduced a trap composed of 24 places in 731 ms of which 14 ms to minimize.
[2023-03-22 02:37:52] [INFO ] Deduced a trap composed of 31 places in 633 ms of which 1 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 14 places in 632 ms of which 14 ms to minimize.
[2023-03-22 02:37:53] [INFO ] Deduced a trap composed of 38 places in 584 ms of which 2 ms to minimize.
[2023-03-22 02:37:54] [INFO ] Deduced a trap composed of 27 places in 634 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 23 places in 682 ms of which 1 ms to minimize.
[2023-03-22 02:37:55] [INFO ] Deduced a trap composed of 24 places in 642 ms of which 2 ms to minimize.
[2023-03-22 02:37:56] [INFO ] Deduced a trap composed of 28 places in 571 ms of which 2 ms to minimize.
[2023-03-22 02:37:57] [INFO ] Deduced a trap composed of 32 places in 757 ms of which 2 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 19 places in 554 ms of which 2 ms to minimize.
[2023-03-22 02:37:58] [INFO ] Deduced a trap composed of 20 places in 534 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 14 places in 477 ms of which 1 ms to minimize.
[2023-03-22 02:37:59] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
[2023-03-22 02:38:00] [INFO ] Deduced a trap composed of 30 places in 415 ms of which 1 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 19 places in 734 ms of which 2 ms to minimize.
[2023-03-22 02:38:01] [INFO ] Deduced a trap composed of 31 places in 386 ms of which 1 ms to minimize.
[2023-03-22 02:38:02] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 1 ms to minimize.
[2023-03-22 02:38:02] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 2 ms to minimize.
[2023-03-22 02:38:03] [INFO ] Deduced a trap composed of 19 places in 597 ms of which 1 ms to minimize.
[2023-03-22 02:38:03] [INFO ] Deduced a trap composed of 42 places in 467 ms of which 1 ms to minimize.
[2023-03-22 02:38:04] [INFO ] Deduced a trap composed of 21 places in 681 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.Application.startNoEx(Application.java:902)
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-22 02:38:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:38:04] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 653 ms.
Support contains 202 out of 2043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Drop transitions removed 158 transitions
Trivial Post-agglo rules discarded 158 transitions
Performed 158 trivial Post agglomeration. Transition count delta: 158
Iterating post reduction 0 with 158 rules applied. Total rules applied 158 place count 2043 transition count 1735
Reduce places removed 158 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 172 rules applied. Total rules applied 330 place count 1885 transition count 1721
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 344 place count 1871 transition count 1721
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 344 place count 1871 transition count 1574
Deduced a syphon composed of 147 places in 4 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 638 place count 1724 transition count 1574
Discarding 163 places :
Symmetric choice reduction at 3 with 163 rule applications. Total rules 801 place count 1561 transition count 1411
Iterating global reduction 3 with 163 rules applied. Total rules applied 964 place count 1561 transition count 1411
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 964 place count 1561 transition count 1355
Deduced a syphon composed of 56 places in 7 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1076 place count 1505 transition count 1355
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 3 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 3 with 754 rules applied. Total rules applied 1830 place count 1128 transition count 978
Partial Free-agglomeration rule applied 196 times.
Drop transitions removed 196 transitions
Iterating global reduction 3 with 196 rules applied. Total rules applied 2026 place count 1128 transition count 978
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2027 place count 1127 transition count 977
Applied a total of 2027 rules in 651 ms. Remains 1127 /2043 variables (removed 916) and now considering 977/1893 (removed 916) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 1127/2043 places, 977/1893 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 9) seen :6
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 977 rows 1127 cols
[2023-03-22 02:38:06] [INFO ] Computed 331 place invariants in 16 ms
[2023-03-22 02:38:06] [INFO ] [Real]Absence check using 322 positive place invariants in 93 ms returned sat
[2023-03-22 02:38:06] [INFO ] [Real]Absence check using 322 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-22 02:38:06] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:38:06] [INFO ] [Nat]Absence check using 322 positive place invariants in 130 ms returned sat
[2023-03-22 02:38:06] [INFO ] [Nat]Absence check using 322 positive and 9 generalized place invariants in 3 ms returned sat
[2023-03-22 02:38:08] [INFO ] After 1274ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2023-03-22 02:38:08] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2023-03-22 02:38:09] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 0 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 6 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 22 places in 194 ms of which 0 ms to minimize.
[2023-03-22 02:38:10] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 0 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 14 places in 270 ms of which 0 ms to minimize.
[2023-03-22 02:38:11] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 14 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2023-03-22 02:38:12] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 1 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2023-03-22 02:38:13] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 1 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 0 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 17 places in 279 ms of which 0 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2023-03-22 02:38:14] [INFO ] Deduced a trap composed of 17 places in 216 ms of which 3 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2023-03-22 02:38:15] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 0 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 19 places in 385 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-22 02:38:16] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 0 ms to minimize.
[2023-03-22 02:38:17] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 14 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 0 ms to minimize.
[2023-03-22 02:38:18] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 1 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 14 places in 155 ms of which 4 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 10 ms to minimize.
[2023-03-22 02:38:19] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 2 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 14 places in 238 ms of which 0 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 1 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 0 ms to minimize.
[2023-03-22 02:38:20] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 0 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 1 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 0 ms to minimize.
[2023-03-22 02:38:21] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 2 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 18 places in 150 ms of which 1 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 0 ms to minimize.
[2023-03-22 02:38:22] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 1 ms to minimize.
[2023-03-22 02:38:23] [INFO ] Trap strengthening (SAT) tested/added 57/56 trap constraints in 14656 ms
[2023-03-22 02:38:23] [INFO ] Deduced a trap composed of 8 places in 152 ms of which 1 ms to minimize.
[2023-03-22 02:38:23] [INFO ] Deduced a trap composed of 7 places in 147 ms of which 0 ms to minimize.
[2023-03-22 02:38:23] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2023-03-22 02:38:23] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 0 ms to minimize.
[2023-03-22 02:38:24] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2023-03-22 02:38:25] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 0 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2023-03-22 02:38:26] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 3443 ms
[2023-03-22 02:38:27] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 1 ms to minimize.
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 1 ms to minimize.
[2023-03-22 02:38:28] [INFO ] Deduced a trap composed of 18 places in 186 ms of which 0 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 14 places in 121 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2023-03-22 02:38:29] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 0 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 18 places in 198 ms of which 1 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 16 places in 250 ms of which 19 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2023-03-22 02:38:30] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 1 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 0 ms to minimize.
[2023-03-22 02:38:31] [INFO ] Deduced a trap composed of 15 places in 111 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.Application.startNoEx(Application.java:902)
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-22 02:38:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 02:38:31] [INFO ] After 25109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 58 ms.
Support contains 106 out of 1127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1127/1127 places, 977/977 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1127 transition count 968
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1118 transition count 968
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 18 place count 1118 transition count 961
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 32 place count 1111 transition count 961
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 1110 transition count 960
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 1110 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 1110 transition count 959
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 1109 transition count 959
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 172 place count 1041 transition count 891
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 203 place count 1041 transition count 891
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 206 place count 1038 transition count 888
Applied a total of 206 rules in 341 ms. Remains 1038 /1127 variables (removed 89) and now considering 888/977 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 342 ms. Remains : 1038/1127 places, 888/977 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 105529 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105529 steps, saw 98141 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 888 rows 1038 cols
[2023-03-22 02:38:35] [INFO ] Computed 331 place invariants in 10 ms
[2023-03-22 02:38:35] [INFO ] [Real]Absence check using 319 positive place invariants in 85 ms returned sat
[2023-03-22 02:38:35] [INFO ] [Real]Absence check using 319 positive and 12 generalized place invariants in 46 ms returned sat
[2023-03-22 02:38:35] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:38:36] [INFO ] [Nat]Absence check using 319 positive place invariants in 49 ms returned sat
[2023-03-22 02:38:36] [INFO ] [Nat]Absence check using 319 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-22 02:38:38] [INFO ] After 2048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 5 places in 251 ms of which 1 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 7 places in 211 ms of which 0 ms to minimize.
[2023-03-22 02:38:38] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-22 02:38:39] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 0 ms to minimize.
[2023-03-22 02:38:40] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 7 places in 266 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2023-03-22 02:38:41] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 10 places in 182 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-22 02:38:42] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 1 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-22 02:38:43] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 0 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 8 places in 238 ms of which 1 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 0 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 0 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-22 02:38:44] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 0 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 9 places in 177 ms of which 0 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 0 ms to minimize.
[2023-03-22 02:38:45] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 1 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 12 places in 178 ms of which 1 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 1 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8164 ms
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2023-03-22 02:38:46] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 1 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 6 places in 142 ms of which 0 ms to minimize.
[2023-03-22 02:38:47] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 0 ms to minimize.
[2023-03-22 02:38:48] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 10 places in 112 ms of which 0 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 0 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 0 ms to minimize.
[2023-03-22 02:38:49] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 10 places in 173 ms of which 0 ms to minimize.
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 0 ms to minimize.
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 0 ms to minimize.
[2023-03-22 02:38:50] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 7 places in 150 ms of which 0 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2023-03-22 02:38:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 5381 ms
[2023-03-22 02:38:53] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2023-03-22 02:38:53] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 0 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 0 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-22 02:38:54] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 0 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 1 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2023-03-22 02:38:55] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-22 02:38:56] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 0 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
[2023-03-22 02:38:57] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 1 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 0 ms to minimize.
[2023-03-22 02:38:58] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 5292 ms
[2023-03-22 02:38:58] [INFO ] After 22594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1340 ms.
[2023-03-22 02:39:00] [INFO ] After 24260ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 61 ms.
Support contains 106 out of 1038 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 888/888 transitions.
Applied a total of 0 rules in 28 ms. Remains 1038 /1038 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1038/1038 places, 888/888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1038/1038 places, 888/888 transitions.
Applied a total of 0 rules in 26 ms. Remains 1038 /1038 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2023-03-22 02:39:00] [INFO ] Invariant cache hit.
[2023-03-22 02:39:00] [INFO ] Implicit Places using invariants in 622 ms returned []
[2023-03-22 02:39:00] [INFO ] Invariant cache hit.
[2023-03-22 02:39:02] [INFO ] Implicit Places using invariants and state equation in 1952 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
[2023-03-22 02:39:02] [INFO ] Redundant transitions in 70 ms returned []
[2023-03-22 02:39:02] [INFO ] Invariant cache hit.
[2023-03-22 02:39:03] [INFO ] Dead Transitions using invariants and state equation in 492 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3205 ms. Remains : 1038/1038 places, 888/888 transitions.
Applied a total of 0 rules in 24 ms. Remains 1038 /1038 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-22 02:39:03] [INFO ] Invariant cache hit.
[2023-03-22 02:39:03] [INFO ] [Real]Absence check using 319 positive place invariants in 64 ms returned sat
[2023-03-22 02:39:03] [INFO ] [Real]Absence check using 319 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-22 02:39:03] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:39:03] [INFO ] [Nat]Absence check using 319 positive place invariants in 118 ms returned sat
[2023-03-22 02:39:04] [INFO ] [Nat]Absence check using 319 positive and 12 generalized place invariants in 6 ms returned sat
[2023-03-22 02:39:05] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 1 ms to minimize.
[2023-03-22 02:39:05] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 8 places in 177 ms of which 1 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 0 ms to minimize.
[2023-03-22 02:39:06] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 1 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2023-03-22 02:39:07] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 0 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 1 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 7 places in 197 ms of which 0 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2023-03-22 02:39:08] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 7 places in 144 ms of which 0 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 4 ms to minimize.
[2023-03-22 02:39:09] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 0 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-22 02:39:10] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 0 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 0 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 0 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 1 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2023-03-22 02:39:11] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 6793 ms
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 0 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2023-03-22 02:39:12] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-22 02:39:13] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 10 ms to minimize.
[2023-03-22 02:39:13] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-03-22 02:39:13] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2023-03-22 02:39:13] [INFO ] Deduced a trap composed of 8 places in 236 ms of which 1 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 14 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 13 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2023-03-22 02:39:14] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 02:39:15] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 0 ms to minimize.
[2023-03-22 02:39:15] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 1 ms to minimize.
[2023-03-22 02:39:15] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3316 ms
[2023-03-22 02:39:17] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2023-03-22 02:39:17] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 0 ms to minimize.
[2023-03-22 02:39:17] [INFO ] Deduced a trap composed of 8 places in 147 ms of which 0 ms to minimize.
[2023-03-22 02:39:17] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2023-03-22 02:39:18] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2023-03-22 02:39:18] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 0 ms to minimize.
[2023-03-22 02:39:18] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2023-03-22 02:39:18] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 0 ms to minimize.
[2023-03-22 02:39:19] [INFO ] Deduced a trap composed of 10 places in 118 ms of which 1 ms to minimize.
[2023-03-22 02:39:19] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 7 ms to minimize.
[2023-03-22 02:39:19] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2023-03-22 02:39:19] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2023-03-22 02:39:20] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-22 02:39:20] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2023-03-22 02:39:20] [INFO ] Deduced a trap composed of 7 places in 202 ms of which 1 ms to minimize.
[2023-03-22 02:39:20] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2023-03-22 02:39:20] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-22 02:39:21] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2023-03-22 02:39:21] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
[2023-03-22 02:39:21] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2023-03-22 02:39:21] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-22 02:39:21] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2023-03-22 02:39:22] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2023-03-22 02:39:22] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 0 ms to minimize.
[2023-03-22 02:39:22] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-22 02:39:22] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-22 02:39:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-22 02:39:24] [INFO ] Deduced a trap composed of 10 places in 521 ms of which 2 ms to minimize.
[2023-03-22 02:39:24] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2023-03-22 02:39:24] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 7831 ms
[2023-03-22 02:39:24] [INFO ] After 20703ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2074 ms.
[2023-03-22 02:39:26] [INFO ] After 23213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 02:39:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-22 02:39:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1038 places, 888 transitions and 3766 arcs took 8 ms.
[2023-03-22 02:39:27] [INFO ] Flatten gal took : 205 ms
Total runtime 110653 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 --inv-bin-par --invariant=/tmp/1444/inv_0_ --invariant=/tmp/1444/inv_1_ --invariant=/tmp/1444/inv_2_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11223796 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097568 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="ShieldPPPs-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldPPPs-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717100479"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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