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

About the Execution of LoLa+red for ShieldPPPt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3408.363 76723.00 2629482.00 163.40 TFFFTTTFTFTTTTFF 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-167903715500654.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 ShieldPPPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715500654
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 569K 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 ShieldPPPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679279690489

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=ShieldPPPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:34:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 02:34:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:34:53] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-20 02:34:53] [INFO ] Transformed 2343 places.
[2023-03-20 02:34:53] [INFO ] Transformed 2133 transitions.
[2023-03-20 02:34:53] [INFO ] Found NUPN structural information;
[2023-03-20 02:34:53] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 516 ms. (steps per millisecond=19 ) properties (out of 14) seen :7
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-20 02:34:54] [INFO ] Computed 331 place invariants in 76 ms
[2023-03-20 02:34:56] [INFO ] After 1519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:34:58] [INFO ] [Nat]Absence check using 331 positive place invariants in 1116 ms returned sat
[2023-03-20 02:35:04] [INFO ] After 5347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:07] [INFO ] Deduced a trap composed of 19 places in 2802 ms of which 13 ms to minimize.
[2023-03-20 02:35:08] [INFO ] Deduced a trap composed of 23 places in 1048 ms of which 2 ms to minimize.
[2023-03-20 02:35:09] [INFO ] Deduced a trap composed of 29 places in 845 ms of which 2 ms to minimize.
[2023-03-20 02:35:10] [INFO ] Deduced a trap composed of 25 places in 751 ms of which 17 ms to minimize.
[2023-03-20 02:35:12] [INFO ] Deduced a trap composed of 21 places in 2491 ms of which 15 ms to minimize.
[2023-03-20 02:35:14] [INFO ] Deduced a trap composed of 25 places in 1907 ms of which 3 ms to minimize.
[2023-03-20 02:35:15] [INFO ] Deduced a trap composed of 22 places in 939 ms of which 15 ms to minimize.
[2023-03-20 02:35:16] [INFO ] Deduced a trap composed of 19 places in 588 ms of which 1 ms to minimize.
[2023-03-20 02:35:17] [INFO ] Deduced a trap composed of 22 places in 738 ms of which 1 ms to minimize.
[2023-03-20 02:35:18] [INFO ] Deduced a trap composed of 39 places in 757 ms of which 2 ms to minimize.
[2023-03-20 02:35:19] [INFO ] Deduced a trap composed of 23 places in 573 ms of which 1 ms to minimize.
[2023-03-20 02:35:20] [INFO ] Deduced a trap composed of 34 places in 1156 ms of which 1 ms to minimize.
[2023-03-20 02:35:21] [INFO ] Deduced a trap composed of 20 places in 1381 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:35:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 02:35:21] [INFO ] After 25439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 638 ms.
Support contains 32 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 552 transitions
Trivial Post-agglo rules discarded 552 transitions
Performed 552 trivial Post agglomeration. Transition count delta: 552
Iterating post reduction 0 with 552 rules applied. Total rules applied 552 place count 2343 transition count 1581
Reduce places removed 552 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 554 rules applied. Total rules applied 1106 place count 1791 transition count 1579
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 1114 place count 1790 transition count 1572
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 1121 place count 1783 transition count 1572
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 1121 place count 1783 transition count 1452
Deduced a syphon composed of 120 places in 4 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1361 place count 1663 transition count 1452
Discarding 203 places :
Symmetric choice reduction at 4 with 203 rule applications. Total rules 1564 place count 1460 transition count 1249
Iterating global reduction 4 with 203 rules applied. Total rules applied 1767 place count 1460 transition count 1249
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 85 Pre rules applied. Total rules applied 1767 place count 1460 transition count 1164
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 1937 place count 1375 transition count 1164
Performed 497 Post agglomeration using F-continuation condition.Transition count delta: 497
Deduced a syphon composed of 497 places in 9 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 4 with 994 rules applied. Total rules applied 2931 place count 878 transition count 667
Renaming transitions due to excessive name length > 1024 char.
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 85 places in 5 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 3101 place count 793 transition count 667
Partial Free-agglomeration rule applied 85 times.
Drop transitions removed 85 transitions
Iterating global reduction 4 with 85 rules applied. Total rules applied 3186 place count 793 transition count 667
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3187 place count 792 transition count 666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3188 place count 791 transition count 666
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 3188 place count 791 transition count 664
Deduced a syphon composed of 2 places in 16 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 3192 place count 789 transition count 664
Applied a total of 3192 rules in 942 ms. Remains 789 /2343 variables (removed 1554) and now considering 664/2133 (removed 1469) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 943 ms. Remains : 789/2343 places, 664/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 93255 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 93255 steps, saw 70467 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 664 rows 789 cols
[2023-03-20 02:35:27] [INFO ] Computed 330 place invariants in 3 ms
[2023-03-20 02:35:27] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:35:27] [INFO ] [Nat]Absence check using 330 positive place invariants in 107 ms returned sat
[2023-03-20 02:35:28] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:28] [INFO ] State equation strengthened by 154 read => feed constraints.
[2023-03-20 02:35:29] [INFO ] After 556ms SMT Verify possible using 154 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:29] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-20 02:35:29] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2023-03-20 02:35:29] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 0 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 1 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 1 ms to minimize.
[2023-03-20 02:35:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1362 ms
[2023-03-20 02:35:31] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 0 ms to minimize.
[2023-03-20 02:35:31] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-20 02:35:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 352 ms
[2023-03-20 02:35:31] [INFO ] After 2854ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-20 02:35:31] [INFO ] After 4569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 266 ms.
Support contains 32 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 66 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 789/789 places, 664/664 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 664/664 transitions.
Applied a total of 0 rules in 33 ms. Remains 789 /789 variables (removed 0) and now considering 664/664 (removed 0) transitions.
[2023-03-20 02:35:32] [INFO ] Invariant cache hit.
[2023-03-20 02:35:32] [INFO ] Implicit Places using invariants in 521 ms returned [771, 775]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 523 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 787/789 places, 664/664 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 785 transition count 662
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 785 transition count 662
Applied a total of 4 rules in 52 ms. Remains 785 /787 variables (removed 2) and now considering 662/664 (removed 2) transitions.
// Phase 1: matrix 662 rows 785 cols
[2023-03-20 02:35:32] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:35:33] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-03-20 02:35:33] [INFO ] Invariant cache hit.
[2023-03-20 02:35:34] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-20 02:35:35] [INFO ] Implicit Places using invariants and state equation in 2373 ms returned []
Implicit Place search using SMT with State Equation took 2960 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 785/789 places, 662/664 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3572 ms. Remains : 785/789 places, 662/664 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 85301 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 85301 steps, saw 62762 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 7 properties.
[2023-03-20 02:35:40] [INFO ] Invariant cache hit.
[2023-03-20 02:35:40] [INFO ] After 231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:35:40] [INFO ] [Nat]Absence check using 328 positive place invariants in 90 ms returned sat
[2023-03-20 02:35:41] [INFO ] After 732ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:41] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-20 02:35:42] [INFO ] After 547ms SMT Verify possible using 152 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:42] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:35:42] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2023-03-20 02:35:43] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2023-03-20 02:35:43] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2023-03-20 02:35:43] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-20 02:35:43] [INFO ] Deduced a trap composed of 6 places in 140 ms of which 1 ms to minimize.
[2023-03-20 02:35:43] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1467 ms
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 6 places in 210 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:35:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 703 ms
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 0 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 410 ms
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 8 places in 140 ms of which 8 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 0 ms to minimize.
[2023-03-20 02:35:45] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-20 02:35:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 826 ms
[2023-03-20 02:35:46] [INFO ] After 4612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 559 ms.
[2023-03-20 02:35:46] [INFO ] After 6545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 212 ms.
Support contains 32 out of 785 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 662/662 transitions.
Applied a total of 0 rules in 22 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 785/785 places, 662/662 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 785/785 places, 662/662 transitions.
Applied a total of 0 rules in 26 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
[2023-03-20 02:35:47] [INFO ] Invariant cache hit.
[2023-03-20 02:35:47] [INFO ] Implicit Places using invariants in 579 ms returned []
[2023-03-20 02:35:47] [INFO ] Invariant cache hit.
[2023-03-20 02:35:48] [INFO ] State equation strengthened by 152 read => feed constraints.
[2023-03-20 02:35:49] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2023-03-20 02:35:49] [INFO ] Redundant transitions in 48 ms returned []
[2023-03-20 02:35:49] [INFO ] Invariant cache hit.
[2023-03-20 02:35:50] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3423 ms. Remains : 785/785 places, 662/662 transitions.
Partial Free-agglomeration rule applied 178 times.
Drop transitions removed 178 transitions
Iterating global reduction 0 with 178 rules applied. Total rules applied 178 place count 785 transition count 662
Applied a total of 178 rules in 45 ms. Remains 785 /785 variables (removed 0) and now considering 662/662 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 662 rows 785 cols
[2023-03-20 02:35:50] [INFO ] Computed 328 place invariants in 2 ms
[2023-03-20 02:35:50] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 02:35:51] [INFO ] [Nat]Absence check using 328 positive place invariants in 65 ms returned sat
[2023-03-20 02:35:52] [INFO ] After 1062ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:52] [INFO ] State equation strengthened by 162 read => feed constraints.
[2023-03-20 02:35:53] [INFO ] After 711ms SMT Verify possible using 162 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:35:53] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 2 ms to minimize.
[2023-03-20 02:35:53] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 1 ms to minimize.
[2023-03-20 02:35:53] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 1 ms to minimize.
[2023-03-20 02:35:54] [INFO ] Deduced a trap composed of 7 places in 803 ms of which 1 ms to minimize.
[2023-03-20 02:35:55] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2023-03-20 02:35:55] [INFO ] Deduced a trap composed of 8 places in 558 ms of which 1 ms to minimize.
[2023-03-20 02:35:55] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:35:56] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 14 ms to minimize.
[2023-03-20 02:35:57] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-03-20 02:35:57] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 3 ms to minimize.
[2023-03-20 02:35:57] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 0 ms to minimize.
[2023-03-20 02:35:58] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:35:58] [INFO ] Deduced a trap composed of 7 places in 163 ms of which 0 ms to minimize.
[2023-03-20 02:35:58] [INFO ] Deduced a trap composed of 6 places in 636 ms of which 1 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 25 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 8 places in 309 ms of which 1 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-20 02:35:59] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 0 ms to minimize.
[2023-03-20 02:36:00] [INFO ] Deduced a trap composed of 7 places in 429 ms of which 2 ms to minimize.
[2023-03-20 02:36:00] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7372 ms
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 0 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 1 ms to minimize.
[2023-03-20 02:36:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 983 ms
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 0 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 0 ms to minimize.
[2023-03-20 02:36:02] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 14 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 16 places in 349 ms of which 1 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 1 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 7 places in 383 ms of which 10 ms to minimize.
[2023-03-20 02:36:03] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 9 ms to minimize.
[2023-03-20 02:36:04] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1993 ms
[2023-03-20 02:36:04] [INFO ] After 11982ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 905 ms.
[2023-03-20 02:36:05] [INFO ] After 14448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-20 02:36:05] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-20 02:36:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 785 places, 662 transitions and 2984 arcs took 7 ms.
[2023-03-20 02:36:05] [INFO ] Flatten gal took : 109 ms
Total runtime 72231 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-030B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityCardinality

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679279767212

--------------------
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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityCardinality.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: 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 6 ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type SRCH) for 6 ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 24 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: result : true
lola: markings : 51
lola: fired transitions : 50
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 21 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 22 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 25 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-04 (obsolete)
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 # 31 (type EXCL) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 27 (type FNDP) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 30 (type SRCH) for 12 ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: result : true
lola: markings : 48
lola: fired transitions : 47
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 27 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 28 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-08 (obsolete)
lola: CANCELED task # 31 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-08 (obsolete)
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-22.sara.
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 # 27 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-08
lola: result : true
lola: fired transitions : 46
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-28.sara.
lola: LAUNCH task # 37 (type EXCL) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 33 (type FNDP) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 36 (type SRCH) for 18 ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: place or transition ordering is non-deterministic
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-34.sara.
lola: FINISHED task # 21 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 49
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 33 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 36
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 34 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 36 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 37 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-12 (obsolete)
lola: FINISHED task # 36 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-12
lola: result : true
lola: markings : 38
lola: fired transitions : 37
lola: time used : 0.000000
lola: memory pages used : 1
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 57 (type EXCL) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-03
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 39 (type FNDP) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type EQUN) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 9 ShieldPPPt-PT-030B-ReachabilityCardinality-06
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 ShieldPPPt-PT-030B-ReachabilityCardinality-06
lola: result : true
lola: markings : 54
lola: fired transitions : 53
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 39 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-06 (obsolete)
lola: CANCELED task # 41 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-06 (obsolete)
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 43 (type FNDP) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/379/ReachabilityCardinality-41.sara.
lola: LAUNCH task # 46 (type EQUN) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type SRCH) for 0 ShieldPPPt-PT-030B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 39 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-06
lola: result : unknown
lola: fired transitions : 1
lola: tried executions : 2
lola: time used : 1.000000
lola: memory pages used : 0
lola: FINISHED task # 43 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 33
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 46 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 49 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 60 (type FNDP) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 61 (type EQUN) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 63 (type SRCH) for 15 ShieldPPPt-PT-030B-ReachabilityCardinality-09
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 ShieldPPPt-PT-030B-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 56
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 61 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 63 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 53 (type FNDP) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type EQUN) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 56 (type SRCH) for 3 ShieldPPPt-PT-030B-ReachabilityCardinality-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 56 (type SRCH) for ShieldPPPt-PT-030B-ReachabilityCardinality-03
lola: result : true
lola: markings : 55
lola: fired transitions : 54
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 53 (type FNDP) for ShieldPPPt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 54 (type EQUN) for ShieldPPPt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: CANCELED task # 57 (type EXCL) for ShieldPPPt-PT-030B-ReachabilityCardinality-03 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-030B-ReachabilityCardinality-02: AG false findpath
ShieldPPPt-PT-030B-ReachabilityCardinality-03: AG false tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-04: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-06: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-08: EF true tandem / insertion
ShieldPPPt-PT-030B-ReachabilityCardinality-09: AG false findpath
ShieldPPPt-PT-030B-ReachabilityCardinality-12: EF true findpath


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

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="ShieldPPPt-PT-030B"
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 ShieldPPPt-PT-030B, 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-167903715500654"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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