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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5813.760 195825.00 3716492.00 213.20 FTTFFTTFFTTFFFTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715400526.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715400526
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679277789321

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=ReachabilityCardinality
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:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:03:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:03:12] [INFO ] Load time of PNML (sax parser for PT used): 239 ms
[2023-03-20 02:03:12] [INFO ] Transformed 6803 places.
[2023-03-20 02:03:12] [INFO ] Transformed 6303 transitions.
[2023-03-20 02:03:12] [INFO ] Found NUPN structural information;
[2023-03-20 02:03:12] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 672 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 693 ms. (steps per millisecond=14 ) properties (out of 13) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 37 ms. (steps per millisecond=270 ) 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 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 103878 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{1=1, 10=1}
Probabilistic random walk after 103878 steps, saw 102330 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 6303 rows 6803 cols
[2023-03-20 02:03:16] [INFO ] Computed 1101 place invariants in 88 ms
[2023-03-20 02:03:20] [INFO ] After 3108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 02:03:23] [INFO ] [Nat]Absence check using 1101 positive place invariants in 1067 ms returned sat
[2023-03-20 02:03:45] [INFO ] After 19911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 02:03:45] [INFO ] After 19955ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 02:03:45] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 2270 ms.
Support contains 56 out of 6803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Drop transitions removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 684 rules applied. Total rules applied 684 place count 6803 transition count 5619
Reduce places removed 684 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 694 rules applied. Total rules applied 1378 place count 6119 transition count 5609
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1388 place count 6109 transition count 5609
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1388 place count 6109 transition count 5109
Deduced a syphon composed of 500 places in 25 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2388 place count 5609 transition count 5109
Discarding 684 places :
Symmetric choice reduction at 3 with 684 rule applications. Total rules 3072 place count 4925 transition count 4425
Iterating global reduction 3 with 684 rules applied. Total rules applied 3756 place count 4925 transition count 4425
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 3756 place count 4925 transition count 4139
Deduced a syphon composed of 286 places in 62 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 4328 place count 4639 transition count 4139
Performed 1484 Post agglomeration using F-continuation condition.Transition count delta: 1484
Deduced a syphon composed of 1484 places in 8 ms
Reduce places removed 1484 places and 0 transitions.
Iterating global reduction 3 with 2968 rules applied. Total rules applied 7296 place count 3155 transition count 2655
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 880 times.
Drop transitions removed 880 transitions
Iterating global reduction 3 with 880 rules applied. Total rules applied 8176 place count 3155 transition count 2655
Applied a total of 8176 rules in 2845 ms. Remains 3155 /6803 variables (removed 3648) and now considering 2655/6303 (removed 3648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2846 ms. Remains : 3155/6803 places, 2655/6303 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=21 ) properties (out of 10) seen :2
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 150 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 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 2655 rows 3155 cols
[2023-03-20 02:03:52] [INFO ] Computed 1101 place invariants in 161 ms
[2023-03-20 02:03:53] [INFO ] After 1071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 02:03:54] [INFO ] [Nat]Absence check using 1041 positive place invariants in 270 ms returned sat
[2023-03-20 02:03:54] [INFO ] [Nat]Absence check using 1041 positive and 60 generalized place invariants in 39 ms returned sat
[2023-03-20 02:04:07] [INFO ] After 12553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:04:08] [INFO ] Deduced a trap composed of 5 places in 359 ms of which 7 ms to minimize.
[2023-03-20 02:04:08] [INFO ] Deduced a trap composed of 7 places in 415 ms of which 1 ms to minimize.
[2023-03-20 02:04:09] [INFO ] Deduced a trap composed of 7 places in 678 ms of which 14 ms to minimize.
[2023-03-20 02:04:10] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 3 ms to minimize.
[2023-03-20 02:04:10] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2023-03-20 02:04:11] [INFO ] Deduced a trap composed of 10 places in 587 ms of which 2 ms to minimize.
[2023-03-20 02:04:12] [INFO ] Deduced a trap composed of 10 places in 585 ms of which 1 ms to minimize.
[2023-03-20 02:04:12] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 0 ms to minimize.
[2023-03-20 02:04:13] [INFO ] Deduced a trap composed of 8 places in 394 ms of which 1 ms to minimize.
[2023-03-20 02:04:13] [INFO ] Deduced a trap composed of 8 places in 317 ms of which 1 ms to minimize.
[2023-03-20 02:04:14] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 1 ms to minimize.
[2023-03-20 02:04:14] [INFO ] Deduced a trap composed of 7 places in 313 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 9 places in 357 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 5 places in 398 ms of which 1 ms to minimize.
[2023-03-20 02:04:15] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 1 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 9 places in 362 ms of which 1 ms to minimize.
[2023-03-20 02:04:16] [INFO ] Deduced a trap composed of 10 places in 450 ms of which 1 ms to minimize.
[2023-03-20 02:04:17] [INFO ] Deduced a trap composed of 7 places in 535 ms of which 1 ms to minimize.
[2023-03-20 02:04:18] [INFO ] Deduced a trap composed of 9 places in 370 ms of which 1 ms to minimize.
[2023-03-20 02:04:18] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:04:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:04:18] [INFO ] After 25397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 1337 ms.
Support contains 50 out of 3155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3155/3155 places, 2655/2655 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 3152 transition count 2652
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 3151 transition count 2651
Applied a total of 7 rules in 484 ms. Remains 3151 /3155 variables (removed 4) and now considering 2651/2655 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 484 ms. Remains : 3151/3155 places, 2651/2655 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 574 ms. (steps per millisecond=17 ) properties (out of 8) seen :1
FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2651 rows 3151 cols
[2023-03-20 02:04:22] [INFO ] Computed 1101 place invariants in 31 ms
[2023-03-20 02:04:22] [INFO ] After 786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:04:23] [INFO ] [Nat]Absence check using 1052 positive place invariants in 297 ms returned sat
[2023-03-20 02:04:23] [INFO ] [Nat]Absence check using 1052 positive and 49 generalized place invariants in 22 ms returned sat
[2023-03-20 02:04:36] [INFO ] After 12197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 02:04:37] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:04:37] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:04:37] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2023-03-20 02:04:38] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2023-03-20 02:04:38] [INFO ] Deduced a trap composed of 6 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:04:39] [INFO ] Deduced a trap composed of 6 places in 249 ms of which 1 ms to minimize.
[2023-03-20 02:04:39] [INFO ] Deduced a trap composed of 6 places in 284 ms of which 0 ms to minimize.
[2023-03-20 02:04:39] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:04:40] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 1 ms to minimize.
[2023-03-20 02:04:40] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2023-03-20 02:04:40] [INFO ] Deduced a trap composed of 6 places in 209 ms of which 2 ms to minimize.
[2023-03-20 02:04:41] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 1 ms to minimize.
[2023-03-20 02:04:41] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2023-03-20 02:04:42] [INFO ] Deduced a trap composed of 9 places in 568 ms of which 0 ms to minimize.
[2023-03-20 02:04:42] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 1 ms to minimize.
[2023-03-20 02:04:43] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-20 02:04:43] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 0 ms to minimize.
[2023-03-20 02:04:43] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 0 ms to minimize.
[2023-03-20 02:04:44] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2023-03-20 02:04:44] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 2 ms to minimize.
[2023-03-20 02:04:44] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 1 ms to minimize.
[2023-03-20 02:04:44] [INFO ] Deduced a trap composed of 7 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:04:45] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 21 ms to minimize.
[2023-03-20 02:04:45] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2023-03-20 02:04:45] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-20 02:04:45] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 9093 ms
[2023-03-20 02:04:46] [INFO ] Deduced a trap composed of 9 places in 377 ms of which 0 ms to minimize.
[2023-03-20 02:04:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 622 ms
[2023-03-20 02:04:47] [INFO ] Deduced a trap composed of 8 places in 325 ms of which 1 ms to minimize.
[2023-03-20 02:04:48] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:04:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:04:48] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1738 ms.
Support contains 49 out of 3151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3151/3151 places, 2651/2651 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3150 transition count 2650
Applied a total of 2 rules in 329 ms. Remains 3150 /3151 variables (removed 1) and now considering 2650/2651 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 3150/3151 places, 2650/2651 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 55958 steps, run timeout after 3003 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 55958 steps, saw 53185 distinct states, run finished after 3005 ms. (steps per millisecond=18 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2650 rows 3150 cols
[2023-03-20 02:04:54] [INFO ] Computed 1101 place invariants in 26 ms
[2023-03-20 02:04:55] [INFO ] After 784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:04:56] [INFO ] [Nat]Absence check using 1055 positive place invariants in 329 ms returned sat
[2023-03-20 02:04:56] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 31 ms returned sat
[2023-03-20 02:05:09] [INFO ] After 12797ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 02:05:10] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 1 ms to minimize.
[2023-03-20 02:05:11] [INFO ] Deduced a trap composed of 6 places in 464 ms of which 1 ms to minimize.
[2023-03-20 02:05:11] [INFO ] Deduced a trap composed of 6 places in 413 ms of which 1 ms to minimize.
[2023-03-20 02:05:12] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 1 ms to minimize.
[2023-03-20 02:05:12] [INFO ] Deduced a trap composed of 10 places in 384 ms of which 0 ms to minimize.
[2023-03-20 02:05:13] [INFO ] Deduced a trap composed of 7 places in 357 ms of which 1 ms to minimize.
[2023-03-20 02:05:13] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 1 ms to minimize.
[2023-03-20 02:05:14] [INFO ] Deduced a trap composed of 6 places in 397 ms of which 0 ms to minimize.
[2023-03-20 02:05:14] [INFO ] Deduced a trap composed of 8 places in 426 ms of which 0 ms to minimize.
[2023-03-20 02:05:15] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 0 ms to minimize.
[2023-03-20 02:05:15] [INFO ] Deduced a trap composed of 9 places in 411 ms of which 1 ms to minimize.
[2023-03-20 02:05:16] [INFO ] Deduced a trap composed of 7 places in 402 ms of which 1 ms to minimize.
[2023-03-20 02:05:17] [INFO ] Deduced a trap composed of 5 places in 437 ms of which 1 ms to minimize.
[2023-03-20 02:05:17] [INFO ] Deduced a trap composed of 6 places in 466 ms of which 1 ms to minimize.
[2023-03-20 02:05:18] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 1 ms to minimize.
[2023-03-20 02:05:18] [INFO ] Deduced a trap composed of 6 places in 403 ms of which 1 ms to minimize.
[2023-03-20 02:05:19] [INFO ] Deduced a trap composed of 8 places in 343 ms of which 1 ms to minimize.
[2023-03-20 02:05:19] [INFO ] Deduced a trap composed of 5 places in 351 ms of which 3 ms to minimize.
[2023-03-20 02:05:20] [INFO ] Deduced a trap composed of 18 places in 366 ms of which 1 ms to minimize.
[2023-03-20 02:05:20] [INFO ] Deduced a trap composed of 6 places in 368 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 02:05:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:05:20] [INFO ] After 25255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 1081 ms.
Support contains 49 out of 3150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 156 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 157 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
[2023-03-20 02:05:22] [INFO ] Invariant cache hit.
[2023-03-20 02:05:24] [INFO ] Implicit Places using invariants in 2622 ms returned []
[2023-03-20 02:05:24] [INFO ] Invariant cache hit.
[2023-03-20 02:05:31] [INFO ] Implicit Places using invariants and state equation in 6475 ms returned []
Implicit Place search using SMT with State Equation took 9107 ms to find 0 implicit places.
[2023-03-20 02:05:31] [INFO ] Redundant transitions in 137 ms returned []
[2023-03-20 02:05:31] [INFO ] Invariant cache hit.
[2023-03-20 02:05:33] [INFO ] Dead Transitions using invariants and state equation in 1955 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11367 ms. Remains : 3150/3150 places, 2650/2650 transitions.
Applied a total of 0 rules in 156 ms. Remains 3150 /3150 variables (removed 0) and now considering 2650/2650 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-20 02:05:33] [INFO ] Invariant cache hit.
[2023-03-20 02:05:34] [INFO ] After 791ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:05:35] [INFO ] [Nat]Absence check using 1055 positive place invariants in 247 ms returned sat
[2023-03-20 02:05:35] [INFO ] [Nat]Absence check using 1055 positive and 46 generalized place invariants in 10 ms returned sat
[2023-03-20 02:05:48] [INFO ] After 12954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 02:05:49] [INFO ] Deduced a trap composed of 6 places in 402 ms of which 8 ms to minimize.
[2023-03-20 02:05:49] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2023-03-20 02:05:50] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 0 ms to minimize.
[2023-03-20 02:05:50] [INFO ] Deduced a trap composed of 7 places in 299 ms of which 1 ms to minimize.
[2023-03-20 02:05:50] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 0 ms to minimize.
[2023-03-20 02:05:51] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 0 ms to minimize.
[2023-03-20 02:05:52] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:05:52] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2023-03-20 02:05:52] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2023-03-20 02:05:53] [INFO ] Deduced a trap composed of 6 places in 257 ms of which 0 ms to minimize.
[2023-03-20 02:05:53] [INFO ] Deduced a trap composed of 8 places in 408 ms of which 1 ms to minimize.
[2023-03-20 02:05:54] [INFO ] Deduced a trap composed of 8 places in 353 ms of which 0 ms to minimize.
[2023-03-20 02:05:54] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 1 ms to minimize.
[2023-03-20 02:05:54] [INFO ] Deduced a trap composed of 6 places in 271 ms of which 1 ms to minimize.
[2023-03-20 02:05:55] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 1 ms to minimize.
[2023-03-20 02:05:55] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2023-03-20 02:05:56] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 1 ms to minimize.
[2023-03-20 02:05:56] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 1 ms to minimize.
[2023-03-20 02:05:57] [INFO ] Deduced a trap composed of 5 places in 381 ms of which 1 ms to minimize.
[2023-03-20 02:05:58] [INFO ] Deduced a trap composed of 6 places in 491 ms of which 1 ms to minimize.
[2023-03-20 02:05:58] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:05:58] [INFO ] Deduced a trap composed of 10 places in 333 ms of which 1 ms to minimize.
[2023-03-20 02:05:59] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2023-03-20 02:05:59] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 0 ms to minimize.
[2023-03-20 02:06:00] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 1 ms to minimize.
[2023-03-20 02:06:00] [INFO ] Deduced a trap composed of 13 places in 302 ms of which 1 ms to minimize.
[2023-03-20 02:06:01] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 1 ms to minimize.
[2023-03-20 02:06:01] [INFO ] Deduced a trap composed of 5 places in 264 ms of which 0 ms to minimize.
[2023-03-20 02:06:01] [INFO ] Deduced a trap composed of 8 places in 372 ms of which 1 ms to minimize.
[2023-03-20 02:06:02] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 1 ms to minimize.
[2023-03-20 02:06:02] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 0 ms to minimize.
[2023-03-20 02:06:03] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2023-03-20 02:06:03] [INFO ] Deduced a trap composed of 7 places in 304 ms of which 0 ms to minimize.
[2023-03-20 02:06:03] [INFO ] Deduced a trap composed of 24 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:06:04] [INFO ] Deduced a trap composed of 7 places in 283 ms of which 0 ms to minimize.
[2023-03-20 02:06:04] [INFO ] Deduced a trap composed of 8 places in 285 ms of which 1 ms to minimize.
[2023-03-20 02:06:05] [INFO ] Deduced a trap composed of 10 places in 280 ms of which 1 ms to minimize.
[2023-03-20 02:06:05] [INFO ] Deduced a trap composed of 6 places in 261 ms of which 0 ms to minimize.
[2023-03-20 02:06:05] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-20 02:06:06] [INFO ] Deduced a trap composed of 8 places in 297 ms of which 0 ms to minimize.
[2023-03-20 02:06:06] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 1 ms to minimize.
[2023-03-20 02:06:06] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 1 ms to minimize.
[2023-03-20 02:06:07] [INFO ] Deduced a trap composed of 7 places in 285 ms of which 0 ms to minimize.
[2023-03-20 02:06:07] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2023-03-20 02:06:07] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 1 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 0 ms to minimize.
[2023-03-20 02:06:08] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 0 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2023-03-20 02:06:09] [INFO ] Deduced a trap composed of 7 places in 236 ms of which 0 ms to minimize.
[2023-03-20 02:06:10] [INFO ] Deduced a trap composed of 10 places in 395 ms of which 0 ms to minimize.
[2023-03-20 02:06:10] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 21982 ms
[2023-03-20 02:06:11] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 1 ms to minimize.
[2023-03-20 02:06:12] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-20 02:06:12] [INFO ] Deduced a trap composed of 8 places in 442 ms of which 14 ms to minimize.
[2023-03-20 02:06:13] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 1 ms to minimize.
[2023-03-20 02:06:13] [INFO ] Deduced a trap composed of 14 places in 444 ms of which 0 ms to minimize.
[2023-03-20 02:06:14] [INFO ] Deduced a trap composed of 7 places in 370 ms of which 0 ms to minimize.
[2023-03-20 02:06:14] [INFO ] Deduced a trap composed of 9 places in 391 ms of which 1 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Deduced a trap composed of 8 places in 402 ms of which 0 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Deduced a trap composed of 5 places in 321 ms of which 1 ms to minimize.
[2023-03-20 02:06:15] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4390 ms
[2023-03-20 02:06:16] [INFO ] After 40475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 849 ms.
[2023-03-20 02:06:17] [INFO ] After 42750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 02:06:17] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 02:06:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3150 places, 2650 transitions and 12326 arcs took 23 ms.
[2023-03-20 02:06:17] [INFO ] Flatten gal took : 318 ms
Total runtime 185866 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-100B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
ReachabilityCardinality

FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679277985146
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 10330012 kB
After kill :
MemTotal: 16393236 kB
MemFree: 10325712 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/ReachabilityCardinality.xml
lola: Created skeleton in 1.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: 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 9 ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: time limit : 513 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 9 ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 9 ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 9 ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 24 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: result : true
lola: markings : 143
lola: fired transitions : 142
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 21 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityCardinality-09 (obsolete)
sara: try reading problem file /home/mcc/execution/381/ReachabilityCardinality-22.sara.
lola: FINISHED task # 21 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 141
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 # 32 (type EXCL) for 12 ShieldPPPs-PT-100B-ReachabilityCardinality-10
lola: time limit : 598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 28 (type FNDP) for 12 ShieldPPPs-PT-100B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 29 (type EQUN) for 12 ShieldPPPs-PT-100B-ReachabilityCardinality-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 12 ShieldPPPs-PT-100B-ReachabilityCardinality-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: 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: 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: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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 31 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-10
lola: result : false
lola: markings : 6379
lola: fired transitions : 18415
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 28 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 29 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-10 (obsolete)
lola: CANCELED task # 32 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityCardinality-10 (obsolete)
lola: LAUNCH task # 64 (type EXCL) for 0 ShieldPPPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 35 (type FNDP) for 6 ShieldPPPs-PT-100B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type EQUN) for 6 ShieldPPPs-PT-100B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 38 (type SRCH) for 6 ShieldPPPs-PT-100B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 28 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-10
lola: result : unknown
lola: fired transitions : 15165
lola: tried executions : 656
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 35 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 161
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 36 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 38 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-08 (obsolete)
lola: LAUNCH task # 41 (type FNDP) for 18 ShieldPPPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 42 (type EQUN) for 18 ShieldPPPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 18 ShieldPPPs-PT-100B-ReachabilityCardinality-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 44 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-15
lola: result : true
lola: markings : 132
lola: fired transitions : 131
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 41 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-15 (obsolete)
lola: CANCELED task # 42 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-15 (obsolete)
lola: LAUNCH task # 48 (type FNDP) for 15 ShieldPPPs-PT-100B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type EQUN) for 15 ShieldPPPs-PT-100B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type SRCH) for 15 ShieldPPPs-PT-100B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 41 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-15
lola: result : true
lola: fired transitions : 130
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: FINISHED task # 48 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 194
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 49 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 51 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 54 (type FNDP) for 3 ShieldPPPs-PT-100B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 55 (type EQUN) for 3 ShieldPPPs-PT-100B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 57 (type SRCH) for 3 ShieldPPPs-PT-100B-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 51 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-11
lola: result : true
lola: markings : 196
lola: fired transitions : 195
lola: time used : 1.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 54 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 168
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 55 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 57 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 60 (type FNDP) for 0 ShieldPPPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type EQUN) for 0 ShieldPPPs-PT-100B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type SRCH) for 0 ShieldPPPs-PT-100B-ReachabilityCardinality-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 # 60 (type FNDP) for ShieldPPPs-PT-100B-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 146
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 61 (type EQUN) for ShieldPPPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 63 (type SRCH) for ShieldPPPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 64 (type EXCL) for ShieldPPPs-PT-100B-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-100B-ReachabilityCardinality-04: AG false findpath
ShieldPPPs-PT-100B-ReachabilityCardinality-05: EF true findpath
ShieldPPPs-PT-100B-ReachabilityCardinality-08: AG false findpath
ShieldPPPs-PT-100B-ReachabilityCardinality-09: EF true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityCardinality-10: AG true tandem / insertion
ShieldPPPs-PT-100B-ReachabilityCardinality-11: AG false findpath
ShieldPPPs-PT-100B-ReachabilityCardinality-15: EF true tandem / insertion


Time elapsed: 8 secs. Pages in use: 3
sara: try reading problem file /home/mcc/execution/381/ReachabilityCardinality-36.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 3890)

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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167903715400526"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;