About the Execution of 2023-gold for ShieldPPPs-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 926.144 | 208324.00 | 240326.00 | 1258.30 | TTTTFTFTTFFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789000320.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r373-tall-171683789000320
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 888K May 18 16:43 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-2024-00
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-12
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
FORMULA_NAME ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716979424298
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=gold2023
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 202304061127
[2024-05-29 10:43:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 10:43:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:43:46] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-29 10:43:46] [INFO ] Transformed 3403 places.
[2024-05-29 10:43:46] [INFO ] Transformed 3153 transitions.
[2024-05-29 10:43:46] [INFO ] Found NUPN structural information;
[2024-05-29 10:43:46] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 3153 rows 3403 cols
[2024-05-29 10:43:48] [INFO ] Computed 551 invariants in 44 ms
[2024-05-29 10:43:49] [INFO ] [Real]Absence check using 551 positive place invariants in 227 ms returned sat
[2024-05-29 10:43:49] [INFO ] After 1758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-29 10:43:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 238 ms returned sat
[2024-05-29 10:44:05] [INFO ] After 13349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-29 10:44:06] [INFO ] Deduced a trap composed of 18 places in 1184 ms of which 22 ms to minimize.
[2024-05-29 10:44:07] [INFO ] Deduced a trap composed of 19 places in 984 ms of which 2 ms to minimize.
[2024-05-29 10:44:08] [INFO ] Deduced a trap composed of 38 places in 1027 ms of which 3 ms to minimize.
[2024-05-29 10:44:09] [INFO ] Deduced a trap composed of 13 places in 870 ms of which 3 ms to minimize.
[2024-05-29 10:44:10] [INFO ] Deduced a trap composed of 28 places in 961 ms of which 2 ms to minimize.
[2024-05-29 10:44:11] [INFO ] Deduced a trap composed of 22 places in 1009 ms of which 2 ms to minimize.
[2024-05-29 10:44:12] [INFO ] Deduced a trap composed of 17 places in 950 ms of which 2 ms to minimize.
[2024-05-29 10:44:14] [INFO ] Deduced a trap composed of 21 places in 929 ms of which 1 ms to minimize.
[2024-05-29 10:44:15] [INFO ] Deduced a trap composed of 19 places in 941 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 10:44:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:44:15] [INFO ] After 25227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Parikh walk visited 0 properties in 1505 ms.
Support contains 150 out of 3403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Drop transitions removed 304 transitions
Trivial Post-agglo rules discarded 304 transitions
Performed 304 trivial Post agglomeration. Transition count delta: 304
Iterating post reduction 0 with 304 rules applied. Total rules applied 304 place count 3403 transition count 2849
Reduce places removed 304 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 317 rules applied. Total rules applied 621 place count 3099 transition count 2836
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 634 place count 3086 transition count 2836
Performed 246 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 246 Pre rules applied. Total rules applied 634 place count 3086 transition count 2590
Deduced a syphon composed of 246 places in 9 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 1126 place count 2840 transition count 2590
Discarding 321 places :
Symmetric choice reduction at 3 with 321 rule applications. Total rules 1447 place count 2519 transition count 2269
Iterating global reduction 3 with 321 rules applied. Total rules applied 1768 place count 2519 transition count 2269
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 119 Pre rules applied. Total rules applied 1768 place count 2519 transition count 2150
Deduced a syphon composed of 119 places in 18 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 2006 place count 2400 transition count 2150
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 701
Deduced a syphon composed of 701 places in 3 ms
Reduce places removed 701 places and 0 transitions.
Iterating global reduction 3 with 1402 rules applied. Total rules applied 3408 place count 1699 transition count 1449
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 393 times.
Drop transitions removed 393 transitions
Iterating global reduction 3 with 393 rules applied. Total rules applied 3801 place count 1699 transition count 1449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3802 place count 1698 transition count 1448
Applied a total of 3802 rules in 1261 ms. Remains 1698 /3403 variables (removed 1705) and now considering 1448/3153 (removed 1705) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1263 ms. Remains : 1698/3403 places, 1448/3153 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 12) seen :2
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1448 rows 1698 cols
[2024-05-29 10:44:19] [INFO ] Computed 551 invariants in 41 ms
[2024-05-29 10:44:19] [INFO ] [Real]Absence check using 532 positive place invariants in 91 ms returned sat
[2024-05-29 10:44:19] [INFO ] [Real]Absence check using 532 positive and 19 generalized place invariants in 3 ms returned sat
[2024-05-29 10:44:19] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-29 10:44:20] [INFO ] [Nat]Absence check using 532 positive place invariants in 129 ms returned sat
[2024-05-29 10:44:20] [INFO ] [Nat]Absence check using 532 positive and 19 generalized place invariants in 4 ms returned sat
[2024-05-29 10:44:24] [INFO ] After 4401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 1 ms to minimize.
[2024-05-29 10:44:25] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2024-05-29 10:44:26] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-29 10:44:26] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2024-05-29 10:44:26] [INFO ] Deduced a trap composed of 8 places in 248 ms of which 1 ms to minimize.
[2024-05-29 10:44:27] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 1 ms to minimize.
[2024-05-29 10:44:27] [INFO ] Deduced a trap composed of 7 places in 261 ms of which 0 ms to minimize.
[2024-05-29 10:44:27] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 1 ms to minimize.
[2024-05-29 10:44:27] [INFO ] Deduced a trap composed of 11 places in 279 ms of which 1 ms to minimize.
[2024-05-29 10:44:28] [INFO ] Deduced a trap composed of 8 places in 280 ms of which 0 ms to minimize.
[2024-05-29 10:44:28] [INFO ] Deduced a trap composed of 6 places in 274 ms of which 0 ms to minimize.
[2024-05-29 10:44:29] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:44:29] [INFO ] Deduced a trap composed of 5 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:44:29] [INFO ] Deduced a trap composed of 6 places in 265 ms of which 2 ms to minimize.
[2024-05-29 10:44:29] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2024-05-29 10:44:30] [INFO ] Deduced a trap composed of 7 places in 268 ms of which 1 ms to minimize.
[2024-05-29 10:44:30] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2024-05-29 10:44:30] [INFO ] Deduced a trap composed of 8 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:44:31] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 2 ms to minimize.
[2024-05-29 10:44:31] [INFO ] Deduced a trap composed of 8 places in 270 ms of which 0 ms to minimize.
[2024-05-29 10:44:32] [INFO ] Deduced a trap composed of 8 places in 283 ms of which 1 ms to minimize.
[2024-05-29 10:44:32] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 0 ms to minimize.
[2024-05-29 10:44:32] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:44:33] [INFO ] Deduced a trap composed of 40 places in 283 ms of which 1 ms to minimize.
[2024-05-29 10:44:33] [INFO ] Deduced a trap composed of 8 places in 254 ms of which 5 ms to minimize.
[2024-05-29 10:44:33] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-05-29 10:44:34] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:44:34] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 0 ms to minimize.
[2024-05-29 10:44:34] [INFO ] Deduced a trap composed of 7 places in 227 ms of which 1 ms to minimize.
[2024-05-29 10:44:34] [INFO ] Deduced a trap composed of 8 places in 222 ms of which 1 ms to minimize.
[2024-05-29 10:44:35] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 2 ms to minimize.
[2024-05-29 10:44:35] [INFO ] Deduced a trap composed of 7 places in 231 ms of which 0 ms to minimize.
[2024-05-29 10:44:35] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2024-05-29 10:44:36] [INFO ] Deduced a trap composed of 13 places in 259 ms of which 1 ms to minimize.
[2024-05-29 10:44:36] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 1 ms to minimize.
[2024-05-29 10:44:36] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 0 ms to minimize.
[2024-05-29 10:44:36] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 1 ms to minimize.
[2024-05-29 10:44:37] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 1 ms to minimize.
[2024-05-29 10:44:37] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 1 ms to minimize.
[2024-05-29 10:44:37] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 12622 ms
[2024-05-29 10:44:38] [INFO ] Deduced a trap composed of 6 places in 278 ms of which 1 ms to minimize.
[2024-05-29 10:44:38] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 1 ms to minimize.
[2024-05-29 10:44:38] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 2 ms to minimize.
[2024-05-29 10:44:38] [INFO ] Deduced a trap composed of 16 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:44:39] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 1 ms to minimize.
[2024-05-29 10:44:39] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-29 10:44:39] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2024-05-29 10:44:40] [INFO ] Deduced a trap composed of 17 places in 224 ms of which 2 ms to minimize.
[2024-05-29 10:44:40] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 5 ms to minimize.
[2024-05-29 10:44:40] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 1 ms to minimize.
[2024-05-29 10:44:41] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 0 ms to minimize.
[2024-05-29 10:44:41] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2024-05-29 10:44:41] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3825 ms
[2024-05-29 10:44:41] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:44:42] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 0 ms to minimize.
[2024-05-29 10:44:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 551 ms
[2024-05-29 10:44:42] [INFO ] Deduced a trap composed of 11 places in 184 ms of which 1 ms to minimize.
[2024-05-29 10:44:42] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2024-05-29 10:44:42] [INFO ] Deduced a trap composed of 14 places in 184 ms of which 3 ms to minimize.
[2024-05-29 10:44:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 786 ms
[2024-05-29 10:44:43] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-05-29 10:44:43] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 1 ms to minimize.
[2024-05-29 10:44:43] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 1 ms to minimize.
[2024-05-29 10:44:43] [INFO ] Deduced a trap composed of 27 places in 158 ms of which 0 ms to minimize.
[2024-05-29 10:44:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 943 ms
[2024-05-29 10:44:44] [INFO ] Deduced a trap composed of 7 places in 234 ms of which 0 ms to minimize.
[2024-05-29 10:44:44] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 10:44:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:44:44] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Parikh walk visited 0 properties in 466 ms.
Support contains 145 out of 1698 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1698/1698 places, 1448/1448 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1697 transition count 1447
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 1697 transition count 1447
Applied a total of 5 rules in 178 ms. Remains 1697 /1698 variables (removed 1) and now considering 1447/1448 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 1697/1698 places, 1447/1448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 95789 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{0=1, 1=1, 6=1}
Probabilistic random walk after 95789 steps, saw 92297 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :3
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 1447 rows 1697 cols
[2024-05-29 10:44:49] [INFO ] Computed 551 invariants in 30 ms
[2024-05-29 10:44:49] [INFO ] After 310ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 10:44:50] [INFO ] [Nat]Absence check using 526 positive place invariants in 103 ms returned sat
[2024-05-29 10:44:50] [INFO ] [Nat]Absence check using 526 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-29 10:44:53] [INFO ] After 3081ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 10:44:53] [INFO ] Deduced a trap composed of 6 places in 412 ms of which 1 ms to minimize.
[2024-05-29 10:44:54] [INFO ] Deduced a trap composed of 8 places in 393 ms of which 1 ms to minimize.
[2024-05-29 10:44:54] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 1 ms to minimize.
[2024-05-29 10:44:55] [INFO ] Deduced a trap composed of 4 places in 407 ms of which 1 ms to minimize.
[2024-05-29 10:44:55] [INFO ] Deduced a trap composed of 6 places in 438 ms of which 1 ms to minimize.
[2024-05-29 10:44:56] [INFO ] Deduced a trap composed of 6 places in 442 ms of which 1 ms to minimize.
[2024-05-29 10:44:56] [INFO ] Deduced a trap composed of 6 places in 423 ms of which 1 ms to minimize.
[2024-05-29 10:44:57] [INFO ] Deduced a trap composed of 6 places in 436 ms of which 3 ms to minimize.
[2024-05-29 10:44:57] [INFO ] Deduced a trap composed of 3 places in 399 ms of which 3 ms to minimize.
[2024-05-29 10:44:58] [INFO ] Deduced a trap composed of 12 places in 372 ms of which 1 ms to minimize.
[2024-05-29 10:44:58] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 1 ms to minimize.
[2024-05-29 10:44:59] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 1 ms to minimize.
[2024-05-29 10:44:59] [INFO ] Deduced a trap composed of 7 places in 337 ms of which 1 ms to minimize.
[2024-05-29 10:44:59] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 1 ms to minimize.
[2024-05-29 10:45:00] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 1 ms to minimize.
[2024-05-29 10:45:00] [INFO ] Deduced a trap composed of 9 places in 284 ms of which 1 ms to minimize.
[2024-05-29 10:45:00] [INFO ] Deduced a trap composed of 5 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:45:01] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 1 ms to minimize.
[2024-05-29 10:45:01] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 1 ms to minimize.
[2024-05-29 10:45:01] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2024-05-29 10:45:02] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-29 10:45:02] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 10:45:02] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 0 ms to minimize.
[2024-05-29 10:45:03] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 1 ms to minimize.
[2024-05-29 10:45:03] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2024-05-29 10:45:03] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2024-05-29 10:45:03] [INFO ] Deduced a trap composed of 6 places in 238 ms of which 1 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 0 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 1 ms to minimize.
[2024-05-29 10:45:04] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 0 ms to minimize.
[2024-05-29 10:45:05] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2024-05-29 10:45:05] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 1 ms to minimize.
[2024-05-29 10:45:05] [INFO ] Deduced a trap composed of 15 places in 241 ms of which 1 ms to minimize.
[2024-05-29 10:45:06] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 1 ms to minimize.
[2024-05-29 10:45:06] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-29 10:45:06] [INFO ] Deduced a trap composed of 21 places in 237 ms of which 0 ms to minimize.
[2024-05-29 10:45:07] [INFO ] Deduced a trap composed of 6 places in 250 ms of which 0 ms to minimize.
[2024-05-29 10:45:07] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 13635 ms
[2024-05-29 10:45:07] [INFO ] Deduced a trap composed of 11 places in 252 ms of which 1 ms to minimize.
[2024-05-29 10:45:07] [INFO ] Deduced a trap composed of 22 places in 231 ms of which 0 ms to minimize.
[2024-05-29 10:45:08] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2024-05-29 10:45:08] [INFO ] Deduced a trap composed of 18 places in 312 ms of which 1 ms to minimize.
[2024-05-29 10:45:08] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 1 ms to minimize.
[2024-05-29 10:45:09] [INFO ] Deduced a trap composed of 12 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:45:09] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2024-05-29 10:45:09] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 0 ms to minimize.
[2024-05-29 10:45:10] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 1 ms to minimize.
[2024-05-29 10:45:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2993 ms
[2024-05-29 10:45:10] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2024-05-29 10:45:11] [INFO ] Deduced a trap composed of 8 places in 318 ms of which 1 ms to minimize.
[2024-05-29 10:45:11] [INFO ] Deduced a trap composed of 5 places in 298 ms of which 0 ms to minimize.
[2024-05-29 10:45:11] [INFO ] Deduced a trap composed of 6 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:45:12] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-29 10:45:12] [INFO ] Deduced a trap composed of 8 places in 255 ms of which 0 ms to minimize.
[2024-05-29 10:45:12] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:45:13] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 0 ms to minimize.
[2024-05-29 10:45:13] [INFO ] Deduced a trap composed of 7 places in 269 ms of which 1 ms to minimize.
[2024-05-29 10:45:13] [INFO ] Deduced a trap composed of 5 places in 276 ms of which 1 ms to minimize.
[2024-05-29 10:45:14] [INFO ] Deduced a trap composed of 5 places in 271 ms of which 1 ms to minimize.
[2024-05-29 10:45:14] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 0 ms to minimize.
[2024-05-29 10:45:14] [INFO ] Deduced a trap composed of 8 places in 262 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 10:45:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:45:14] [INFO ] After 25236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 338 ms.
Support contains 139 out of 1697 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1697/1697 places, 1447/1447 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1694 transition count 1444
Applied a total of 6 rules in 125 ms. Remains 1694 /1697 variables (removed 3) and now considering 1444/1447 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 1694/1697 places, 1444/1447 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 90108 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90108 steps, saw 86956 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1444 rows 1694 cols
[2024-05-29 10:45:19] [INFO ] Computed 551 invariants in 23 ms
[2024-05-29 10:45:19] [INFO ] After 389ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 10:45:20] [INFO ] [Nat]Absence check using 527 positive place invariants in 105 ms returned sat
[2024-05-29 10:45:20] [INFO ] [Nat]Absence check using 527 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-29 10:45:24] [INFO ] After 3762ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 10:45:24] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 1 ms to minimize.
[2024-05-29 10:45:25] [INFO ] Deduced a trap composed of 6 places in 399 ms of which 1 ms to minimize.
[2024-05-29 10:45:25] [INFO ] Deduced a trap composed of 7 places in 381 ms of which 1 ms to minimize.
[2024-05-29 10:45:26] [INFO ] Deduced a trap composed of 17 places in 382 ms of which 1 ms to minimize.
[2024-05-29 10:45:26] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2024-05-29 10:45:26] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 1 ms to minimize.
[2024-05-29 10:45:27] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 1 ms to minimize.
[2024-05-29 10:45:27] [INFO ] Deduced a trap composed of 21 places in 391 ms of which 1 ms to minimize.
[2024-05-29 10:45:28] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 3 ms to minimize.
[2024-05-29 10:45:28] [INFO ] Deduced a trap composed of 34 places in 387 ms of which 1 ms to minimize.
[2024-05-29 10:45:29] [INFO ] Deduced a trap composed of 6 places in 380 ms of which 1 ms to minimize.
[2024-05-29 10:45:29] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 2 ms to minimize.
[2024-05-29 10:45:30] [INFO ] Deduced a trap composed of 6 places in 390 ms of which 1 ms to minimize.
[2024-05-29 10:45:30] [INFO ] Deduced a trap composed of 29 places in 384 ms of which 1 ms to minimize.
[2024-05-29 10:45:30] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2024-05-29 10:45:31] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 1 ms to minimize.
[2024-05-29 10:45:31] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 1 ms to minimize.
[2024-05-29 10:45:32] [INFO ] Deduced a trap composed of 5 places in 394 ms of which 1 ms to minimize.
[2024-05-29 10:45:32] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2024-05-29 10:45:33] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2024-05-29 10:45:33] [INFO ] Deduced a trap composed of 12 places in 402 ms of which 1 ms to minimize.
[2024-05-29 10:45:34] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2024-05-29 10:45:34] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 0 ms to minimize.
[2024-05-29 10:45:34] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 1 ms to minimize.
[2024-05-29 10:45:35] [INFO ] Deduced a trap composed of 5 places in 322 ms of which 0 ms to minimize.
[2024-05-29 10:45:35] [INFO ] Deduced a trap composed of 12 places in 353 ms of which 0 ms to minimize.
[2024-05-29 10:45:36] [INFO ] Deduced a trap composed of 9 places in 331 ms of which 1 ms to minimize.
[2024-05-29 10:45:36] [INFO ] Deduced a trap composed of 18 places in 335 ms of which 0 ms to minimize.
[2024-05-29 10:45:36] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2024-05-29 10:45:37] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 1 ms to minimize.
[2024-05-29 10:45:37] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2024-05-29 10:45:38] [INFO ] Deduced a trap composed of 10 places in 339 ms of which 1 ms to minimize.
[2024-05-29 10:45:38] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2024-05-29 10:45:38] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2024-05-29 10:45:39] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 1 ms to minimize.
[2024-05-29 10:45:39] [INFO ] Deduced a trap composed of 11 places in 316 ms of which 1 ms to minimize.
[2024-05-29 10:45:40] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 1 ms to minimize.
[2024-05-29 10:45:40] [INFO ] Deduced a trap composed of 14 places in 306 ms of which 1 ms to minimize.
[2024-05-29 10:45:40] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 1 ms to minimize.
[2024-05-29 10:45:41] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 1 ms to minimize.
[2024-05-29 10:45:41] [INFO ] Deduced a trap composed of 12 places in 275 ms of which 1 ms to minimize.
[2024-05-29 10:45:41] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2024-05-29 10:45:42] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 0 ms to minimize.
[2024-05-29 10:45:42] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 0 ms to minimize.
[2024-05-29 10:45:42] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 18315 ms
[2024-05-29 10:45:42] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 1 ms to minimize.
[2024-05-29 10:45:43] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2024-05-29 10:45:43] [INFO ] Deduced a trap composed of 22 places in 245 ms of which 1 ms to minimize.
[2024-05-29 10:45:43] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2024-05-29 10:45:43] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1244 ms
[2024-05-29 10:45:44] [INFO ] Deduced a trap composed of 6 places in 281 ms of which 0 ms to minimize.
[2024-05-29 10:45:44] [INFO ] Deduced a trap composed of 5 places in 285 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:739)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:659)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-29 10:45:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-29 10:45:44] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 268 ms.
Support contains 139 out of 1694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1444/1444 transitions.
Applied a total of 0 rules in 77 ms. Remains 1694 /1694 variables (removed 0) and now considering 1444/1444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1694/1694 places, 1444/1444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1694/1694 places, 1444/1444 transitions.
Applied a total of 0 rules in 56 ms. Remains 1694 /1694 variables (removed 0) and now considering 1444/1444 (removed 0) transitions.
[2024-05-29 10:45:45] [INFO ] Invariant cache hit.
[2024-05-29 10:45:46] [INFO ] Implicit Places using invariants in 981 ms returned []
[2024-05-29 10:45:46] [INFO ] Invariant cache hit.
[2024-05-29 10:45:48] [INFO ] Implicit Places using invariants and state equation in 2231 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
[2024-05-29 10:45:48] [INFO ] Redundant transitions in 186 ms returned []
[2024-05-29 10:45:48] [INFO ] Invariant cache hit.
[2024-05-29 10:45:49] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4352 ms. Remains : 1694/1694 places, 1444/1444 transitions.
Applied a total of 0 rules in 56 ms. Remains 1694 /1694 variables (removed 0) and now considering 1444/1444 (removed 0) transitions.
Running SMT prover for 7 properties.
[2024-05-29 10:45:49] [INFO ] Invariant cache hit.
[2024-05-29 10:45:49] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-29 10:45:50] [INFO ] [Nat]Absence check using 527 positive place invariants in 98 ms returned sat
[2024-05-29 10:45:50] [INFO ] [Nat]Absence check using 527 positive and 24 generalized place invariants in 5 ms returned sat
[2024-05-29 10:45:53] [INFO ] After 3380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-05-29 10:45:54] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 1 ms to minimize.
[2024-05-29 10:45:54] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2024-05-29 10:45:55] [INFO ] Deduced a trap composed of 5 places in 320 ms of which 1 ms to minimize.
[2024-05-29 10:45:55] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 0 ms to minimize.
[2024-05-29 10:45:55] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2024-05-29 10:45:56] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 1 ms to minimize.
[2024-05-29 10:45:56] [INFO ] Deduced a trap composed of 6 places in 304 ms of which 1 ms to minimize.
[2024-05-29 10:45:56] [INFO ] Deduced a trap composed of 11 places in 305 ms of which 0 ms to minimize.
[2024-05-29 10:45:57] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2024-05-29 10:45:57] [INFO ] Deduced a trap composed of 8 places in 344 ms of which 1 ms to minimize.
[2024-05-29 10:45:58] [INFO ] Deduced a trap composed of 17 places in 420 ms of which 1 ms to minimize.
[2024-05-29 10:45:58] [INFO ] Deduced a trap composed of 18 places in 327 ms of which 1 ms to minimize.
[2024-05-29 10:45:58] [INFO ] Deduced a trap composed of 8 places in 328 ms of which 0 ms to minimize.
[2024-05-29 10:45:59] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2024-05-29 10:45:59] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-29 10:46:00] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 1 ms to minimize.
[2024-05-29 10:46:00] [INFO ] Deduced a trap composed of 6 places in 291 ms of which 1 ms to minimize.
[2024-05-29 10:46:00] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 1 ms to minimize.
[2024-05-29 10:46:01] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2024-05-29 10:46:01] [INFO ] Deduced a trap composed of 10 places in 352 ms of which 1 ms to minimize.
[2024-05-29 10:46:02] [INFO ] Deduced a trap composed of 24 places in 357 ms of which 1 ms to minimize.
[2024-05-29 10:46:02] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2024-05-29 10:46:02] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2024-05-29 10:46:03] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2024-05-29 10:46:03] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2024-05-29 10:46:03] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2024-05-29 10:46:04] [INFO ] Deduced a trap composed of 7 places in 316 ms of which 1 ms to minimize.
[2024-05-29 10:46:04] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 1 ms to minimize.
[2024-05-29 10:46:05] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:46:05] [INFO ] Deduced a trap composed of 6 places in 289 ms of which 1 ms to minimize.
[2024-05-29 10:46:05] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2024-05-29 10:46:06] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 1 ms to minimize.
[2024-05-29 10:46:06] [INFO ] Deduced a trap composed of 12 places in 280 ms of which 1 ms to minimize.
[2024-05-29 10:46:06] [INFO ] Deduced a trap composed of 7 places in 279 ms of which 0 ms to minimize.
[2024-05-29 10:46:07] [INFO ] Deduced a trap composed of 9 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:46:07] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 1 ms to minimize.
[2024-05-29 10:46:07] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 1 ms to minimize.
[2024-05-29 10:46:08] [INFO ] Deduced a trap composed of 7 places in 270 ms of which 0 ms to minimize.
[2024-05-29 10:46:08] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 0 ms to minimize.
[2024-05-29 10:46:08] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 0 ms to minimize.
[2024-05-29 10:46:09] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2024-05-29 10:46:09] [INFO ] Deduced a trap composed of 8 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:46:09] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2024-05-29 10:46:10] [INFO ] Deduced a trap composed of 11 places in 257 ms of which 1 ms to minimize.
[2024-05-29 10:46:10] [INFO ] Deduced a trap composed of 8 places in 266 ms of which 1 ms to minimize.
[2024-05-29 10:46:10] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:46:11] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 1 ms to minimize.
[2024-05-29 10:46:11] [INFO ] Trap strengthening (SAT) tested/added 48/47 trap constraints in 17144 ms
[2024-05-29 10:46:11] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 1 ms to minimize.
[2024-05-29 10:46:11] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 0 ms to minimize.
[2024-05-29 10:46:12] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
[2024-05-29 10:46:12] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2024-05-29 10:46:12] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2024-05-29 10:46:13] [INFO ] Deduced a trap composed of 14 places in 235 ms of which 1 ms to minimize.
[2024-05-29 10:46:13] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2024-05-29 10:46:13] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 1 ms to minimize.
[2024-05-29 10:46:13] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2024-05-29 10:46:14] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2024-05-29 10:46:14] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 0 ms to minimize.
[2024-05-29 10:46:14] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2024-05-29 10:46:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 3782 ms
[2024-05-29 10:46:15] [INFO ] Deduced a trap composed of 5 places in 340 ms of which 0 ms to minimize.
[2024-05-29 10:46:16] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 0 ms to minimize.
[2024-05-29 10:46:16] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-05-29 10:46:16] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 1 ms to minimize.
[2024-05-29 10:46:17] [INFO ] Deduced a trap composed of 6 places in 296 ms of which 0 ms to minimize.
[2024-05-29 10:46:17] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 1 ms to minimize.
[2024-05-29 10:46:17] [INFO ] Deduced a trap composed of 5 places in 263 ms of which 1 ms to minimize.
[2024-05-29 10:46:18] [INFO ] Deduced a trap composed of 6 places in 264 ms of which 0 ms to minimize.
[2024-05-29 10:46:18] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2024-05-29 10:46:18] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 3 ms to minimize.
[2024-05-29 10:46:19] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 1 ms to minimize.
[2024-05-29 10:46:19] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 1 ms to minimize.
[2024-05-29 10:46:20] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2024-05-29 10:46:20] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 2 ms to minimize.
[2024-05-29 10:46:20] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 1 ms to minimize.
[2024-05-29 10:46:21] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 2 ms to minimize.
[2024-05-29 10:46:21] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 3 ms to minimize.
[2024-05-29 10:46:21] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2024-05-29 10:46:22] [INFO ] Deduced a trap composed of 8 places in 276 ms of which 0 ms to minimize.
[2024-05-29 10:46:22] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:46:22] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 1 ms to minimize.
[2024-05-29 10:46:23] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:46:23] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 0 ms to minimize.
[2024-05-29 10:46:23] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2024-05-29 10:46:24] [INFO ] Deduced a trap composed of 8 places in 235 ms of which 1 ms to minimize.
[2024-05-29 10:46:24] [INFO ] Deduced a trap composed of 6 places in 241 ms of which 0 ms to minimize.
[2024-05-29 10:46:24] [INFO ] Deduced a trap composed of 8 places in 240 ms of which 1 ms to minimize.
[2024-05-29 10:46:24] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2024-05-29 10:46:25] [INFO ] Deduced a trap composed of 8 places in 257 ms of which 1 ms to minimize.
[2024-05-29 10:46:25] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2024-05-29 10:46:25] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:46:26] [INFO ] Deduced a trap composed of 10 places in 261 ms of which 1 ms to minimize.
[2024-05-29 10:46:26] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2024-05-29 10:46:26] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 1 ms to minimize.
[2024-05-29 10:46:27] [INFO ] Deduced a trap composed of 7 places in 588 ms of which 2 ms to minimize.
[2024-05-29 10:46:27] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2024-05-29 10:46:28] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 10:46:28] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2024-05-29 10:46:28] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2024-05-29 10:46:29] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 1 ms to minimize.
[2024-05-29 10:46:29] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 1 ms to minimize.
[2024-05-29 10:46:29] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2024-05-29 10:46:30] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 0 ms to minimize.
[2024-05-29 10:46:30] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 1 ms to minimize.
[2024-05-29 10:46:30] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 1 ms to minimize.
[2024-05-29 10:46:30] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2024-05-29 10:46:31] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 1 ms to minimize.
[2024-05-29 10:46:31] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 0 ms to minimize.
[2024-05-29 10:46:31] [INFO ] Deduced a trap composed of 7 places in 232 ms of which 1 ms to minimize.
[2024-05-29 10:46:32] [INFO ] Deduced a trap composed of 7 places in 203 ms of which 1 ms to minimize.
[2024-05-29 10:46:32] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 0 ms to minimize.
[2024-05-29 10:46:32] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 1 ms to minimize.
[2024-05-29 10:46:32] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 1 ms to minimize.
[2024-05-29 10:46:33] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2024-05-29 10:46:33] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2024-05-29 10:46:33] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 1 ms to minimize.
[2024-05-29 10:46:33] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2024-05-29 10:46:34] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 18779 ms
[2024-05-29 10:46:36] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 10:46:36] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2024-05-29 10:46:37] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 10:46:37] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 10:46:37] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2024-05-29 10:46:37] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 0 ms to minimize.
[2024-05-29 10:46:38] [INFO ] Deduced a trap composed of 8 places in 178 ms of which 0 ms to minimize.
[2024-05-29 10:46:38] [INFO ] Deduced a trap composed of 6 places in 180 ms of which 1 ms to minimize.
[2024-05-29 10:46:38] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2024-05-29 10:46:38] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 1 ms to minimize.
[2024-05-29 10:46:39] [INFO ] Deduced a trap composed of 7 places in 176 ms of which 0 ms to minimize.
[2024-05-29 10:46:39] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:46:39] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 0 ms to minimize.
[2024-05-29 10:46:39] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2024-05-29 10:46:40] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2024-05-29 10:46:40] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:46:41] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2024-05-29 10:46:41] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 0 ms to minimize.
[2024-05-29 10:46:41] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 0 ms to minimize.
[2024-05-29 10:46:41] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:46:42] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 10:46:42] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2024-05-29 10:46:42] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 10:46:42] [INFO ] Deduced a trap composed of 8 places in 129 ms of which 0 ms to minimize.
[2024-05-29 10:46:43] [INFO ] Deduced a trap composed of 7 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:46:43] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2024-05-29 10:46:43] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 1 ms to minimize.
[2024-05-29 10:46:44] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 0 ms to minimize.
[2024-05-29 10:46:44] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
[2024-05-29 10:46:44] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:46:44] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2024-05-29 10:46:44] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
[2024-05-29 10:46:45] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2024-05-29 10:46:45] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 10:46:45] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-05-29 10:46:45] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 0 ms to minimize.
[2024-05-29 10:46:45] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2024-05-29 10:46:46] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-05-29 10:46:46] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 9895 ms
[2024-05-29 10:46:46] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2024-05-29 10:46:46] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2024-05-29 10:46:47] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 0 ms to minimize.
[2024-05-29 10:46:47] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2024-05-29 10:46:47] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2024-05-29 10:46:47] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 1 ms to minimize.
[2024-05-29 10:46:48] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 0 ms to minimize.
[2024-05-29 10:46:48] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-29 10:46:48] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2024-05-29 10:46:48] [INFO ] Deduced a trap composed of 6 places in 172 ms of which 1 ms to minimize.
[2024-05-29 10:46:48] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-29 10:46:49] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 1 ms to minimize.
[2024-05-29 10:46:49] [INFO ] Deduced a trap composed of 18 places in 159 ms of which 0 ms to minimize.
[2024-05-29 10:46:49] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 0 ms to minimize.
[2024-05-29 10:46:49] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-29 10:46:50] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 0 ms to minimize.
[2024-05-29 10:46:50] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2024-05-29 10:46:50] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-29 10:46:50] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 1 ms to minimize.
[2024-05-29 10:46:50] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2024-05-29 10:46:51] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 0 ms to minimize.
[2024-05-29 10:46:51] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 0 ms to minimize.
[2024-05-29 10:46:51] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2024-05-29 10:46:51] [INFO ] Deduced a trap composed of 8 places in 127 ms of which 1 ms to minimize.
[2024-05-29 10:46:51] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 0 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2024-05-29 10:46:52] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 10:46:53] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2024-05-29 10:46:53] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 6724 ms
[2024-05-29 10:46:53] [INFO ] Deduced a trap composed of 6 places in 197 ms of which 1 ms to minimize.
[2024-05-29 10:46:53] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2024-05-29 10:46:53] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2024-05-29 10:46:54] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 10:46:54] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2024-05-29 10:46:54] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 1 ms to minimize.
[2024-05-29 10:46:54] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 0 ms to minimize.
[2024-05-29 10:46:55] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2024-05-29 10:46:55] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2024-05-29 10:46:55] [INFO ] Deduced a trap composed of 17 places in 189 ms of which 1 ms to minimize.
[2024-05-29 10:46:55] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2024-05-29 10:46:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2837 ms
[2024-05-29 10:46:56] [INFO ] After 65455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 9924 ms.
[2024-05-29 10:47:06] [INFO ] After 76036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2024-05-29 10:47:06] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-29 10:47:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1694 places, 1444 transitions and 6237 arcs took 9 ms.
[2024-05-29 10:47:06] [INFO ] Flatten gal took : 239 ms
Total runtime 200298 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/372
ReachabilityFireability
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldPPPs-PT-050B-ReachabilityFireability-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1716979632622
--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
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: LAUNCH task # 25 (type EXCL) for 18 ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 18 ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 18 ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 18 ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
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: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:711
lola: FINISHED task # 24 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-15
lola: result : true
lola: markings : 194
lola: fired transitions : 193
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-15 (obsolete)
lola: LAUNCH task # 32 (type EXCL) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 0 ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
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: FINISHED task # 31 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-04
lola: result : true
lola: markings : 169
lola: fired transitions : 168
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-04 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-04 (obsolete)
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-22.sara.
sara: try reading problem file /home/mcc/execution/372/ReachabilityFireability-29.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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 # 42 (type EXCL) for 15 ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 37 (type FNDP) for 15 ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type EQUN) for 15 ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type SRCH) for 15 ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
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: 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: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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 41 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: markings : 114
lola: fired transitions : 113
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 37 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 39 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: CANCELED task # 42 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-14 (obsolete)
lola: LAUNCH task # 46 (type EXCL) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 44 (type FNDP) for 12 ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 47 (type EQUN) for 12 ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 50 (type SRCH) for 12 ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 37 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-14
lola: result : true
lola: fired transitions : 112
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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: FINISHED task # 50 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
lola: result : true
lola: markings : 167
lola: fired transitions : 166
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 44 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 47 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-13 (obsolete)
lola: LAUNCH task # 54 (type FNDP) for 9 ShieldPPPs-PT-050B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 9 ShieldPPPs-PT-050B-ReachabilityFireability-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type SRCH) for 9 ShieldPPPs-PT-050B-ReachabilityFireability-2024-10
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: FINISHED task # 57 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-10
lola: result : true
lola: markings : 152
lola: fired transitions : 151
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 54 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-10 (obsolete)
lola: CANCELED task # 55 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-10 (obsolete)
lola: LAUNCH task # 61 (type FNDP) for 6 ShieldPPPs-PT-050B-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 62 (type EQUN) for 6 ShieldPPPs-PT-050B-ReachabilityFireability-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type SRCH) for 6 ShieldPPPs-PT-050B-ReachabilityFireability-2024-06
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: FINISHED task # 61 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-06
lola: result : true
lola: fired transitions : 104
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 62 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-06 (obsolete)
lola: CANCELED task # 64 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-06 (obsolete)
lola: LAUNCH task # 34 (type FNDP) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type EQUN) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type SRCH) for 3 ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 44 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-13
lola: result : true
lola: fired transitions : 165
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 34 (type FNDP) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 108
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 35 (type EQUN) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 45 (type SRCH) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 46 (type EXCL) for ShieldPPPs-PT-050B-ReachabilityFireability-2024-05 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-050B-ReachabilityFireability-2024-04: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityFireability-2024-05: EF true findpath
ShieldPPPs-PT-050B-ReachabilityFireability-2024-06: AG false findpath
ShieldPPPs-PT-050B-ReachabilityFireability-2024-10: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityFireability-2024-13: EF true tandem / insertion
ShieldPPPs-PT-050B-ReachabilityFireability-2024-14: AG false tandem / insertion
ShieldPPPs-PT-050B-ReachabilityFireability-2024-15: EF true tandem / insertion
Time elapsed: 5 secs. Pages in use: 2
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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r373-tall-171683789000320"
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 '
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 ;