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

About the Execution of LoLa+red for Dekker-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
938.260 93697.00 134323.00 883.10 FTFFFTTTTFTFTTFF 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.r135-smll-167819413300038.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819413300038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 8.7K Feb 26 01:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 01:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 01:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 01:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 01:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 01:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.9M Mar 5 18:22 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 Dekker-PT-100-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678269368551

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=Dekker-PT-100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 09:56:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 09:56:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:56:12] [INFO ] Load time of PNML (sax parser for PT used): 963 ms
[2023-03-08 09:56:12] [INFO ] Transformed 500 places.
[2023-03-08 09:56:12] [INFO ] Transformed 10200 transitions.
[2023-03-08 09:56:12] [INFO ] Found NUPN structural information;
[2023-03-08 09:56:12] [INFO ] Parsed PT model containing 500 places and 10200 transitions and 80200 arcs in 1199 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-100-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=10 ) properties (out of 11) seen :7
FORMULA Dekker-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-100-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 09:56:14] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 500 cols
[2023-03-08 09:56:14] [INFO ] Computed 300 place invariants in 30 ms
[2023-03-08 09:56:15] [INFO ] After 620ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:56:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 79 ms returned sat
[2023-03-08 09:56:15] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 36 ms returned sat
[2023-03-08 09:56:16] [INFO ] After 467ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:56:16] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:56:16] [INFO ] After 387ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:56:17] [INFO ] Deduced a trap composed of 4 places in 1086 ms of which 15 ms to minimize.
[2023-03-08 09:56:18] [INFO ] Deduced a trap composed of 4 places in 840 ms of which 2 ms to minimize.
[2023-03-08 09:56:19] [INFO ] Deduced a trap composed of 6 places in 679 ms of which 2 ms to minimize.
[2023-03-08 09:56:19] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 2 ms to minimize.
[2023-03-08 09:56:20] [INFO ] Deduced a trap composed of 4 places in 567 ms of which 0 ms to minimize.
[2023-03-08 09:56:21] [INFO ] Deduced a trap composed of 4 places in 542 ms of which 1 ms to minimize.
[2023-03-08 09:56:21] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
[2023-03-08 09:56:22] [INFO ] Deduced a trap composed of 4 places in 668 ms of which 1 ms to minimize.
[2023-03-08 09:56:23] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2023-03-08 09:56:23] [INFO ] Deduced a trap composed of 4 places in 653 ms of which 1 ms to minimize.
[2023-03-08 09:56:24] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2023-03-08 09:56:25] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2023-03-08 09:56:25] [INFO ] Deduced a trap composed of 4 places in 676 ms of which 0 ms to minimize.
[2023-03-08 09:56:26] [INFO ] Deduced a trap composed of 4 places in 694 ms of which 1 ms to minimize.
[2023-03-08 09:56:26] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9893 ms
[2023-03-08 09:56:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 9893 ms
[2023-03-08 09:56:26] [INFO ] After 10575ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-08 09:56:26] [INFO ] After 11768ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA Dekker-PT-100-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 8 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 1473 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1478 ms. Remains : 500/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 143117 steps, run timeout after 3003 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143117 steps, saw 132317 distinct states, run finished after 3005 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:56:32] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:56:32] [INFO ] Invariant cache hit.
[2023-03-08 09:56:32] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:56:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 51 ms returned sat
[2023-03-08 09:56:32] [INFO ] [Nat]Absence check using 200 positive and 100 generalized place invariants in 25 ms returned sat
[2023-03-08 09:56:32] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:56:33] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:56:33] [INFO ] After 367ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:56:34] [INFO ] Deduced a trap composed of 4 places in 762 ms of which 1 ms to minimize.
[2023-03-08 09:56:35] [INFO ] Deduced a trap composed of 4 places in 745 ms of which 1 ms to minimize.
[2023-03-08 09:56:35] [INFO ] Deduced a trap composed of 4 places in 730 ms of which 1 ms to minimize.
[2023-03-08 09:56:36] [INFO ] Deduced a trap composed of 4 places in 709 ms of which 1 ms to minimize.
[2023-03-08 09:56:37] [INFO ] Deduced a trap composed of 4 places in 670 ms of which 0 ms to minimize.
[2023-03-08 09:56:38] [INFO ] Deduced a trap composed of 4 places in 716 ms of which 1 ms to minimize.
[2023-03-08 09:56:38] [INFO ] Deduced a trap composed of 4 places in 708 ms of which 2 ms to minimize.
[2023-03-08 09:56:39] [INFO ] Deduced a trap composed of 4 places in 721 ms of which 1 ms to minimize.
[2023-03-08 09:56:40] [INFO ] Deduced a trap composed of 4 places in 773 ms of which 0 ms to minimize.
[2023-03-08 09:56:41] [INFO ] Deduced a trap composed of 6 places in 786 ms of which 1 ms to minimize.
[2023-03-08 09:56:41] [INFO ] Deduced a trap composed of 4 places in 635 ms of which 0 ms to minimize.
[2023-03-08 09:56:42] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2023-03-08 09:56:43] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 1 ms to minimize.
[2023-03-08 09:56:43] [INFO ] Deduced a trap composed of 6 places in 704 ms of which 1 ms to minimize.
[2023-03-08 09:56:44] [INFO ] Deduced a trap composed of 4 places in 689 ms of which 1 ms to minimize.
[2023-03-08 09:56:45] [INFO ] Deduced a trap composed of 4 places in 666 ms of which 1 ms to minimize.
[2023-03-08 09:56:45] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2023-03-08 09:56:46] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 3 ms to minimize.
[2023-03-08 09:56:47] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 2 ms to minimize.
[2023-03-08 09:56:47] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 1 ms to minimize.
[2023-03-08 09:56:48] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2023-03-08 09:56:49] [INFO ] Deduced a trap composed of 6 places in 610 ms of which 1 ms to minimize.
[2023-03-08 09:56:49] [INFO ] Deduced a trap composed of 4 places in 573 ms of which 1 ms to minimize.
[2023-03-08 09:56:50] [INFO ] Deduced a trap composed of 4 places in 556 ms of which 1 ms to minimize.
[2023-03-08 09:56:50] [INFO ] Deduced a trap composed of 4 places in 549 ms of which 2 ms to minimize.
[2023-03-08 09:56:51] [INFO ] Deduced a trap composed of 5 places in 540 ms of which 1 ms to minimize.
[2023-03-08 09:56:52] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 1 ms to minimize.
[2023-03-08 09:56:52] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 1 ms to minimize.
[2023-03-08 09:56:53] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 1 ms to minimize.
[2023-03-08 09:56:53] [INFO ] Deduced a trap composed of 6 places in 505 ms of which 1 ms to minimize.
[2023-03-08 09:56:54] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 2 ms to minimize.
[2023-03-08 09:56:54] [INFO ] Deduced a trap composed of 4 places in 490 ms of which 1 ms to minimize.
[2023-03-08 09:56:55] [INFO ] Deduced a trap composed of 6 places in 384 ms of which 1 ms to minimize.
[2023-03-08 09:56:55] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2023-03-08 09:56:55] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2023-03-08 09:56:56] [INFO ] Deduced a trap composed of 4 places in 427 ms of which 1 ms to minimize.
[2023-03-08 09:56:56] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2023-03-08 09:56:57] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2023-03-08 09:56:57] [INFO ] Deduced a trap composed of 4 places in 361 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-08 09:56:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-08 09:56:57] [INFO ] After 25356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 767 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 767 ms. Remains : 500/500 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 508 ms. Remains 500 /500 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:56:58] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:56:58] [INFO ] Invariant cache hit.
[2023-03-08 09:57:09] [INFO ] Implicit Places using invariants in 10593 ms returned [200, 203, 206, 209, 212, 215, 218, 221, 224, 227, 230, 233, 236, 239, 242, 245, 248, 251, 254, 257, 260, 263, 266, 269, 272, 275, 278, 281, 284, 287, 290, 293, 296, 299, 302, 305, 308, 311, 314, 317, 320, 323, 326, 329, 332, 335, 338, 341, 344, 347, 350, 353, 356, 359, 362, 368, 371, 374, 377, 380, 383, 386, 389, 392, 395, 398, 401, 404, 407, 410, 413, 416, 419, 422, 425, 428, 431, 434, 437, 440, 443, 446, 449, 452, 455, 458, 461, 464, 467, 470, 473, 476, 479, 482, 485, 488, 491, 494, 497]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 10614 ms to find 99 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 401/500 places, 10200/10200 transitions.
Applied a total of 0 rules in 470 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11595 ms. Remains : 401/500 places, 10200/10200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 115039 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115039 steps, saw 106652 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:57:13] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
// Phase 1: matrix 400 rows 401 cols
[2023-03-08 09:57:13] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-08 09:57:13] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:57:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 72 ms returned sat
[2023-03-08 09:57:14] [INFO ] [Nat]Absence check using 200 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 09:57:14] [INFO ] After 342ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:57:14] [INFO ] State equation strengthened by 100 read => feed constraints.
[2023-03-08 09:57:14] [INFO ] After 280ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:57:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-08 09:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-08 09:57:15] [INFO ] Deduced a trap composed of 4 places in 703 ms of which 1 ms to minimize.
[2023-03-08 09:57:16] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 1 ms to minimize.
[2023-03-08 09:57:17] [INFO ] Deduced a trap composed of 4 places in 588 ms of which 1 ms to minimize.
[2023-03-08 09:57:17] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 1 ms to minimize.
[2023-03-08 09:57:18] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 1 ms to minimize.
[2023-03-08 09:57:19] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 1 ms to minimize.
[2023-03-08 09:57:19] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2023-03-08 09:57:20] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
[2023-03-08 09:57:20] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 1 ms to minimize.
[2023-03-08 09:57:21] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2023-03-08 09:57:22] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 4 ms to minimize.
[2023-03-08 09:57:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 6977 ms
[2023-03-08 09:57:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6977 ms
[2023-03-08 09:57:22] [INFO ] After 7542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-08 09:57:22] [INFO ] After 8407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 718 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 401/401 places, 10200/10200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 10200/10200 transitions.
Applied a total of 0 rules in 444 ms. Remains 401 /401 variables (removed 0) and now considering 10200/10200 (removed 0) transitions.
[2023-03-08 09:57:23] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:57:23] [INFO ] Invariant cache hit.
[2023-03-08 09:57:26] [INFO ] Implicit Places using invariants in 2573 ms returned []
Implicit Place search using SMT only with invariants took 2575 ms to find 0 implicit places.
[2023-03-08 09:57:26] [INFO ] Flow matrix only has 400 transitions (discarded 9800 similar events)
[2023-03-08 09:57:26] [INFO ] Invariant cache hit.
[2023-03-08 09:57:32] [INFO ] Dead Transitions using invariants and state equation in 6474 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9496 ms. Remains : 401/401 places, 10200/10200 transitions.
Graph (complete) has 605 edges and 401 vertex of which 25 are kept as prefixes of interest. Removing 376 places using SCC suffix rule.3 ms
Discarding 376 places :
Also discarding 9588 output transitions
Drop transitions removed 9588 transitions
Ensure Unique test removed 1 places
Ensure Unique test removed 588 transitions
Reduce isomorphic transitions removed 588 transitions.
Iterating post reduction 0 with 589 rules applied. Total rules applied 590 place count 24 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 602 place count 16 transition count 20
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 606 place count 16 transition count 16
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 607 place count 16 transition count 15
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 610 place count 14 transition count 14
Applied a total of 610 rules in 44 ms. Remains 14 /401 variables (removed 387) and now considering 14/10200 (removed 10186) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 14 rows 14 cols
[2023-03-08 09:57:32] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 09:57:32] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:57:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-08 09:57:32] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:57:32] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 09:57:32] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-08 09:57:32] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-08 09:57:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 401 places, 10200 transitions and 70201 arcs took 78 ms.
[2023-03-08 09:57:34] [INFO ] Flatten gal took : 924 ms
Total runtime 82503 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Dekker-PT-100
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityCardinality

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

FORMULA Dekker-PT-100-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678269462248

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 11 (type SKEL/FNDP) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type SKEL/EQUN) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 14 (type SKEL/SRCH) for 0 Dekker-PT-100-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: LAUNCH task # 15 (type SKEL/SRCH) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 15 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-04
lola: result : true
lola: markings : 45
lola: fired transitions : 250
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 11 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 12 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 14 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: FINISHED task # 11 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 2
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: Created skeleton in 0.000000 secs.
lola: FINISHED task # 12 (type SKEL/EQUN) for Dekker-PT-100-ReachabilityCardinality-04
lola: result : true
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 # 18 (type SKEL/FNDP) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SKEL/EQUN) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 21 (type SKEL/SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SKEL/SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 21 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-05
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 19 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 22 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: FINISHED task # 18 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/374/ReachabilityCardinality-19.sara.
sara: place or transition ordering is non-deterministic

lola: FINISHED task # 19 (type SKEL/EQUN) for Dekker-PT-100-ReachabilityCardinality-05
lola: result : true
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 26 (type SKEL/FNDP) for 6 Dekker-PT-100-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 27 (type SKEL/EQUN) for 6 Dekker-PT-100-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: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 29 (type SKEL/SRCH) for 6 Dekker-PT-100-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 30 (type SKEL/SRCH) for 6 Dekker-PT-100-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 30 (type SKEL/SRCH) for Dekker-PT-100-ReachabilityCardinality-09
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 26 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 27 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 29 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-09 (obsolete)
lola: FINISHED task # 26 (type SKEL/FNDP) for Dekker-PT-100-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 27 (type SKEL/EQUN) for Dekker-PT-100-ReachabilityCardinality-09
lola: result : unknown
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Dekker-PT-100-ReachabilityCardinality-04: AG 0 0 0 0 3 0 0 2
Dekker-PT-100-ReachabilityCardinality-05: EF 0 0 0 0 3 0 0 2
Dekker-PT-100-ReachabilityCardinality-09: AG 0 0 0 0 3 0 0 2

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 0 of 4 Visible: 3
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 # 36 (type EXCL) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 1198 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 32 (type FNDP) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 3 Dekker-PT-100-ReachabilityCardinality-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k: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: FINISHED task # 35 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-05
lola: result : true
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 32 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 33 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: CANCELED task # 36 (type EXCL) for Dekker-PT-100-ReachabilityCardinality-05 (obsolete)
lola: LAUNCH task # 43 (type EXCL) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 46 (type FNDP) for 6 Dekker-PT-100-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 47 (type EQUN) for 6 Dekker-PT-100-ReachabilityCardinality-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 49 (type SRCH) for 6 Dekker-PT-100-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 # 32 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-05
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 46 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-09
lola: result : true
lola: fired transitions : 1
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 47 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-09 (obsolete)
lola: CANCELED task # 49 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-09 (obsolete)
lola: LAUNCH task # 39 (type FNDP) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 40 (type EQUN) for 0 Dekker-PT-100-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: LAUNCH task # 42 (type SRCH) for 0 Dekker-PT-100-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 42 (type SRCH) for Dekker-PT-100-ReachabilityCardinality-04
lola: result : true
lola: markings : 4
lola: fired transitions : 3
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 39 (type FNDP) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 40 (type EQUN) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 43 (type EXCL) for Dekker-PT-100-ReachabilityCardinality-04 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Dekker-PT-100-ReachabilityCardinality-04: AG false tandem / insertion
Dekker-PT-100-ReachabilityCardinality-05: EF true tandem / insertion
Dekker-PT-100-ReachabilityCardinality-09: AG false findpath


Time elapsed: 7 secs. Pages in use: 3

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-100"
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 Dekker-PT-100, 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 r135-smll-167819413300038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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