fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903715400511
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldPPPs-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1620.712 118215.00 165370.00 70.30 TFTFFFTFFTTTTTFT normal

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.r391-oct2-167903715400511.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 lolaxred
Input is ShieldPPPs-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.2K Feb 26 01:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 01:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 01:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 888K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679277375372

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=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:56:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 01:56:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:56:18] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-20 01:56:18] [INFO ] Transformed 3403 places.
[2023-03-20 01:56:18] [INFO ] Transformed 3153 transitions.
[2023-03-20 01:56:18] [INFO ] Found NUPN structural information;
[2023-03-20 01:56:18] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 453 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 500 ms. (steps per millisecond=20 ) properties (out of 16) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-00 TRUE 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 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) 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 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 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2023-03-20 01:56:19] [INFO ] Computed 551 place invariants in 32 ms
[2023-03-20 01:56:21] [INFO ] [Real]Absence check using 551 positive place invariants in 569 ms returned sat
[2023-03-20 01:56:21] [INFO ] After 1972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 01:56:23] [INFO ] [Nat]Absence check using 551 positive place invariants in 337 ms returned sat
[2023-03-20 01:56:30] [INFO ] After 6382ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 01:56:31] [INFO ] Deduced a trap composed of 29 places in 1487 ms of which 13 ms to minimize.
[2023-03-20 01:56:33] [INFO ] Deduced a trap composed of 28 places in 1487 ms of which 27 ms to minimize.
[2023-03-20 01:56:34] [INFO ] Deduced a trap composed of 23 places in 1268 ms of which 6 ms to minimize.
[2023-03-20 01:56:36] [INFO ] Deduced a trap composed of 33 places in 1087 ms of which 16 ms to minimize.
[2023-03-20 01:56:37] [INFO ] Deduced a trap composed of 25 places in 1125 ms of which 16 ms to minimize.
[2023-03-20 01:56:38] [INFO ] Deduced a trap composed of 17 places in 1220 ms of which 2 ms to minimize.
[2023-03-20 01:56:40] [INFO ] Deduced a trap composed of 26 places in 1198 ms of which 4 ms to minimize.
[2023-03-20 01:56:41] [INFO ] Deduced a trap composed of 22 places in 1288 ms of which 5 ms to minimize.
[2023-03-20 01:56:42] [INFO ] Deduced a trap composed of 24 places in 1223 ms of which 7 ms to minimize.
[2023-03-20 01:56:44] [INFO ] Deduced a trap composed of 28 places in 1218 ms of which 2 ms to minimize.
[2023-03-20 01:56:45] [INFO ] Deduced a trap composed of 42 places in 1155 ms of which 2 ms to minimize.
[2023-03-20 01:56:47] [INFO ] Deduced a trap composed of 39 places in 1374 ms of which 2 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-20 01:56:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:56:47] [INFO ] After 25622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1693 ms.
Support contains 116 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 322 transitions
Trivial Post-agglo rules discarded 322 transitions
Performed 322 trivial Post agglomeration. Transition count delta: 322
Iterating post reduction 0 with 322 rules applied. Total rules applied 322 place count 3403 transition count 2831
Reduce places removed 322 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 328 rules applied. Total rules applied 650 place count 3081 transition count 2825
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 656 place count 3075 transition count 2825
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 248 Pre rules applied. Total rules applied 656 place count 3075 transition count 2577
Deduced a syphon composed of 248 places in 10 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 3 with 496 rules applied. Total rules applied 1152 place count 2827 transition count 2577
Discarding 333 places :
Symmetric choice reduction at 3 with 333 rule applications. Total rules 1485 place count 2494 transition count 2244
Iterating global reduction 3 with 333 rules applied. Total rules applied 1818 place count 2494 transition count 2244
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 126 Pre rules applied. Total rules applied 1818 place count 2494 transition count 2118
Deduced a syphon composed of 126 places in 15 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 2070 place count 2368 transition count 2118
Performed 692 Post agglomeration using F-continuation condition.Transition count delta: 692
Deduced a syphon composed of 692 places in 11 ms
Reduce places removed 692 places and 0 transitions.
Iterating global reduction 3 with 1384 rules applied. Total rules applied 3454 place count 1676 transition count 1426
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 417 times.
Drop transitions removed 417 transitions
Iterating global reduction 3 with 417 rules applied. Total rules applied 3871 place count 1676 transition count 1426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3872 place count 1675 transition count 1425
Applied a total of 3872 rules in 1355 ms. Remains 1675 /3403 variables (removed 1728) and now considering 1425/3153 (removed 1728) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1355 ms. Remains : 1675/3403 places, 1425/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 9) seen :7
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1425 rows 1675 cols
[2023-03-20 01:56:50] [INFO ] Computed 551 place invariants in 55 ms
[2023-03-20 01:56:51] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:56:51] [INFO ] [Nat]Absence check using 533 positive place invariants in 132 ms returned sat
[2023-03-20 01:56:51] [INFO ] [Nat]Absence check using 533 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-20 01:56:52] [INFO ] After 1193ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:56:53] [INFO ] Deduced a trap composed of 5 places in 407 ms of which 1 ms to minimize.
[2023-03-20 01:56:53] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 1 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 6 places in 314 ms of which 0 ms to minimize.
[2023-03-20 01:56:54] [INFO ] Deduced a trap composed of 6 places in 315 ms of which 2 ms to minimize.
[2023-03-20 01:56:55] [INFO ] Deduced a trap composed of 7 places in 451 ms of which 1 ms to minimize.
[2023-03-20 01:56:55] [INFO ] Deduced a trap composed of 5 places in 355 ms of which 1 ms to minimize.
[2023-03-20 01:56:56] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 1 ms to minimize.
[2023-03-20 01:56:56] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 0 ms to minimize.
[2023-03-20 01:56:57] [INFO ] Deduced a trap composed of 11 places in 412 ms of which 14 ms to minimize.
[2023-03-20 01:56:57] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2023-03-20 01:56:57] [INFO ] Deduced a trap composed of 17 places in 336 ms of which 1 ms to minimize.
[2023-03-20 01:56:58] [INFO ] Deduced a trap composed of 8 places in 351 ms of which 1 ms to minimize.
[2023-03-20 01:56:58] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 1 ms to minimize.
[2023-03-20 01:56:59] [INFO ] Deduced a trap composed of 8 places in 544 ms of which 1 ms to minimize.
[2023-03-20 01:56:59] [INFO ] Deduced a trap composed of 6 places in 294 ms of which 1 ms to minimize.
[2023-03-20 01:57:00] [INFO ] Deduced a trap composed of 6 places in 285 ms of which 1 ms to minimize.
[2023-03-20 01:57:00] [INFO ] Deduced a trap composed of 24 places in 339 ms of which 1 ms to minimize.
[2023-03-20 01:57:00] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 1 ms to minimize.
[2023-03-20 01:57:01] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-20 01:57:01] [INFO ] Deduced a trap composed of 7 places in 372 ms of which 1 ms to minimize.
[2023-03-20 01:57:01] [INFO ] Deduced a trap composed of 7 places in 323 ms of which 17 ms to minimize.
[2023-03-20 01:57:02] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 1 ms to minimize.
[2023-03-20 01:57:02] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 1 ms to minimize.
[2023-03-20 01:57:02] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 1 ms to minimize.
[2023-03-20 01:57:03] [INFO ] Deduced a trap composed of 13 places in 466 ms of which 1 ms to minimize.
[2023-03-20 01:57:03] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2023-03-20 01:57:04] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 3 ms to minimize.
[2023-03-20 01:57:04] [INFO ] Deduced a trap composed of 8 places in 302 ms of which 10 ms to minimize.
[2023-03-20 01:57:05] [INFO ] Deduced a trap composed of 13 places in 340 ms of which 0 ms to minimize.
[2023-03-20 01:57:05] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 1 ms to minimize.
[2023-03-20 01:57:05] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 0 ms to minimize.
[2023-03-20 01:57:06] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 3 ms to minimize.
[2023-03-20 01:57:06] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2023-03-20 01:57:06] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:57:07] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 0 ms to minimize.
[2023-03-20 01:57:07] [INFO ] Deduced a trap composed of 12 places in 341 ms of which 1 ms to minimize.
[2023-03-20 01:57:07] [INFO ] Deduced a trap composed of 19 places in 197 ms of which 0 ms to minimize.
[2023-03-20 01:57:07] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 15 ms to minimize.
[2023-03-20 01:57:08] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 1 ms to minimize.
[2023-03-20 01:57:08] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 1 ms to minimize.
[2023-03-20 01:57:08] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 15714 ms
[2023-03-20 01:57:09] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 1 ms to minimize.
[2023-03-20 01:57:09] [INFO ] Deduced a trap composed of 5 places in 385 ms of which 2 ms to minimize.
[2023-03-20 01:57:10] [INFO ] Deduced a trap composed of 7 places in 517 ms of which 2 ms to minimize.
[2023-03-20 01:57:10] [INFO ] Deduced a trap composed of 19 places in 479 ms of which 1 ms to minimize.
[2023-03-20 01:57:11] [INFO ] Deduced a trap composed of 20 places in 272 ms of which 1 ms to minimize.
[2023-03-20 01:57:13] [INFO ] Deduced a trap composed of 14 places in 1967 ms of which 3 ms to minimize.
[2023-03-20 01:57:13] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2023-03-20 01:57:14] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:57:14] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 0 ms to minimize.
[2023-03-20 01:57:14] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:57:16] [INFO ] Deduced a trap composed of 7 places in 1876 ms of which 12 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-20 01:57:16] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 01:57:16] [INFO ] After 25537ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 87 ms.
Support contains 56 out of 1675 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1675/1675 places, 1425/1425 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 1675 transition count 1415
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 1665 transition count 1415
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 1665 transition count 1404
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 1654 transition count 1404
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 120 place count 1615 transition count 1365
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 1615 transition count 1365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 1613 transition count 1363
Applied a total of 130 rules in 316 ms. Remains 1613 /1675 variables (removed 62) and now considering 1363/1425 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 1613/1675 places, 1363/1425 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 111443 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 111443 steps, saw 105665 distinct states, run finished after 3002 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1363 rows 1613 cols
[2023-03-20 01:57:20] [INFO ] Computed 551 place invariants in 37 ms
[2023-03-20 01:57:20] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:57:21] [INFO ] [Nat]Absence check using 529 positive place invariants in 109 ms returned sat
[2023-03-20 01:57:21] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 5 ms returned sat
[2023-03-20 01:57:22] [INFO ] After 1084ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:57:22] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 27 ms to minimize.
[2023-03-20 01:57:23] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 1 ms to minimize.
[2023-03-20 01:57:23] [INFO ] Deduced a trap composed of 6 places in 538 ms of which 13 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 10 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2023-03-20 01:57:24] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2023-03-20 01:57:25] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2023-03-20 01:57:25] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 1 ms to minimize.
[2023-03-20 01:57:26] [INFO ] Deduced a trap composed of 4 places in 488 ms of which 2 ms to minimize.
[2023-03-20 01:57:26] [INFO ] Deduced a trap composed of 6 places in 476 ms of which 1 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 3 places in 318 ms of which 1 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-20 01:57:27] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-20 01:57:28] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 0 ms to minimize.
[2023-03-20 01:57:28] [INFO ] Deduced a trap composed of 6 places in 471 ms of which 1 ms to minimize.
[2023-03-20 01:57:29] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:57:29] [INFO ] Deduced a trap composed of 6 places in 229 ms of which 0 ms to minimize.
[2023-03-20 01:57:29] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-20 01:57:30] [INFO ] Deduced a trap composed of 5 places in 257 ms of which 0 ms to minimize.
[2023-03-20 01:57:30] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2023-03-20 01:57:30] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-20 01:57:31] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 1 ms to minimize.
[2023-03-20 01:57:31] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2023-03-20 01:57:31] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-20 01:57:32] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 0 ms to minimize.
[2023-03-20 01:57:32] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2023-03-20 01:57:32] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 1 ms to minimize.
[2023-03-20 01:57:33] [INFO ] Deduced a trap composed of 6 places in 333 ms of which 1 ms to minimize.
[2023-03-20 01:57:33] [INFO ] Deduced a trap composed of 17 places in 236 ms of which 0 ms to minimize.
[2023-03-20 01:57:33] [INFO ] Deduced a trap composed of 7 places in 315 ms of which 0 ms to minimize.
[2023-03-20 01:57:34] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:57:34] [INFO ] Deduced a trap composed of 17 places in 230 ms of which 1 ms to minimize.
[2023-03-20 01:57:34] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:57:34] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-20 01:57:35] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 1 ms to minimize.
[2023-03-20 01:57:35] [INFO ] Deduced a trap composed of 36 places in 259 ms of which 0 ms to minimize.
[2023-03-20 01:57:35] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2023-03-20 01:57:36] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 0 ms to minimize.
[2023-03-20 01:57:36] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 1 ms to minimize.
[2023-03-20 01:57:36] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 14163 ms
[2023-03-20 01:57:37] [INFO ] Deduced a trap composed of 5 places in 223 ms of which 1 ms to minimize.
[2023-03-20 01:57:37] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-20 01:57:37] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2023-03-20 01:57:37] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-20 01:57:38] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2023-03-20 01:57:38] [INFO ] Deduced a trap composed of 8 places in 423 ms of which 1 ms to minimize.
[2023-03-20 01:57:39] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:57:39] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 1 ms to minimize.
[2023-03-20 01:57:39] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:57:39] [INFO ] Deduced a trap composed of 6 places in 374 ms of which 2 ms to minimize.
[2023-03-20 01:57:40] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 0 ms to minimize.
[2023-03-20 01:57:40] [INFO ] Deduced a trap composed of 8 places in 174 ms of which 0 ms to minimize.
[2023-03-20 01:57:40] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 0 ms to minimize.
[2023-03-20 01:57:41] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:57:41] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2023-03-20 01:57:41] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-20 01:57:41] [INFO ] Deduced a trap composed of 29 places in 187 ms of which 1 ms to minimize.
[2023-03-20 01:57:42] [INFO ] Deduced a trap composed of 11 places in 232 ms of which 0 ms to minimize.
[2023-03-20 01:57:42] [INFO ] Deduced a trap composed of 5 places in 319 ms of which 0 ms to minimize.
[2023-03-20 01:57:42] [INFO ] Deduced a trap composed of 8 places in 229 ms of which 1 ms to minimize.
[2023-03-20 01:57:43] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 2 ms to minimize.
[2023-03-20 01:57:43] [INFO ] Deduced a trap composed of 6 places in 280 ms of which 1 ms to minimize.
[2023-03-20 01:57:43] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 0 ms to minimize.
[2023-03-20 01:57:44] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-20 01:57:44] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 1 ms to minimize.
[2023-03-20 01:57:44] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 1 ms to minimize.
[2023-03-20 01:57:45] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-20 01:57:45] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 0 ms to minimize.
[2023-03-20 01:57:45] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8513 ms
[2023-03-20 01:57:45] [INFO ] After 24085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-20 01:57:45] [INFO ] After 24976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 69 ms.
Support contains 56 out of 1613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 67 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 1613/1613 places, 1363/1363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 99 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
[2023-03-20 01:57:46] [INFO ] Invariant cache hit.
[2023-03-20 01:57:46] [INFO ] Implicit Places using invariants in 960 ms returned []
[2023-03-20 01:57:46] [INFO ] Invariant cache hit.
[2023-03-20 01:57:49] [INFO ] Implicit Places using invariants and state equation in 2902 ms returned []
Implicit Place search using SMT with State Equation took 3898 ms to find 0 implicit places.
[2023-03-20 01:57:49] [INFO ] Redundant transitions in 86 ms returned []
[2023-03-20 01:57:49] [INFO ] Invariant cache hit.
[2023-03-20 01:57:53] [INFO ] Dead Transitions using invariants and state equation in 3163 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7266 ms. Remains : 1613/1613 places, 1363/1363 transitions.
Applied a total of 0 rules in 79 ms. Remains 1613 /1613 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 01:57:53] [INFO ] Invariant cache hit.
[2023-03-20 01:57:53] [INFO ] After 378ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:57:53] [INFO ] [Nat]Absence check using 529 positive place invariants in 94 ms returned sat
[2023-03-20 01:57:53] [INFO ] [Nat]Absence check using 529 positive and 22 generalized place invariants in 18 ms returned sat
[2023-03-20 01:57:55] [INFO ] After 941ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:57:55] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2023-03-20 01:57:56] [INFO ] Deduced a trap composed of 6 places in 845 ms of which 1 ms to minimize.
[2023-03-20 01:57:56] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2023-03-20 01:57:57] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2023-03-20 01:57:57] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 1 ms to minimize.
[2023-03-20 01:57:58] [INFO ] Deduced a trap composed of 5 places in 357 ms of which 1 ms to minimize.
[2023-03-20 01:58:00] [INFO ] Deduced a trap composed of 4 places in 1926 ms of which 1 ms to minimize.
[2023-03-20 01:58:00] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-20 01:58:00] [INFO ] Deduced a trap composed of 5 places in 273 ms of which 0 ms to minimize.
[2023-03-20 01:58:01] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2023-03-20 01:58:01] [INFO ] Deduced a trap composed of 6 places in 552 ms of which 1 ms to minimize.
[2023-03-20 01:58:02] [INFO ] Deduced a trap composed of 5 places in 262 ms of which 1 ms to minimize.
[2023-03-20 01:58:02] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 2 ms to minimize.
[2023-03-20 01:58:02] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-20 01:58:03] [INFO ] Deduced a trap composed of 6 places in 447 ms of which 1 ms to minimize.
[2023-03-20 01:58:03] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 0 ms to minimize.
[2023-03-20 01:58:03] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-20 01:58:04] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-20 01:58:04] [INFO ] Deduced a trap composed of 6 places in 203 ms of which 1 ms to minimize.
[2023-03-20 01:58:04] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2023-03-20 01:58:05] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 0 ms to minimize.
[2023-03-20 01:58:05] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2023-03-20 01:58:05] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-20 01:58:05] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10629 ms
[2023-03-20 01:58:06] [INFO ] Deduced a trap composed of 5 places in 282 ms of which 2 ms to minimize.
[2023-03-20 01:58:06] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 0 ms to minimize.
[2023-03-20 01:58:07] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 1 ms to minimize.
[2023-03-20 01:58:07] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 0 ms to minimize.
[2023-03-20 01:58:07] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-20 01:58:08] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2023-03-20 01:58:08] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-20 01:58:08] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 1 ms to minimize.
[2023-03-20 01:58:09] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 0 ms to minimize.
[2023-03-20 01:58:09] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-20 01:58:09] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 1 ms to minimize.
[2023-03-20 01:58:10] [INFO ] Deduced a trap composed of 11 places in 344 ms of which 0 ms to minimize.
[2023-03-20 01:58:10] [INFO ] Deduced a trap composed of 10 places in 282 ms of which 0 ms to minimize.
[2023-03-20 01:58:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4609 ms
[2023-03-20 01:58:10] [INFO ] After 16566ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 302 ms.
[2023-03-20 01:58:10] [INFO ] After 17294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-20 01:58:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 23 ms.
[2023-03-20 01:58:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1613 places, 1363 transitions and 5914 arcs took 22 ms.
[2023-03-20 01:58:11] [INFO ] Flatten gal took : 164 ms
Total runtime 113397 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-050B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
ReachabilityFireability

FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277493587

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type EXCL) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-08
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 40
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 10 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 11 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 17 (type EXCL) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-06
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 13 (type FNDP) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type EQUN) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 16 (type SRCH) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-06
lola: result : true
lola: markings : 185
lola: fired transitions : 184
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 13 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 14 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-06 (obsolete)
lola: CANCELED task # 17 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-ReachabilityFireability-06: EF true tandem / insertion
ShieldPPPs-PT-050B-ReachabilityFireability-08: AG false findpath


Time elapsed: 2 secs. Pages in use: 3

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-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPs-PT-050B, 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 r391-oct2-167903715400511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-050B.tgz
mv ShieldPPPs-PT-050B 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 ;