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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
942.783 66515.00 97381.00 30.60 TTTTTFFFTTTFTFTF normal

Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1679272327994

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:32:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:32:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:32:10] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-20 00:32:10] [INFO ] Transformed 2103 places.
[2023-03-20 00:32:10] [INFO ] Transformed 1953 transitions.
[2023-03-20 00:32:10] [INFO ] Found NUPN structural information;
[2023-03-20 00:32:10] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 16) seen :6
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-20 00:32:11] [INFO ] Computed 271 place invariants in 19 ms
[2023-03-20 00:32:12] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-20 00:32:13] [INFO ] [Nat]Absence check using 271 positive place invariants in 135 ms returned sat
[2023-03-20 00:32:16] [INFO ] After 2978ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-03-20 00:32:17] [INFO ] Deduced a trap composed of 20 places in 958 ms of which 24 ms to minimize.
[2023-03-20 00:32:18] [INFO ] Deduced a trap composed of 26 places in 591 ms of which 2 ms to minimize.
[2023-03-20 00:32:19] [INFO ] Deduced a trap composed of 23 places in 625 ms of which 2 ms to minimize.
[2023-03-20 00:32:19] [INFO ] Deduced a trap composed of 13 places in 557 ms of which 3 ms to minimize.
[2023-03-20 00:32:20] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 6 ms to minimize.
[2023-03-20 00:32:20] [INFO ] Deduced a trap composed of 32 places in 512 ms of which 1 ms to minimize.
[2023-03-20 00:32:21] [INFO ] Deduced a trap composed of 22 places in 504 ms of which 1 ms to minimize.
[2023-03-20 00:32:22] [INFO ] Deduced a trap composed of 43 places in 523 ms of which 1 ms to minimize.
[2023-03-20 00:32:22] [INFO ] Deduced a trap composed of 37 places in 488 ms of which 1 ms to minimize.
[2023-03-20 00:32:23] [INFO ] Deduced a trap composed of 19 places in 481 ms of which 3 ms to minimize.
[2023-03-20 00:32:23] [INFO ] Deduced a trap composed of 18 places in 616 ms of which 5 ms to minimize.
[2023-03-20 00:32:24] [INFO ] Deduced a trap composed of 28 places in 495 ms of which 1 ms to minimize.
[2023-03-20 00:32:25] [INFO ] Deduced a trap composed of 16 places in 469 ms of which 1 ms to minimize.
[2023-03-20 00:32:25] [INFO ] Deduced a trap composed of 27 places in 479 ms of which 1 ms to minimize.
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 25 places in 496 ms of which 3 ms to minimize.
[2023-03-20 00:32:26] [INFO ] Deduced a trap composed of 22 places in 508 ms of which 1 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 25 places in 444 ms of which 3 ms to minimize.
[2023-03-20 00:32:27] [INFO ] Deduced a trap composed of 21 places in 460 ms of which 1 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 17 places in 429 ms of which 1 ms to minimize.
[2023-03-20 00:32:28] [INFO ] Deduced a trap composed of 15 places in 416 ms of which 1 ms to minimize.
[2023-03-20 00:32:29] [INFO ] Deduced a trap composed of 39 places in 508 ms of which 1 ms to minimize.
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 26 places in 522 ms of which 2 ms to minimize.
[2023-03-20 00:32:30] [INFO ] Deduced a trap composed of 29 places in 460 ms of which 1 ms to minimize.
[2023-03-20 00:32:31] [INFO ] Deduced a trap composed of 25 places in 416 ms of which 1 ms to minimize.
[2023-03-20 00:32:31] [INFO ] Deduced a trap composed of 28 places in 430 ms of which 14 ms to minimize.
[2023-03-20 00:32:32] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 1 ms to minimize.
[2023-03-20 00:32:32] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 1 ms to minimize.
[2023-03-20 00:32:33] [INFO ] Deduced a trap composed of 26 places in 424 ms of which 1 ms to minimize.
[2023-03-20 00:32:33] [INFO ] Deduced a trap composed of 22 places in 463 ms of which 1 ms to minimize.
[2023-03-20 00:32:34] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 3 ms to minimize.
[2023-03-20 00:32:34] [INFO ] Deduced a trap composed of 21 places in 502 ms of which 1 ms to minimize.
[2023-03-20 00:32:35] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:32:35] [INFO ] Deduced a trap composed of 33 places in 423 ms of which 1 ms to minimize.
[2023-03-20 00:32:36] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 1 ms to minimize.
[2023-03-20 00:32:36] [INFO ] Deduced a trap composed of 38 places in 407 ms of which 1 ms to minimize.
[2023-03-20 00:32:37] [INFO ] Deduced a trap composed of 46 places in 387 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:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:32:37] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 663 ms.
Support contains 74 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 2103 transition count 1504
Reduce places removed 449 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 451 rules applied. Total rules applied 900 place count 1654 transition count 1502
Reduce places removed 1 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 26 rules applied. Total rules applied 926 place count 1653 transition count 1477
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 951 place count 1628 transition count 1477
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 124 Pre rules applied. Total rules applied 951 place count 1628 transition count 1353
Deduced a syphon composed of 124 places in 3 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 4 with 248 rules applied. Total rules applied 1199 place count 1504 transition count 1353
Discarding 202 places :
Symmetric choice reduction at 4 with 202 rule applications. Total rules 1401 place count 1302 transition count 1151
Iterating global reduction 4 with 202 rules applied. Total rules applied 1603 place count 1302 transition count 1151
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 1603 place count 1302 transition count 1076
Deduced a syphon composed of 75 places in 5 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 1753 place count 1227 transition count 1076
Performed 471 Post agglomeration using F-continuation condition.Transition count delta: 471
Deduced a syphon composed of 471 places in 2 ms
Reduce places removed 471 places and 0 transitions.
Iterating global reduction 4 with 942 rules applied. Total rules applied 2695 place count 756 transition count 605
Renaming transitions due to excessive name length > 1024 char.
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 2837 place count 685 transition count 639
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 2843 place count 685 transition count 633
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2849 place count 679 transition count 633
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 2877 place count 679 transition count 633
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2878 place count 678 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2879 place count 677 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2879 place count 677 transition count 631
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 2881 place count 676 transition count 631
Applied a total of 2881 rules in 673 ms. Remains 676 /2103 variables (removed 1427) and now considering 631/1953 (removed 1322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 675 ms. Remains : 676/2103 places, 631/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 121644 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121644 steps, saw 80887 distinct states, run finished after 3003 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 631 rows 676 cols
[2023-03-20 00:32:42] [INFO ] Computed 270 place invariants in 4 ms
[2023-03-20 00:32:42] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 00:32:42] [INFO ] [Nat]Absence check using 270 positive place invariants in 88 ms returned sat
[2023-03-20 00:32:43] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 00:32:43] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-20 00:32:44] [INFO ] After 824ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 00:32:44] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2023-03-20 00:32:44] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 6 places in 125 ms of which 1 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 0 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 0 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 8 places in 118 ms of which 0 ms to minimize.
[2023-03-20 00:32:45] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 2 ms to minimize.
[2023-03-20 00:32:46] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-20 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1486 ms
[2023-03-20 00:32:46] [INFO ] Deduced a trap composed of 6 places in 128 ms of which 0 ms to minimize.
[2023-03-20 00:32:46] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2023-03-20 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2023-03-20 00:32:46] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 1 ms to minimize.
[2023-03-20 00:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-20 00:32:47] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 0 ms to minimize.
[2023-03-20 00:32:47] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2023-03-20 00:32:47] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-20 00:32:47] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2023-03-20 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 707 ms
[2023-03-20 00:32:47] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 0 ms to minimize.
[2023-03-20 00:32:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-20 00:32:48] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 0 ms to minimize.
[2023-03-20 00:32:48] [INFO ] Deduced a trap composed of 6 places in 106 ms of which 1 ms to minimize.
[2023-03-20 00:32:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-20 00:32:49] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 0 ms to minimize.
[2023-03-20 00:32:49] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-20 00:32:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-20 00:32:49] [INFO ] After 5551ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 701 ms.
[2023-03-20 00:32:49] [INFO ] After 7484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 222 ms.
Support contains 74 out of 676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 631/631 transitions.
Applied a total of 0 rules in 45 ms. Remains 676 /676 variables (removed 0) and now considering 631/631 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 676/676 places, 631/631 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 631/631 transitions.
Applied a total of 0 rules in 45 ms. Remains 676 /676 variables (removed 0) and now considering 631/631 (removed 0) transitions.
[2023-03-20 00:32:50] [INFO ] Invariant cache hit.
[2023-03-20 00:32:50] [INFO ] Implicit Places using invariants in 372 ms returned [661]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 675/676 places, 631/631 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 674 transition count 630
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 674 transition count 630
Applied a total of 2 rules in 55 ms. Remains 674 /675 variables (removed 1) and now considering 630/631 (removed 1) transitions.
// Phase 1: matrix 630 rows 674 cols
[2023-03-20 00:32:50] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-20 00:32:51] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-20 00:32:51] [INFO ] Invariant cache hit.
[2023-03-20 00:32:51] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-20 00:32:52] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 674/676 places, 630/631 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2307 ms. Remains : 674/676 places, 630/631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 9) seen :3
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 00:32:53] [INFO ] Invariant cache hit.
[2023-03-20 00:32:53] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:32:53] [INFO ] [Nat]Absence check using 269 positive place invariants in 49 ms returned sat
[2023-03-20 00:32:54] [INFO ] After 554ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:32:54] [INFO ] State equation strengthened by 155 read => feed constraints.
[2023-03-20 00:32:54] [INFO ] After 674ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 301 ms
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 7 places in 114 ms of which 1 ms to minimize.
[2023-03-20 00:32:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-20 00:32:55] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2023-03-20 00:32:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 660 ms
[2023-03-20 00:32:57] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 5 ms to minimize.
[2023-03-20 00:32:57] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2023-03-20 00:32:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2023-03-20 00:32:57] [INFO ] After 3085ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 522 ms.
[2023-03-20 00:32:57] [INFO ] After 4471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 228 ms.
Support contains 61 out of 674 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 674/674 places, 630/630 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 674 transition count 627
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 671 transition count 626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 670 transition count 626
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 670 transition count 621
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 665 transition count 621
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 30 place count 659 transition count 615
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 40 place count 654 transition count 619
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 654 transition count 619
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 653 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 652 transition count 618
Applied a total of 43 rules in 85 ms. Remains 652 /674 variables (removed 22) and now considering 618/630 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 652/674 places, 618/630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 166950 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166950 steps, saw 114224 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 618 rows 652 cols
[2023-03-20 00:33:01] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-20 00:33:01] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:33:01] [INFO ] [Nat]Absence check using 268 positive place invariants in 45 ms returned sat
[2023-03-20 00:33:02] [INFO ] After 540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:33:02] [INFO ] State equation strengthened by 167 read => feed constraints.
[2023-03-20 00:33:03] [INFO ] After 563ms SMT Verify possible using 167 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:33:03] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-20 00:33:03] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2023-03-20 00:33:03] [INFO ] Deduced a trap composed of 6 places in 107 ms of which 1 ms to minimize.
[2023-03-20 00:33:03] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 0 ms to minimize.
[2023-03-20 00:33:03] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 0 ms to minimize.
[2023-03-20 00:33:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 768 ms
[2023-03-20 00:33:04] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2023-03-20 00:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-03-20 00:33:04] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 0 ms to minimize.
[2023-03-20 00:33:05] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 0 ms to minimize.
[2023-03-20 00:33:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
[2023-03-20 00:33:05] [INFO ] After 2659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 524 ms.
[2023-03-20 00:33:05] [INFO ] After 4027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 208 ms.
Support contains 61 out of 652 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 618/618 transitions.
Applied a total of 0 rules in 12 ms. Remains 652 /652 variables (removed 0) and now considering 618/618 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 652/652 places, 618/618 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 652/652 places, 618/618 transitions.
Applied a total of 0 rules in 11 ms. Remains 652 /652 variables (removed 0) and now considering 618/618 (removed 0) transitions.
[2023-03-20 00:33:05] [INFO ] Invariant cache hit.
[2023-03-20 00:33:06] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-20 00:33:06] [INFO ] Invariant cache hit.
[2023-03-20 00:33:06] [INFO ] State equation strengthened by 167 read => feed constraints.
[2023-03-20 00:33:07] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2023-03-20 00:33:07] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-20 00:33:07] [INFO ] Invariant cache hit.
[2023-03-20 00:33:08] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2052 ms. Remains : 652/652 places, 618/618 transitions.
Partial Free-agglomeration rule applied 94 times.
Drop transitions removed 94 transitions
Iterating global reduction 0 with 94 rules applied. Total rules applied 94 place count 652 transition count 618
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 97 place count 652 transition count 615
Applied a total of 97 rules in 75 ms. Remains 652 /652 variables (removed 0) and now considering 615/618 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 615 rows 652 cols
[2023-03-20 00:33:08] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-20 00:33:08] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:33:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 53 ms returned sat
[2023-03-20 00:33:09] [INFO ] After 638ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:33:09] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-20 00:33:09] [INFO ] After 593ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:33:10] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-20 00:33:10] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2023-03-20 00:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 351 ms
[2023-03-20 00:33:10] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 0 ms to minimize.
[2023-03-20 00:33:10] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2023-03-20 00:33:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 420 ms
[2023-03-20 00:33:11] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2023-03-20 00:33:11] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 0 ms to minimize.
[2023-03-20 00:33:11] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 1 ms to minimize.
[2023-03-20 00:33:11] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 1 ms to minimize.
[2023-03-20 00:33:12] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 1 ms to minimize.
[2023-03-20 00:33:12] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2023-03-20 00:33:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1158 ms
[2023-03-20 00:33:12] [INFO ] After 3162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 850 ms.
[2023-03-20 00:33:13] [INFO ] After 5000ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:33:13] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2023-03-20 00:33:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 652 places, 618 transitions and 2910 arcs took 8 ms.
[2023-03-20 00:33:13] [INFO ] Flatten gal took : 84 ms
Total runtime 63670 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-030B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
ReachabilityFireability

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPt-PT-030B-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679272394509

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: 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 # 22 (type EXCL) for 6 ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 6 ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 6 ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 6 ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 21 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: result : true
lola: markings : 57
lola: fired transitions : 56
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-12 (obsolete)
lola: CANCELED task # 22 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityFireability-12 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 29 (type EXCL) for 0 ShieldIIPt-PT-030B-ReachabilityFireability-05
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 0 ShieldIIPt-PT-030B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 0 ShieldIIPt-PT-030B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 0 ShieldIIPt-PT-030B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 18 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-12
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
sara: try reading problem file /home/mcc/execution/367/ReachabilityFireability-19.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 25 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 49
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 26 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 28 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 36 (type EXCL) for 9 ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 32 (type FNDP) for 9 ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 9 ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 9 ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/367/ReachabilityFireability-26.sara.
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 35 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: result : true
lola: markings : 79
lola: fired transitions : 78
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 32 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 33 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityFireability-13 (obsolete)
lola: LAUNCH task # 48 (type EXCL) for 12 ShieldIIPt-PT-030B-ReachabilityFireability-14
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 38 (type FNDP) for 15 ShieldIIPt-PT-030B-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type EQUN) for 15 ShieldIIPt-PT-030B-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 41 (type SRCH) for 15 ShieldIIPt-PT-030B-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 32 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-13
lola: result : unknown
lola: fired transitions : 952
lola: tried executions : 124
lola: time used : 0.000000
lola: memory pages used : 0
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/367/ReachabilityFireability-33.sara.
lola: FINISHED task # 41 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-15
lola: result : false
lola: markings : 289
lola: fired transitions : 495
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 38 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 39 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 50 (type FNDP) for 3 ShieldIIPt-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 51 (type EQUN) for 3 ShieldIIPt-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 53 (type SRCH) for 3 ShieldIIPt-PT-030B-ReachabilityFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 38 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-15
lola: result : unknown
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 50 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-10
lola: result : true
lola: fired transitions : 41
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: CANCELED task # 51 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-10 (obsolete)
lola: CANCELED task # 53 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-10 (obsolete)
lola: LAUNCH task # 44 (type FNDP) for 12 ShieldIIPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 45 (type EQUN) for 12 ShieldIIPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 47 (type SRCH) for 12 ShieldIIPt-PT-030B-ReachabilityFireability-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 44 (type FNDP) for ShieldIIPt-PT-030B-ReachabilityFireability-14
lola: result : true
lola: fired transitions : 49
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 45 (type EQUN) for ShieldIIPt-PT-030B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 47 (type SRCH) for ShieldIIPt-PT-030B-ReachabilityFireability-14 (obsolete)
lola: CANCELED task # 48 (type EXCL) for ShieldIIPt-PT-030B-ReachabilityFireability-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-030B-ReachabilityFireability-05: AG false findpath
ShieldIIPt-PT-030B-ReachabilityFireability-10: EF true findpath
ShieldIIPt-PT-030B-ReachabilityFireability-12: EF true tandem / insertion
ShieldIIPt-PT-030B-ReachabilityFireability-13: AG false tandem / insertion
ShieldIIPt-PT-030B-ReachabilityFireability-14: EF true findpath
ShieldIIPt-PT-030B-ReachabilityFireability-15: EF false tandem / insertion


Time elapsed: 1 secs. Pages in use: 2

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="ReachabilityFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-030B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100303"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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