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-167903715100302.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 ShieldIIPt-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-167903715100302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 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 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 512K 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 ShieldIIPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679272308898

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=ShieldIIPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:31:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 00:31:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:31:52] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2023-03-20 00:31:52] [INFO ] Transformed 2103 places.
[2023-03-20 00:31:52] [INFO ] Transformed 1953 transitions.
[2023-03-20 00:31:52] [INFO ] Found NUPN structural information;
[2023-03-20 00:31:52] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 322 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 15) seen :10
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-20 00:31:53] [INFO ] Computed 271 place invariants in 31 ms
[2023-03-20 00:31:54] [INFO ] After 1100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:31:55] [INFO ] [Nat]Absence check using 271 positive place invariants in 116 ms returned sat
[2023-03-20 00:31:59] [INFO ] After 3610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:00] [INFO ] Deduced a trap composed of 21 places in 959 ms of which 31 ms to minimize.
[2023-03-20 00:32:01] [INFO ] Deduced a trap composed of 18 places in 996 ms of which 2 ms to minimize.
[2023-03-20 00:32:02] [INFO ] Deduced a trap composed of 19 places in 781 ms of which 5 ms to minimize.
[2023-03-20 00:32:02] [INFO ] Deduced a trap composed of 28 places in 644 ms of which 13 ms to minimize.
[2023-03-20 00:32:03] [INFO ] Deduced a trap composed of 18 places in 684 ms of which 16 ms to minimize.
[2023-03-20 00:32:04] [INFO ] Deduced a trap composed of 31 places in 764 ms of which 2 ms to minimize.
[2023-03-20 00:32:05] [INFO ] Deduced a trap composed of 45 places in 878 ms of which 6 ms to minimize.
[2023-03-20 00:32:06] [INFO ] Deduced a trap composed of 37 places in 613 ms of which 1 ms to minimize.
[2023-03-20 00:32:06] [INFO ] Deduced a trap composed of 28 places in 630 ms of which 1 ms to minimize.
[2023-03-20 00:32:07] [INFO ] Deduced a trap composed of 28 places in 600 ms of which 2 ms to minimize.
[2023-03-20 00:32:08] [INFO ] Deduced a trap composed of 29 places in 642 ms of which 2 ms to minimize.
[2023-03-20 00:32:08] [INFO ] Deduced a trap composed of 19 places in 604 ms of which 1 ms to minimize.
[2023-03-20 00:32:09] [INFO ] Deduced a trap composed of 50 places in 604 ms of which 2 ms to minimize.
[2023-03-20 00:32:10] [INFO ] Deduced a trap composed of 27 places in 496 ms of which 1 ms to minimize.
[2023-03-20 00:32:10] [INFO ] Deduced a trap composed of 28 places in 548 ms of which 1 ms to minimize.
[2023-03-20 00:32:11] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 1 ms to minimize.
[2023-03-20 00:32:11] [INFO ] Deduced a trap composed of 35 places in 551 ms of which 1 ms to minimize.
[2023-03-20 00:32:12] [INFO ] Deduced a trap composed of 26 places in 487 ms of which 1 ms to minimize.
[2023-03-20 00:32:13] [INFO ] Deduced a trap composed of 26 places in 481 ms of which 1 ms to minimize.
[2023-03-20 00:32:13] [INFO ] Deduced a trap composed of 26 places in 784 ms of which 5 ms to minimize.
[2023-03-20 00:32:14] [INFO ] Deduced a trap composed of 38 places in 621 ms of which 2 ms to minimize.
[2023-03-20 00:32:15] [INFO ] Deduced a trap composed of 22 places in 491 ms of which 2 ms to minimize.
[2023-03-20 00:32:15] [INFO ] Deduced a trap composed of 45 places in 526 ms of which 1 ms to minimize.
[2023-03-20 00:32:16] [INFO ] Deduced a trap composed of 22 places in 456 ms of which 1 ms to minimize.
[2023-03-20 00:32:16] [INFO ] Deduced a trap composed of 33 places in 488 ms of which 1 ms to minimize.
[2023-03-20 00:32:17] [INFO ] Deduced a trap composed of 24 places in 527 ms of which 1 ms to minimize.
[2023-03-20 00:32:18] [INFO ] Deduced a trap composed of 24 places in 561 ms of which 1 ms to minimize.
[2023-03-20 00:32:18] [INFO ] Deduced a trap composed of 30 places in 421 ms of which 1 ms to minimize.
[2023-03-20 00:32:19] [INFO ] Deduced a trap composed of 25 places in 396 ms of which 1 ms to minimize.
[2023-03-20 00:32:19] [INFO ] Deduced a trap composed of 27 places in 483 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 00:32:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:32:19] [INFO ] After 25290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 304 ms.
Support contains 113 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2103 transition count 1516
Reduce places removed 437 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 439 rules applied. Total rules applied 876 place count 1666 transition count 1514
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 30 rules applied. Total rules applied 906 place count 1665 transition count 1485
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 935 place count 1636 transition count 1485
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 935 place count 1636 transition count 1360
Deduced a syphon composed of 125 places in 3 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1185 place count 1511 transition count 1360
Discarding 188 places :
Symmetric choice reduction at 4 with 188 rule applications. Total rules 1373 place count 1323 transition count 1172
Iterating global reduction 4 with 188 rules applied. Total rules applied 1561 place count 1323 transition count 1172
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1561 place count 1323 transition count 1098
Deduced a syphon composed of 74 places in 6 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1709 place count 1249 transition count 1098
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 15 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 2609 place count 799 transition count 648
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2763 place count 722 transition count 688
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 722 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2767 place count 720 transition count 686
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 2793 place count 720 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2794 place count 719 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2796 place count 717 transition count 685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2796 place count 717 transition count 684
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2798 place count 716 transition count 684
Applied a total of 2798 rules in 591 ms. Remains 716 /2103 variables (removed 1387) and now considering 684/1953 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 716/2103 places, 684/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 121015 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121015 steps, saw 68773 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 684 rows 716 cols
[2023-03-20 00:32:24] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-20 00:32:24] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:32:24] [INFO ] [Nat]Absence check using 269 positive place invariants in 40 ms returned sat
[2023-03-20 00:32:25] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:25] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-20 00:32:25] [INFO ] After 608ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 0 ms to minimize.
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 1 ms to minimize.
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 18 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 7 places in 195 ms of which 1 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 0 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 0 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 6 places in 158 ms of which 1 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 5 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 0 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 0 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2462 ms
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 0 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 0 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Deduced a trap composed of 5 places in 318 ms of which 1 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1146 ms
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 1 ms to minimize.
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 0 ms to minimize.
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 8 places in 121 ms of which 1 ms to minimize.
[2023-03-20 00:32:31] [INFO ] Deduced a trap composed of 6 places in 187 ms of which 0 ms to minimize.
[2023-03-20 00:32:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1096 ms
[2023-03-20 00:32:31] [INFO ] After 5962ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 469 ms.
[2023-03-20 00:32:31] [INFO ] After 7411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 117 ms.
Support contains 113 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 24 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 716/716 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 26 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2023-03-20 00:32:31] [INFO ] Invariant cache hit.
[2023-03-20 00:32:32] [INFO ] Implicit Places using invariants in 364 ms returned [702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/716 places, 684/684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 683
Applied a total of 2 rules in 38 ms. Remains 714 /715 variables (removed 1) and now considering 683/684 (removed 1) transitions.
// Phase 1: matrix 683 rows 714 cols
[2023-03-20 00:32:32] [INFO ] Computed 268 place invariants in 6 ms
[2023-03-20 00:32:32] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-20 00:32:32] [INFO ] Invariant cache hit.
[2023-03-20 00:32:33] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-20 00:32:34] [INFO ] Implicit Places using invariants and state equation in 1394 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/716 places, 683/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2187 ms. Remains : 714/716 places, 683/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 136397 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136397 steps, saw 78230 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 00:32:37] [INFO ] Invariant cache hit.
[2023-03-20 00:32:38] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:32:38] [INFO ] [Nat]Absence check using 268 positive place invariants in 53 ms returned sat
[2023-03-20 00:32:39] [INFO ] After 812ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:39] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-20 00:32:39] [INFO ] After 630ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:40] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-20 00:32:40] [INFO ] Deduced a trap composed of 7 places in 149 ms of which 13 ms to minimize.
[2023-03-20 00:32:40] [INFO ] Deduced a trap composed of 7 places in 184 ms of which 1 ms to minimize.
[2023-03-20 00:32:40] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:32:40] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-20 00:32:41] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 0 ms to minimize.
[2023-03-20 00:32:41] [INFO ] Deduced a trap composed of 5 places in 213 ms of which 0 ms to minimize.
[2023-03-20 00:32:41] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 0 ms to minimize.
[2023-03-20 00:32:41] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1723 ms
[2023-03-20 00:32:42] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 1 ms to minimize.
[2023-03-20 00:32:42] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 26 ms to minimize.
[2023-03-20 00:32:42] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 1 ms to minimize.
[2023-03-20 00:32:42] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 1 ms to minimize.
[2023-03-20 00:32:42] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1172 ms
[2023-03-20 00:32:43] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 13 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 14 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 13 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 0 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 3 ms to minimize.
[2023-03-20 00:32:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 868 ms
[2023-03-20 00:32:44] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 0 ms to minimize.
[2023-03-20 00:32:44] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-20 00:32:44] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-20 00:32:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 708 ms
[2023-03-20 00:32:44] [INFO ] After 5792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 638 ms.
[2023-03-20 00:32:45] [INFO ] After 7615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 156 ms.
Support contains 113 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 23 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 714/714 places, 683/683 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 23 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
[2023-03-20 00:32:45] [INFO ] Invariant cache hit.
[2023-03-20 00:32:46] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-20 00:32:46] [INFO ] Invariant cache hit.
[2023-03-20 00:32:46] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-20 00:32:47] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1679 ms to find 0 implicit places.
[2023-03-20 00:32:47] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-20 00:32:47] [INFO ] Invariant cache hit.
[2023-03-20 00:32:48] [INFO ] Dead Transitions using invariants and state equation in 465 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2230 ms. Remains : 714/714 places, 683/683 transitions.
Partial Free-agglomeration rule applied 73 times.
Drop transitions removed 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 714 transition count 683
Applied a total of 73 rules in 23 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 683 rows 714 cols
[2023-03-20 00:32:48] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:32:48] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 00:32:48] [INFO ] [Nat]Absence check using 268 positive place invariants in 56 ms returned sat
[2023-03-20 00:32:49] [INFO ] After 651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-20 00:32:49] [INFO ] After 397ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:49] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 0 ms to minimize.
[2023-03-20 00:32:50] [INFO ] Deduced a trap composed of 7 places in 258 ms of which 1 ms to minimize.
[2023-03-20 00:32:50] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-20 00:32:50] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 1 ms to minimize.
[2023-03-20 00:32:50] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2023-03-20 00:32:50] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 0 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 0 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-03-20 00:32:51] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 1 ms to minimize.
[2023-03-20 00:32:52] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:32:52] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-20 00:32:52] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 1 ms to minimize.
[2023-03-20 00:32:52] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2023-03-20 00:32:52] [INFO ] Deduced a trap composed of 6 places in 99 ms of which 0 ms to minimize.
[2023-03-20 00:32:53] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-20 00:32:53] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-20 00:32:53] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 3556 ms
[2023-03-20 00:32:53] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2023-03-20 00:32:53] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 0 ms to minimize.
[2023-03-20 00:32:53] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 1 ms to minimize.
[2023-03-20 00:32:54] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 1 ms to minimize.
[2023-03-20 00:32:54] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:32:54] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 0 ms to minimize.
[2023-03-20 00:32:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1090 ms
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 5 places in 417 ms of which 1 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 9 places in 257 ms of which 0 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 1 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1709 ms
[2023-03-20 00:32:56] [INFO ] After 7344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 452 ms.
[2023-03-20 00:32:57] [INFO ] After 8784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 00:32:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 00:32:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 714 places, 683 transitions and 2947 arcs took 7 ms.
[2023-03-20 00:32:57] [INFO ] Flatten gal took : 91 ms
Total runtime 65591 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-030B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272379280

--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 26 (type EXCL) for 9 ShieldIIPt-PT-030B-ReachabilityCardinality-11
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 9 ShieldIIPt-PT-030B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 9 ShieldIIPt-PT-030B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 9 ShieldIIPt-PT-030B-ReachabilityCardinality-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 22 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-11
lola: result : true
lola: fired transitions : 42
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 25 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityCardinality-11 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityCardinality-11 (obsolete)
lola: LAUNCH task # 35 (type EXCL) for 0 ShieldIIPt-PT-030B-ReachabilityCardinality-00
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 20 (type FNDP) for 6 ShieldIIPt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type EQUN) for 6 ShieldIIPt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 31 (type SRCH) for 6 ShieldIIPt-PT-030B-ReachabilityCardinality-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 31 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityCardinality-07
lola: result : true
lola: markings : 118
lola: fired transitions : 117
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-23.sara.
lola: CANCELED task # 20 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-07 (obsolete)
lola: CANCELED task # 21 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityCardinality-07 (obsolete)
lola: LAUNCH task # 18 (type FNDP) for 3 ShieldIIPt-PT-030B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 3 ShieldIIPt-PT-030B-ReachabilityCardinality-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 37 (type SRCH) for 3 ShieldIIPt-PT-030B-ReachabilityCardinality-02
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: FINISHED task # 18 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-02
lola: result : true
lola: fired transitions : 63
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 19 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityCardinality-02 (obsolete)
lola: CANCELED task # 37 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityCardinality-02 (obsolete)
lola: LAUNCH task # 41 (type FNDP) for 12 ShieldIIPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: LAUNCH task # 42 (type EQUN) for 12 ShieldIIPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 44 (type SRCH) for 12 ShieldIIPt-PT-030B-ReachabilityCardinality-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 20 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-07
lola: result : true
lola: fired transitions : 116
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/371/ReachabilityCardinality-19.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 41 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-12
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 1.000000
lola: memory pages used : 0
lola: CANCELED task # 42 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityCardinality-12 (obsolete)
lola: CANCELED task # 44 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityCardinality-12 (obsolete)
lola: LAUNCH task # 16 (type FNDP) for 0 ShieldIIPt-PT-030B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 0 ShieldIIPt-PT-030B-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type SRCH) for 0 ShieldIIPt-PT-030B-ReachabilityCardinality-00
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 # 34 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityCardinality-00
lola: result : true
lola: markings : 52
lola: fired transitions : 51
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 16 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 17 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 35 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityCardinality-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-ReachabilityCardinality-00: AG false tandem / insertion
ShieldIIPt-PT-030B-ReachabilityCardinality-02: EF true findpath
ShieldIIPt-PT-030B-ReachabilityCardinality-07: EF true tandem / insertion
ShieldIIPt-PT-030B-ReachabilityCardinality-11: EF true findpath
ShieldIIPt-PT-030B-ReachabilityCardinality-12: AG false findpath


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

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="ShieldIIPt-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 ShieldIIPt-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-167903715100302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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