Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715400527.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679277799175

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:03:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 02:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:03:21] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2023-03-20 02:03:22] [INFO ] Transformed 6803 places.
[2023-03-20 02:03:22] [INFO ] Transformed 6303 transitions.
[2023-03-20 02:03:22] [INFO ] Found NUPN structural information;
[2023-03-20 02:03:22] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 686 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 708 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 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 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-20 02:03:23] [INFO ] Computed 1101 place invariants in 63 ms
[2023-03-20 02:03:28] [INFO ] [Real]Absence check using 1101 positive place invariants in 1337 ms returned sat
[2023-03-20 02:03:28] [INFO ] After 4733ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-20 02:03:32] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1097 ms returned sat
[2023-03-20 02:03:53] [INFO ] After 19429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-20 02:03:53] [INFO ] After 19443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 02:03:53] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 2 different solutions.
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 454 ms.
Support contains 275 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 633 transitions
Trivial Post-agglo rules discarded 633 transitions
Performed 633 trivial Post agglomeration. Transition count delta: 633
Iterating post reduction 0 with 633 rules applied. Total rules applied 633 place count 6803 transition count 5670
Reduce places removed 633 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 655 rules applied. Total rules applied 1288 place count 6170 transition count 5648
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 1310 place count 6148 transition count 5648
Performed 492 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 492 Pre rules applied. Total rules applied 1310 place count 6148 transition count 5156
Deduced a syphon composed of 492 places in 91 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 3 with 984 rules applied. Total rules applied 2294 place count 5656 transition count 5156
Discarding 648 places :
Symmetric choice reduction at 3 with 648 rule applications. Total rules 2942 place count 5008 transition count 4508
Iterating global reduction 3 with 648 rules applied. Total rules applied 3590 place count 5008 transition count 4508
Performed 242 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 242 Pre rules applied. Total rules applied 3590 place count 5008 transition count 4266
Deduced a syphon composed of 242 places in 43 ms
Reduce places removed 242 places and 0 transitions.
Iterating global reduction 3 with 484 rules applied. Total rules applied 4074 place count 4766 transition count 4266
Performed 1382 Post agglomeration using F-continuation condition.Transition count delta: 1382
Deduced a syphon composed of 1382 places in 26 ms
Reduce places removed 1382 places and 0 transitions.
Iterating global reduction 3 with 2764 rules applied. Total rules applied 6838 place count 3384 transition count 2884
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 820 times.
Drop transitions removed 820 transitions
Iterating global reduction 3 with 820 rules applied. Total rules applied 7658 place count 3384 transition count 2884
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 7659 place count 3383 transition count 2883
Applied a total of 7659 rules in 3348 ms. Remains 3383 /6803 variables (removed 3420) and now considering 2883/6303 (removed 3420) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3362 ms. Remains : 3383/6803 places, 2883/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 546 ms. (steps per millisecond=18 ) properties (out of 10) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2883 rows 3383 cols
[2023-03-20 02:03:59] [INFO ] Computed 1101 place invariants in 79 ms
[2023-03-20 02:04:01] [INFO ] [Real]Absence check using 1053 positive place invariants in 660 ms returned sat
[2023-03-20 02:04:01] [INFO ] [Real]Absence check using 1053 positive and 48 generalized place invariants in 60 ms returned sat
[2023-03-20 02:04:01] [INFO ] After 2138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 02:04:02] [INFO ] [Nat]Absence check using 1053 positive place invariants in 408 ms returned sat
[2023-03-20 02:04:02] [INFO ] [Nat]Absence check using 1053 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-20 02:04:12] [INFO ] After 8429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 02:04:13] [INFO ] Deduced a trap composed of 5 places in 995 ms of which 23 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 9 places in 2258 ms of which 34 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 7 places in 892 ms of which 2 ms to minimize.
[2023-03-20 02:04:17] [INFO ] Deduced a trap composed of 5 places in 920 ms of which 2 ms to minimize.
[2023-03-20 02:04:19] [INFO ] Deduced a trap composed of 4 places in 1094 ms of which 3 ms to minimize.
[2023-03-20 02:04:20] [INFO ] Deduced a trap composed of 4 places in 841 ms of which 2 ms to minimize.
[2023-03-20 02:04:21] [INFO ] Deduced a trap composed of 9 places in 884 ms of which 36 ms to minimize.
[2023-03-20 02:04:22] [INFO ] Deduced a trap composed of 4 places in 972 ms of which 2 ms to minimize.
[2023-03-20 02:04:23] [INFO ] Deduced a trap composed of 6 places in 790 ms of which 2 ms to minimize.
[2023-03-20 02:04:24] [INFO ] Deduced a trap composed of 16 places in 969 ms of which 2 ms to minimize.
[2023-03-20 02:04:25] [INFO ] Deduced a trap composed of 6 places in 900 ms of which 2 ms to minimize.
[2023-03-20 02:04:26] [INFO ] Deduced a trap composed of 5 places in 1412 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:04:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:04:26] [INFO ] After 25478ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1716 ms.
Support contains 274 out of 3383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3383/3383 places, 2883/2883 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3383 transition count 2882
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 3382 transition count 2882
Applied a total of 2 rules in 237 ms. Remains 3382 /3383 variables (removed 1) and now considering 2882/2883 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 3382/3383 places, 2882/2883 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 721 ms. (steps per millisecond=13 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2882 rows 3382 cols
[2023-03-20 02:04:30] [INFO ] Computed 1101 place invariants in 64 ms
[2023-03-20 02:04:32] [INFO ] [Real]Absence check using 1046 positive place invariants in 518 ms returned sat
[2023-03-20 02:04:32] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 28 ms returned sat
[2023-03-20 02:04:32] [INFO ] After 2262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:04:34] [INFO ] [Nat]Absence check using 1046 positive place invariants in 373 ms returned sat
[2023-03-20 02:04:34] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 291 ms returned sat
[2023-03-20 02:04:42] [INFO ] After 6834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:04:43] [INFO ] Deduced a trap composed of 4 places in 1208 ms of which 3 ms to minimize.
[2023-03-20 02:04:44] [INFO ] Deduced a trap composed of 9 places in 1184 ms of which 3 ms to minimize.
[2023-03-20 02:04:46] [INFO ] Deduced a trap composed of 9 places in 1178 ms of which 2 ms to minimize.
[2023-03-20 02:04:47] [INFO ] Deduced a trap composed of 9 places in 1562 ms of which 16 ms to minimize.
[2023-03-20 02:04:49] [INFO ] Deduced a trap composed of 7 places in 1378 ms of which 2 ms to minimize.
[2023-03-20 02:04:52] [INFO ] Deduced a trap composed of 6 places in 3410 ms of which 2 ms to minimize.
[2023-03-20 02:04:54] [INFO ] Deduced a trap composed of 8 places in 1396 ms of which 2 ms to minimize.
[2023-03-20 02:04:55] [INFO ] Deduced a trap composed of 5 places in 1077 ms of which 3 ms to minimize.
[2023-03-20 02:04:56] [INFO ] Deduced a trap composed of 11 places in 1337 ms of which 2 ms to minimize.
[2023-03-20 02:04:59] [INFO ] Deduced a trap composed of 13 places in 1959 ms of which 14 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:04:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:04:59] [INFO ] After 26264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1450 ms.
Support contains 223 out of 3382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3382/3382 places, 2882/2882 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 3382 transition count 2876
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 3376 transition count 2875
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 3375 transition count 2875
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 3375 transition count 2868
Deduced a syphon composed of 7 places in 11 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 3368 transition count 2868
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 11 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 100 place count 3332 transition count 2832
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 3332 transition count 2832
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 3331 transition count 2831
Applied a total of 109 rules in 746 ms. Remains 3331 /3382 variables (removed 51) and now considering 2831/2882 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 3331/3382 places, 2831/2882 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 596 ms. (steps per millisecond=16 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 46864 steps, run timeout after 3002 ms. (steps per millisecond=15 ) properties seen :{}
Probabilistic random walk after 46864 steps, saw 45076 distinct states, run finished after 3004 ms. (steps per millisecond=15 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2831 rows 3331 cols
[2023-03-20 02:05:05] [INFO ] Computed 1101 place invariants in 19 ms
[2023-03-20 02:05:07] [INFO ] [Real]Absence check using 1046 positive place invariants in 550 ms returned sat
[2023-03-20 02:05:07] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 30 ms returned sat
[2023-03-20 02:05:07] [INFO ] After 1677ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:05:09] [INFO ] [Nat]Absence check using 1046 positive place invariants in 433 ms returned sat
[2023-03-20 02:05:09] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-20 02:05:25] [INFO ] After 15748ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:05:26] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 2 ms to minimize.
[2023-03-20 02:05:27] [INFO ] Deduced a trap composed of 4 places in 971 ms of which 2 ms to minimize.
[2023-03-20 02:05:28] [INFO ] Deduced a trap composed of 8 places in 1264 ms of which 3 ms to minimize.
[2023-03-20 02:05:29] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 2 ms to minimize.
[2023-03-20 02:05:30] [INFO ] Deduced a trap composed of 4 places in 760 ms of which 2 ms to minimize.
[2023-03-20 02:05:31] [INFO ] Deduced a trap composed of 8 places in 861 ms of which 2 ms to minimize.
[2023-03-20 02:05:32] [INFO ] Deduced a trap composed of 7 places in 778 ms of which 2 ms to minimize.
[2023-03-20 02:05:36] [INFO ] Deduced a trap composed of 3 places in 3725 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:05:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:05:36] [INFO ] After 28750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1540 ms.
Support contains 223 out of 3331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 182 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 3331/3331 places, 2831/2831 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 151 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
[2023-03-20 02:05:38] [INFO ] Invariant cache hit.
[2023-03-20 02:05:42] [INFO ] Implicit Places using invariants in 4227 ms returned []
[2023-03-20 02:05:42] [INFO ] Invariant cache hit.
[2023-03-20 02:05:50] [INFO ] Implicit Places using invariants and state equation in 8248 ms returned []
Implicit Place search using SMT with State Equation took 12494 ms to find 0 implicit places.
[2023-03-20 02:05:51] [INFO ] Redundant transitions in 305 ms returned []
[2023-03-20 02:05:51] [INFO ] Invariant cache hit.
[2023-03-20 02:05:54] [INFO ] Dead Transitions using invariants and state equation in 3169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16138 ms. Remains : 3331/3331 places, 2831/2831 transitions.
Applied a total of 0 rules in 215 ms. Remains 3331 /3331 variables (removed 0) and now considering 2831/2831 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-20 02:05:54] [INFO ] Invariant cache hit.
[2023-03-20 02:05:55] [INFO ] [Real]Absence check using 1046 positive place invariants in 318 ms returned sat
[2023-03-20 02:05:55] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 14 ms returned sat
[2023-03-20 02:05:55] [INFO ] After 1349ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:05:57] [INFO ] [Nat]Absence check using 1046 positive place invariants in 376 ms returned sat
[2023-03-20 02:05:57] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 60 ms returned sat
[2023-03-20 02:06:06] [INFO ] After 8606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:06:07] [INFO ] Deduced a trap composed of 4 places in 914 ms of which 2 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 9 places in 834 ms of which 2 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 8 places in 661 ms of which 2 ms to minimize.
[2023-03-20 02:06:10] [INFO ] Deduced a trap composed of 11 places in 905 ms of which 21 ms to minimize.
[2023-03-20 02:06:11] [INFO ] Deduced a trap composed of 8 places in 806 ms of which 3 ms to minimize.
[2023-03-20 02:06:12] [INFO ] Deduced a trap composed of 4 places in 1103 ms of which 1 ms to minimize.
[2023-03-20 02:06:13] [INFO ] Deduced a trap composed of 6 places in 876 ms of which 1 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Deduced a trap composed of 7 places in 1153 ms of which 2 ms to minimize.
[2023-03-20 02:06:16] [INFO ] Deduced a trap composed of 7 places in 1047 ms of which 2 ms to minimize.
[2023-03-20 02:06:17] [INFO ] Deduced a trap composed of 7 places in 1230 ms of which 3 ms to minimize.
[2023-03-20 02:06:18] [INFO ] Deduced a trap composed of 9 places in 895 ms of which 2 ms to minimize.
[2023-03-20 02:06:19] [INFO ] Deduced a trap composed of 5 places in 1107 ms of which 2 ms to minimize.
[2023-03-20 02:06:21] [INFO ] Deduced a trap composed of 6 places in 977 ms of which 22 ms to minimize.
[2023-03-20 02:06:23] [INFO ] Deduced a trap composed of 8 places in 2289 ms of which 2 ms to minimize.
[2023-03-20 02:06:29] [INFO ] Deduced a trap composed of 9 places in 6289 ms of which 32 ms to minimize.
[2023-03-20 02:06:33] [INFO ] Deduced a trap composed of 5 places in 3019 ms of which 1 ms to minimize.
[2023-03-20 02:06:34] [INFO ] Deduced a trap composed of 5 places in 1033 ms of which 3 ms to minimize.
[2023-03-20 02:06:35] [INFO ] Deduced a trap composed of 8 places in 821 ms of which 3 ms to minimize.
[2023-03-20 02:06:36] [INFO ] Deduced a trap composed of 6 places in 913 ms of which 1 ms to minimize.
[2023-03-20 02:06:37] [INFO ] Deduced a trap composed of 4 places in 960 ms of which 2 ms to minimize.
[2023-03-20 02:06:38] [INFO ] Deduced a trap composed of 4 places in 912 ms of which 2 ms to minimize.
[2023-03-20 02:06:39] [INFO ] Deduced a trap composed of 8 places in 930 ms of which 2 ms to minimize.
[2023-03-20 02:06:40] [INFO ] Deduced a trap composed of 12 places in 908 ms of which 1 ms to minimize.
[2023-03-20 02:06:41] [INFO ] Deduced a trap composed of 18 places in 709 ms of which 4 ms to minimize.
[2023-03-20 02:06:42] [INFO ] Deduced a trap composed of 18 places in 929 ms of which 2 ms to minimize.
[2023-03-20 02:06:43] [INFO ] Deduced a trap composed of 8 places in 693 ms of which 2 ms to minimize.
[2023-03-20 02:06:43] [INFO ] Deduced a trap composed of 5 places in 666 ms of which 2 ms to minimize.
[2023-03-20 02:06:44] [INFO ] Deduced a trap composed of 12 places in 720 ms of which 1 ms to minimize.
[2023-03-20 02:06:49] [INFO ] Deduced a trap composed of 11 places in 4399 ms of which 2 ms to minimize.
[2023-03-20 02:06:50] [INFO ] Deduced a trap composed of 10 places in 1196 ms of which 2 ms to minimize.
[2023-03-20 02:06:51] [INFO ] Deduced a trap composed of 14 places in 820 ms of which 1 ms to minimize.
[2023-03-20 02:06:52] [INFO ] Deduced a trap composed of 8 places in 732 ms of which 2 ms to minimize.
[2023-03-20 02:06:53] [INFO ] Deduced a trap composed of 9 places in 1071 ms of which 2 ms to minimize.
[2023-03-20 02:06:54] [INFO ] Deduced a trap composed of 10 places in 939 ms of which 3 ms to minimize.
[2023-03-20 02:06:55] [INFO ] Deduced a trap composed of 11 places in 807 ms of which 13 ms to minimize.
[2023-03-20 02:06:56] [INFO ] Deduced a trap composed of 13 places in 912 ms of which 2 ms to minimize.
[2023-03-20 02:06:57] [INFO ] Deduced a trap composed of 11 places in 740 ms of which 2 ms to minimize.
[2023-03-20 02:06:58] [INFO ] Deduced a trap composed of 12 places in 715 ms of which 27 ms to minimize.
[2023-03-20 02:06:59] [INFO ] Deduced a trap composed of 10 places in 906 ms of which 6 ms to minimize.
[2023-03-20 02:07:00] [INFO ] Deduced a trap composed of 9 places in 1143 ms of which 2 ms to minimize.
[2023-03-20 02:07:02] [INFO ] Deduced a trap composed of 11 places in 1245 ms of which 2 ms to minimize.
[2023-03-20 02:07:04] [INFO ] Deduced a trap composed of 12 places in 1602 ms of which 1 ms to minimize.
[2023-03-20 02:07:08] [INFO ] Deduced a trap composed of 9 places in 4074 ms of which 2 ms to minimize.
[2023-03-20 02:07:09] [INFO ] Deduced a trap composed of 12 places in 1344 ms of which 3 ms to minimize.
[2023-03-20 02:07:10] [INFO ] Deduced a trap composed of 14 places in 1005 ms of which 3 ms to minimize.
[2023-03-20 02:07:11] [INFO ] Deduced a trap composed of 10 places in 892 ms of which 2 ms to minimize.
[2023-03-20 02:07:13] [INFO ] Deduced a trap composed of 11 places in 1032 ms of which 1 ms to minimize.
[2023-03-20 02:07:14] [INFO ] Deduced a trap composed of 23 places in 893 ms of which 2 ms to minimize.
[2023-03-20 02:07:15] [INFO ] Deduced a trap composed of 9 places in 927 ms of which 1 ms to minimize.
[2023-03-20 02:07:16] [INFO ] Deduced a trap composed of 10 places in 808 ms of which 2 ms to minimize.
[2023-03-20 02:07:17] [INFO ] Deduced a trap composed of 14 places in 955 ms of which 2 ms to minimize.
[2023-03-20 02:07:18] [INFO ] Deduced a trap composed of 10 places in 882 ms of which 2 ms to minimize.
[2023-03-20 02:07:19] [INFO ] Deduced a trap composed of 10 places in 863 ms of which 1 ms to minimize.
[2023-03-20 02:07:20] [INFO ] Deduced a trap composed of 12 places in 697 ms of which 1 ms to minimize.
[2023-03-20 02:07:21] [INFO ] Deduced a trap composed of 12 places in 716 ms of which 1 ms to minimize.
[2023-03-20 02:07:21] [INFO ] Deduced a trap composed of 14 places in 679 ms of which 2 ms to minimize.
[2023-03-20 02:07:22] [INFO ] Deduced a trap composed of 15 places in 597 ms of which 1 ms to minimize.
[2023-03-20 02:07:26] [INFO ] Deduced a trap composed of 14 places in 3287 ms of which 2 ms to minimize.
[2023-03-20 02:07:27] [INFO ] Deduced a trap composed of 13 places in 1305 ms of which 1 ms to minimize.
[2023-03-20 02:07:29] [INFO ] Deduced a trap composed of 14 places in 2089 ms of which 2 ms to minimize.
[2023-03-20 02:07:30] [INFO ] Deduced a trap composed of 14 places in 702 ms of which 1 ms to minimize.
[2023-03-20 02:07:31] [INFO ] Deduced a trap composed of 12 places in 1027 ms of which 2 ms to minimize.
[2023-03-20 02:07:32] [INFO ] Deduced a trap composed of 12 places in 786 ms of which 2 ms to minimize.
[2023-03-20 02:07:33] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 1 ms to minimize.
[2023-03-20 02:07:34] [INFO ] Deduced a trap composed of 12 places in 931 ms of which 2 ms to minimize.
[2023-03-20 02:07:35] [INFO ] Deduced a trap composed of 20 places in 811 ms of which 2 ms to minimize.
[2023-03-20 02:07:36] [INFO ] Deduced a trap composed of 13 places in 863 ms of which 20 ms to minimize.
[2023-03-20 02:07:37] [INFO ] Deduced a trap composed of 37 places in 743 ms of which 2 ms to minimize.
[2023-03-20 02:07:38] [INFO ] Deduced a trap composed of 13 places in 727 ms of which 7 ms to minimize.
[2023-03-20 02:07:38] [INFO ] Deduced a trap composed of 29 places in 634 ms of which 1 ms to minimize.
[2023-03-20 02:07:40] [INFO ] Deduced a trap composed of 12 places in 1166 ms of which 1 ms to minimize.
[2023-03-20 02:07:41] [INFO ] Deduced a trap composed of 23 places in 704 ms of which 2 ms to minimize.
[2023-03-20 02:07:42] [INFO ] Deduced a trap composed of 17 places in 1243 ms of which 1 ms to minimize.
[2023-03-20 02:07:43] [INFO ] Deduced a trap composed of 14 places in 910 ms of which 2 ms to minimize.
[2023-03-20 02:07:44] [INFO ] Deduced a trap composed of 14 places in 749 ms of which 2 ms to minimize.
[2023-03-20 02:07:45] [INFO ] Deduced a trap composed of 24 places in 906 ms of which 1 ms to minimize.
[2023-03-20 02:07:46] [INFO ] Deduced a trap composed of 28 places in 859 ms of which 1 ms to minimize.
[2023-03-20 02:07:46] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 100123 ms
[2023-03-20 02:07:47] [INFO ] Deduced a trap composed of 5 places in 529 ms of which 1 ms to minimize.
[2023-03-20 02:07:48] [INFO ] Deduced a trap composed of 9 places in 547 ms of which 1 ms to minimize.
[2023-03-20 02:07:48] [INFO ] Deduced a trap composed of 10 places in 399 ms of which 0 ms to minimize.
[2023-03-20 02:07:49] [INFO ] Deduced a trap composed of 8 places in 641 ms of which 2 ms to minimize.
[2023-03-20 02:07:50] [INFO ] Deduced a trap composed of 10 places in 475 ms of which 1 ms to minimize.
[2023-03-20 02:07:50] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
[2023-03-20 02:07:51] [INFO ] Deduced a trap composed of 12 places in 470 ms of which 1 ms to minimize.
[2023-03-20 02:07:52] [INFO ] Deduced a trap composed of 13 places in 504 ms of which 1 ms to minimize.
[2023-03-20 02:07:53] [INFO ] Deduced a trap composed of 12 places in 618 ms of which 1 ms to minimize.
[2023-03-20 02:07:53] [INFO ] Deduced a trap composed of 9 places in 578 ms of which 2 ms to minimize.
[2023-03-20 02:07:54] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-20 02:07:54] [INFO ] Deduced a trap composed of 13 places in 548 ms of which 1 ms to minimize.
[2023-03-20 02:07:55] [INFO ] Deduced a trap composed of 5 places in 446 ms of which 1 ms to minimize.
[2023-03-20 02:07:56] [INFO ] Deduced a trap composed of 24 places in 422 ms of which 1 ms to minimize.
[2023-03-20 02:07:56] [INFO ] Deduced a trap composed of 18 places in 450 ms of which 1 ms to minimize.
[2023-03-20 02:07:57] [INFO ] Deduced a trap composed of 12 places in 570 ms of which 13 ms to minimize.
[2023-03-20 02:07:58] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 1 ms to minimize.
[2023-03-20 02:07:58] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 11218 ms
[2023-03-20 02:07:59] [INFO ] Deduced a trap composed of 19 places in 788 ms of which 2 ms to minimize.
[2023-03-20 02:08:00] [INFO ] Deduced a trap composed of 4 places in 712 ms of which 2 ms to minimize.
[2023-03-20 02:08:01] [INFO ] Deduced a trap composed of 14 places in 773 ms of which 2 ms to minimize.
[2023-03-20 02:08:02] [INFO ] Deduced a trap composed of 6 places in 743 ms of which 1 ms to minimize.
[2023-03-20 02:08:03] [INFO ] Deduced a trap composed of 9 places in 919 ms of which 1 ms to minimize.
[2023-03-20 02:08:04] [INFO ] Deduced a trap composed of 10 places in 777 ms of which 1 ms to minimize.
[2023-03-20 02:08:05] [INFO ] Deduced a trap composed of 9 places in 901 ms of which 1 ms to minimize.
[2023-03-20 02:08:06] [INFO ] Deduced a trap composed of 12 places in 623 ms of which 1 ms to minimize.
[2023-03-20 02:08:07] [INFO ] Deduced a trap composed of 11 places in 709 ms of which 1 ms to minimize.
[2023-03-20 02:08:08] [INFO ] Deduced a trap composed of 13 places in 830 ms of which 2 ms to minimize.
[2023-03-20 02:08:08] [INFO ] Deduced a trap composed of 13 places in 595 ms of which 2 ms to minimize.
[2023-03-20 02:08:09] [INFO ] Deduced a trap composed of 7 places in 651 ms of which 1 ms to minimize.
[2023-03-20 02:08:10] [INFO ] Deduced a trap composed of 14 places in 575 ms of which 1 ms to minimize.
[2023-03-20 02:08:11] [INFO ] Deduced a trap composed of 12 places in 645 ms of which 1 ms to minimize.
[2023-03-20 02:08:12] [INFO ] Deduced a trap composed of 13 places in 965 ms of which 3 ms to minimize.
[2023-03-20 02:08:13] [INFO ] Deduced a trap composed of 9 places in 678 ms of which 1 ms to minimize.
[2023-03-20 02:08:13] [INFO ] Deduced a trap composed of 9 places in 552 ms of which 2 ms to minimize.
[2023-03-20 02:08:14] [INFO ] Deduced a trap composed of 6 places in 662 ms of which 1 ms to minimize.
[2023-03-20 02:08:15] [INFO ] Deduced a trap composed of 7 places in 976 ms of which 2 ms to minimize.
[2023-03-20 02:08:16] [INFO ] Deduced a trap composed of 7 places in 927 ms of which 1 ms to minimize.
[2023-03-20 02:08:17] [INFO ] Deduced a trap composed of 12 places in 576 ms of which 2 ms to minimize.
[2023-03-20 02:08:18] [INFO ] Deduced a trap composed of 9 places in 566 ms of which 1 ms to minimize.
[2023-03-20 02:08:19] [INFO ] Deduced a trap composed of 12 places in 1042 ms of which 3 ms to minimize.
[2023-03-20 02:08:19] [INFO ] Deduced a trap composed of 8 places in 538 ms of which 1 ms to minimize.
[2023-03-20 02:08:20] [INFO ] Deduced a trap composed of 11 places in 736 ms of which 2 ms to minimize.
[2023-03-20 02:08:21] [INFO ] Deduced a trap composed of 13 places in 913 ms of which 2 ms to minimize.
[2023-03-20 02:08:22] [INFO ] Deduced a trap composed of 16 places in 800 ms of which 1 ms to minimize.
[2023-03-20 02:08:23] [INFO ] Deduced a trap composed of 8 places in 661 ms of which 1 ms to minimize.
[2023-03-20 02:08:24] [INFO ] Deduced a trap composed of 7 places in 981 ms of which 2 ms to minimize.
[2023-03-20 02:08:26] [INFO ] Deduced a trap composed of 7 places in 1179 ms of which 1 ms to minimize.
[2023-03-20 02:08:26] [INFO ] Deduced a trap composed of 23 places in 643 ms of which 1 ms to minimize.
[2023-03-20 02:08:27] [INFO ] Deduced a trap composed of 23 places in 757 ms of which 2 ms to minimize.
[2023-03-20 02:08:28] [INFO ] Deduced a trap composed of 16 places in 686 ms of which 1 ms to minimize.
[2023-03-20 02:08:29] [INFO ] Deduced a trap composed of 13 places in 1024 ms of which 36 ms to minimize.
[2023-03-20 02:08:30] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 31487 ms
[2023-03-20 02:08:38] [INFO ] Deduced a trap composed of 17 places in 624 ms of which 1 ms to minimize.
[2023-03-20 02:08:39] [INFO ] Deduced a trap composed of 7 places in 622 ms of which 2 ms to minimize.
[2023-03-20 02:08:40] [INFO ] Deduced a trap composed of 10 places in 551 ms of which 1 ms to minimize.
[2023-03-20 02:08:41] [INFO ] Deduced a trap composed of 11 places in 566 ms of which 1 ms to minimize.
[2023-03-20 02:08:41] [INFO ] Deduced a trap composed of 6 places in 736 ms of which 2 ms to minimize.
[2023-03-20 02:08:42] [INFO ] Deduced a trap composed of 11 places in 683 ms of which 1 ms to minimize.
[2023-03-20 02:08:44] [INFO ] Deduced a trap composed of 11 places in 893 ms of which 2 ms to minimize.
[2023-03-20 02:08:45] [INFO ] Deduced a trap composed of 10 places in 520 ms of which 1 ms to minimize.
[2023-03-20 02:08:46] [INFO ] Deduced a trap composed of 13 places in 746 ms of which 0 ms to minimize.
[2023-03-20 02:08:47] [INFO ] Deduced a trap composed of 8 places in 581 ms of which 1 ms to minimize.
[2023-03-20 02:08:47] [INFO ] Deduced a trap composed of 12 places in 444 ms of which 1 ms to minimize.
[2023-03-20 02:08:48] [INFO ] Deduced a trap composed of 6 places in 702 ms of which 1 ms to minimize.
[2023-03-20 02:08:53] [INFO ] Deduced a trap composed of 7 places in 4172 ms of which 1 ms to minimize.
[2023-03-20 02:08:54] [INFO ] Deduced a trap composed of 10 places in 592 ms of which 1 ms to minimize.
[2023-03-20 02:08:55] [INFO ] Deduced a trap composed of 11 places in 897 ms of which 1 ms to minimize.
[2023-03-20 02:08:55] [INFO ] Deduced a trap composed of 7 places in 558 ms of which 1 ms to minimize.
[2023-03-20 02:08:56] [INFO ] Deduced a trap composed of 8 places in 485 ms of which 1 ms to minimize.
[2023-03-20 02:08:59] [INFO ] Deduced a trap composed of 12 places in 2936 ms of which 1 ms to minimize.
[2023-03-20 02:09:03] [INFO ] Deduced a trap composed of 12 places in 3000 ms of which 3 ms to minimize.
[2023-03-20 02:09:04] [INFO ] Deduced a trap composed of 13 places in 637 ms of which 2 ms to minimize.
[2023-03-20 02:09:04] [INFO ] Deduced a trap composed of 12 places in 508 ms of which 1 ms to minimize.
[2023-03-20 02:09:06] [INFO ] Deduced a trap composed of 11 places in 1251 ms of which 1 ms to minimize.
[2023-03-20 02:09:07] [INFO ] Deduced a trap composed of 8 places in 717 ms of which 1 ms to minimize.
[2023-03-20 02:09:07] [INFO ] Deduced a trap composed of 7 places in 447 ms of which 1 ms to minimize.
[2023-03-20 02:09:08] [INFO ] Deduced a trap composed of 15 places in 383 ms of which 1 ms to minimize.
[2023-03-20 02:09:08] [INFO ] Deduced a trap composed of 14 places in 576 ms of which 1 ms to minimize.
[2023-03-20 02:09:09] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2023-03-20 02:09:10] [INFO ] Deduced a trap composed of 11 places in 406 ms of which 1 ms to minimize.
[2023-03-20 02:09:10] [INFO ] Deduced a trap composed of 9 places in 473 ms of which 1 ms to minimize.
[2023-03-20 02:09:11] [INFO ] Deduced a trap composed of 10 places in 778 ms of which 0 ms to minimize.
[2023-03-20 02:09:12] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2023-03-20 02:09:13] [INFO ] Deduced a trap composed of 12 places in 682 ms of which 1 ms to minimize.
[2023-03-20 02:09:13] [INFO ] Deduced a trap composed of 14 places in 433 ms of which 1 ms to minimize.
[2023-03-20 02:09:14] [INFO ] Deduced a trap composed of 13 places in 642 ms of which 1 ms to minimize.
[2023-03-20 02:09:15] [INFO ] Deduced a trap composed of 13 places in 351 ms of which 1 ms to minimize.
[2023-03-20 02:09:15] [INFO ] Deduced a trap composed of 9 places in 496 ms of which 0 ms to minimize.
[2023-03-20 02:09:16] [INFO ] Deduced a trap composed of 14 places in 363 ms of which 1 ms to minimize.
[2023-03-20 02:09:16] [INFO ] Deduced a trap composed of 12 places in 342 ms of which 1 ms to minimize.
[2023-03-20 02:09:17] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2023-03-20 02:09:18] [INFO ] Deduced a trap composed of 15 places in 419 ms of which 1 ms to minimize.
[2023-03-20 02:09:18] [INFO ] Deduced a trap composed of 12 places in 528 ms of which 1 ms to minimize.
[2023-03-20 02:09:19] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 0 ms to minimize.
[2023-03-20 02:09:20] [INFO ] Deduced a trap composed of 7 places in 426 ms of which 1 ms to minimize.
[2023-03-20 02:09:21] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 0 ms to minimize.
[2023-03-20 02:09:21] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 0 ms to minimize.
[2023-03-20 02:09:22] [INFO ] Deduced a trap composed of 13 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:09:22] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 1 ms to minimize.
[2023-03-20 02:09:23] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:09:23] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 1 ms to minimize.
[2023-03-20 02:09:24] [INFO ] Deduced a trap composed of 18 places in 316 ms of which 1 ms to minimize.
[2023-03-20 02:09:31] [INFO ] Deduced a trap composed of 7 places in 429 ms of which 0 ms to minimize.
[2023-03-20 02:09:32] [INFO ] Deduced a trap composed of 6 places in 479 ms of which 1 ms to minimize.
[2023-03-20 02:09:32] [INFO ] Deduced a trap composed of 6 places in 415 ms of which 1 ms to minimize.
[2023-03-20 02:09:33] [INFO ] Deduced a trap composed of 10 places in 382 ms of which 1 ms to minimize.
[2023-03-20 02:09:33] [INFO ] Deduced a trap composed of 10 places in 338 ms of which 0 ms to minimize.
[2023-03-20 02:09:34] [INFO ] Deduced a trap composed of 10 places in 401 ms of which 2 ms to minimize.
[2023-03-20 02:09:34] [INFO ] Deduced a trap composed of 12 places in 469 ms of which 1 ms to minimize.
[2023-03-20 02:09:35] [INFO ] Deduced a trap composed of 10 places in 481 ms of which 1 ms to minimize.
[2023-03-20 02:09:38] [INFO ] Deduced a trap composed of 10 places in 2896 ms of which 2 ms to minimize.
[2023-03-20 02:09:39] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 1 ms to minimize.
[2023-03-20 02:09:39] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 1 ms to minimize.
[2023-03-20 02:09:40] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 0 ms to minimize.
[2023-03-20 02:09:40] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:09:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:09:40] [INFO ] After 225116ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
[2023-03-20 02:09:40] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2023-03-20 02:09:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3331 places, 2831 transitions and 12613 arcs took 13 ms.
[2023-03-20 02:09:41] [INFO ] Flatten gal took : 293 ms
Total runtime 379902 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-100B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/378
ReachabilityFireability

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679278207349

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/378/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/378/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/378/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: Rule S: 0 transitions removed,0 places removed
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: 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 # 29 (type EXCL) for 6 ShieldPPPs-PT-100B-ReachabilityFireability-07
lola: time limit : 446 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 6 ShieldPPPs-PT-100B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 6 ShieldPPPs-PT-100B-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 6 ShieldPPPs-PT-100B-ReachabilityFireability-07
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 # 28 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-07
lola: result : true
lola: markings : 114
lola: fired transitions : 113
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-07 (obsolete)
lola: FINISHED task # 25 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-07
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: LAUNCH task # 36 (type EXCL) for 18 ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: time limit : 510 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 32 (type FNDP) for 18 ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 18 ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 18 ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 35 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: result : true
lola: markings : 140
lola: fired transitions : 139
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 32 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 33 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-14 (obsolete)
lola: LAUNCH task # 42 (type EXCL) for 9 ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: time limit : 595 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 44 (type FNDP) for 21 ShieldPPPs-PT-100B-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type EQUN) for 21 ShieldPPPs-PT-100B-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 47 (type SRCH) for 21 ShieldPPPs-PT-100B-ReachabilityFireability-15
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: FINISHED task # 44 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-15
lola: result : true
lola: fired transitions : 136
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 45 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 47 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 50 (type FNDP) for 0 ShieldPPPs-PT-100B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 0 ShieldPPPs-PT-100B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 0 ShieldPPPs-PT-100B-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 53 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-00
lola: result : true
lola: markings : 170
lola: fired transitions : 169
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 50 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 51 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-00 (obsolete)
lola: LAUNCH task # 38 (type FNDP) for 9 ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type EQUN) for 9 ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type SRCH) for 9 ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 32 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 138
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 50 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-00
lola: result : true
lola: fired transitions : 168
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 # 41 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: result : true
lola: markings : 204
lola: fired transitions : 203
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 38 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 39 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 42 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 60 (type EXCL) for 12 ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: time limit : 1191 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 56 (type FNDP) for 12 ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type EQUN) for 12 ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 59 (type SRCH) for 12 ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 38 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 202
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-51.sara.
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-45.sara.
sara: try reading problem file /home/mcc/execution/378/ReachabilityFireability-39.sara.
lola: FINISHED task # 59 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: result : true
lola: markings : 479
lola: fired transitions : 478
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 56 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 57 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 60 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-10 (obsolete)
lola: FINISHED task # 56 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-10
lola: result : unknown
lola: fired transitions : 1145
lola: tried executions : 76
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: LAUNCH task # 67 (type EXCL) for 15 ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: time limit : 1787 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 63 (type FNDP) for 15 ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 64 (type EQUN) for 15 ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 66 (type SRCH) for 15 ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 66 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: result : false
lola: markings : 2627
lola: fired transitions : 6756
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 63 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 64 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 67 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-12 (obsolete)
lola: LAUNCH task # 73 (type EXCL) for 3 ShieldPPPs-PT-100B-ReachabilityFireability-04
lola: time limit : 3574 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 69 (type FNDP) for 3 ShieldPPPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 70 (type EQUN) for 3 ShieldPPPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 72 (type SRCH) for 3 ShieldPPPs-PT-100B-ReachabilityFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 63 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-12
lola: result : unknown
lola: fired transitions : 7809
lola: tried executions : 466
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 69 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityFireability-04
lola: result : true
lola: fired transitions : 218
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 70 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 72 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: CANCELED task # 73 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityFireability-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-ReachabilityFireability-00: EF true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-04: EF true findpath
ShieldPPPs-PT-100B-ReachabilityFireability-07: AG false tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-08: EF true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-10: EF true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-12: AG true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-14: AG false tandem / insertion
ShieldPPPs-PT-100B-ReachabilityFireability-15: EF true findpath


Time elapsed: 26 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715400527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-100B.tgz
mv ShieldPPPs-PT-100B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;