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.r393-oct2-167903717300655.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 ltsminxred
Input is ShieldPPPt-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300655
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 20:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 569K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679466945289

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:35:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 06:35:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:35:49] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2023-03-22 06:35:49] [INFO ] Transformed 2343 places.
[2023-03-22 06:35:49] [INFO ] Transformed 2133 transitions.
[2023-03-22 06:35:49] [INFO ] Found NUPN structural information;
[2023-03-22 06:35:49] [INFO ] Parsed PT model containing 2343 places and 2133 transitions and 5346 arcs in 532 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2133 rows 2343 cols
[2023-03-22 06:35:50] [INFO ] Computed 331 place invariants in 47 ms
[2023-03-22 06:35:52] [INFO ] [Real]Absence check using 331 positive place invariants in 374 ms returned sat
[2023-03-22 06:35:52] [INFO ] After 1921ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 06:35:54] [INFO ] [Nat]Absence check using 331 positive place invariants in 268 ms returned sat
[2023-03-22 06:36:02] [INFO ] After 7629ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-22 06:36:03] [INFO ] Deduced a trap composed of 25 places in 790 ms of which 21 ms to minimize.
[2023-03-22 06:36:04] [INFO ] Deduced a trap composed of 31 places in 1051 ms of which 2 ms to minimize.
[2023-03-22 06:36:05] [INFO ] Deduced a trap composed of 15 places in 747 ms of which 2 ms to minimize.
[2023-03-22 06:36:06] [INFO ] Deduced a trap composed of 23 places in 786 ms of which 1 ms to minimize.
[2023-03-22 06:36:07] [INFO ] Deduced a trap composed of 25 places in 585 ms of which 15 ms to minimize.
[2023-03-22 06:36:07] [INFO ] Deduced a trap composed of 19 places in 719 ms of which 1 ms to minimize.
[2023-03-22 06:36:08] [INFO ] Deduced a trap composed of 27 places in 698 ms of which 2 ms to minimize.
[2023-03-22 06:36:09] [INFO ] Deduced a trap composed of 18 places in 904 ms of which 1 ms to minimize.
[2023-03-22 06:36:10] [INFO ] Deduced a trap composed of 22 places in 632 ms of which 1 ms to minimize.
[2023-03-22 06:36:11] [INFO ] Deduced a trap composed of 20 places in 487 ms of which 1 ms to minimize.
[2023-03-22 06:36:11] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 1 ms to minimize.
[2023-03-22 06:36:12] [INFO ] Deduced a trap composed of 30 places in 772 ms of which 1 ms to minimize.
[2023-03-22 06:36:13] [INFO ] Deduced a trap composed of 27 places in 534 ms of which 1 ms to minimize.
[2023-03-22 06:36:13] [INFO ] Deduced a trap composed of 35 places in 403 ms of which 2 ms to minimize.
[2023-03-22 06:36:14] [INFO ] Deduced a trap composed of 28 places in 804 ms of which 3 ms to minimize.
[2023-03-22 06:36:15] [INFO ] Deduced a trap composed of 19 places in 922 ms of which 1 ms to minimize.
[2023-03-22 06:36:16] [INFO ] Deduced a trap composed of 36 places in 593 ms of which 2 ms to minimize.
[2023-03-22 06:36:17] [INFO ] Deduced a trap composed of 25 places in 593 ms of which 15 ms to minimize.
[2023-03-22 06:36:17] [INFO ] Deduced a trap composed of 21 places in 503 ms of which 4 ms to minimize.
[2023-03-22 06:36:18] [INFO ] Deduced a trap composed of 40 places in 373 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-22 06:36:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:36:18] [INFO ] After 25304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 981 ms.
Support contains 129 out of 2343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2343/2343 places, 2133/2133 transitions.
Drop transitions removed 467 transitions
Trivial Post-agglo rules discarded 467 transitions
Performed 467 trivial Post agglomeration. Transition count delta: 467
Iterating post reduction 0 with 467 rules applied. Total rules applied 467 place count 2343 transition count 1666
Reduce places removed 467 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 469 rules applied. Total rules applied 936 place count 1876 transition count 1664
Reduce places removed 1 places and 0 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 2 with 36 rules applied. Total rules applied 972 place count 1875 transition count 1629
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 1007 place count 1840 transition count 1629
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 128 Pre rules applied. Total rules applied 1007 place count 1840 transition count 1501
Deduced a syphon composed of 128 places in 4 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 4 with 256 rules applied. Total rules applied 1263 place count 1712 transition count 1501
Discarding 187 places :
Symmetric choice reduction at 4 with 187 rule applications. Total rules 1450 place count 1525 transition count 1314
Iterating global reduction 4 with 187 rules applied. Total rules applied 1637 place count 1525 transition count 1314
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 72 Pre rules applied. Total rules applied 1637 place count 1525 transition count 1242
Deduced a syphon composed of 72 places in 6 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 1781 place count 1453 transition count 1242
Performed 458 Post agglomeration using F-continuation condition.Transition count delta: 458
Deduced a syphon composed of 458 places in 2 ms
Reduce places removed 458 places and 0 transitions.
Iterating global reduction 4 with 916 rules applied. Total rules applied 2697 place count 995 transition count 784
Renaming transitions due to excessive name length > 1024 char.
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 2829 place count 929 transition count 784
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 2839 place count 929 transition count 774
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2849 place count 919 transition count 774
Partial Free-agglomeration rule applied 77 times.
Drop transitions removed 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 2926 place count 919 transition count 774
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2927 place count 918 transition count 773
Applied a total of 2927 rules in 702 ms. Remains 918 /2343 variables (removed 1425) and now considering 773/2133 (removed 1360) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 703 ms. Remains : 918/2343 places, 773/2133 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=29 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 10) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 773 rows 918 cols
[2023-03-22 06:36:20] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 06:36:21] [INFO ] [Real]Absence check using 331 positive place invariants in 185 ms returned sat
[2023-03-22 06:36:21] [INFO ] After 493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 06:36:21] [INFO ] [Nat]Absence check using 331 positive place invariants in 99 ms returned sat
[2023-03-22 06:36:23] [INFO ] After 1151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-22 06:36:23] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-22 06:36:24] [INFO ] After 1056ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-22 06:36:24] [INFO ] Deduced a trap composed of 7 places in 240 ms of which 1 ms to minimize.
[2023-03-22 06:36:25] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-22 06:36:25] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 2 ms to minimize.
[2023-03-22 06:36:25] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2023-03-22 06:36:25] [INFO ] Deduced a trap composed of 5 places in 270 ms of which 0 ms to minimize.
[2023-03-22 06:36:26] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 14 ms to minimize.
[2023-03-22 06:36:26] [INFO ] Deduced a trap composed of 5 places in 695 ms of which 0 ms to minimize.
[2023-03-22 06:36:27] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 1 ms to minimize.
[2023-03-22 06:36:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2657 ms
[2023-03-22 06:36:27] [INFO ] Deduced a trap composed of 5 places in 229 ms of which 1 ms to minimize.
[2023-03-22 06:36:27] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-22 06:36:27] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-22 06:36:28] [INFO ] Deduced a trap composed of 7 places in 424 ms of which 1 ms to minimize.
[2023-03-22 06:36:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1093 ms
[2023-03-22 06:36:28] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-22 06:36:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 06:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 361 ms
[2023-03-22 06:36:29] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 0 ms to minimize.
[2023-03-22 06:36:29] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2023-03-22 06:36:29] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 1 ms to minimize.
[2023-03-22 06:36:30] [INFO ] Deduced a trap composed of 8 places in 131 ms of which 0 ms to minimize.
[2023-03-22 06:36:30] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 0 ms to minimize.
[2023-03-22 06:36:30] [INFO ] Deduced a trap composed of 6 places in 185 ms of which 2 ms to minimize.
[2023-03-22 06:36:30] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 1 ms to minimize.
[2023-03-22 06:36:30] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 0 ms to minimize.
[2023-03-22 06:36:31] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 0 ms to minimize.
[2023-03-22 06:36:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2084 ms
[2023-03-22 06:36:32] [INFO ] Deduced a trap composed of 7 places in 1076 ms of which 1 ms to minimize.
[2023-03-22 06:36:33] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-22 06:36:33] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 1 ms to minimize.
[2023-03-22 06:36:33] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 0 ms to minimize.
[2023-03-22 06:36:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1800 ms
[2023-03-22 06:36:33] [INFO ] After 10235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 740 ms.
[2023-03-22 06:36:34] [INFO ] After 12951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 292 ms.
Support contains 91 out of 918 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 918/918 places, 773/773 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 918 transition count 762
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 907 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 906 transition count 761
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 24 place count 906 transition count 753
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 40 place count 898 transition count 753
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 897 transition count 752
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 897 transition count 752
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 94 place count 871 transition count 726
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 866 transition count 726
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 108 place count 866 transition count 726
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 864 transition count 724
Applied a total of 110 rules in 309 ms. Remains 864 /918 variables (removed 54) and now considering 724/773 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 864/918 places, 724/773 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-030B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) 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 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 724 rows 864 cols
[2023-03-22 06:36:35] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 06:36:36] [INFO ] [Real]Absence check using 331 positive place invariants in 173 ms returned sat
[2023-03-22 06:36:36] [INFO ] After 425ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:36:36] [INFO ] [Nat]Absence check using 331 positive place invariants in 86 ms returned sat
[2023-03-22 06:36:37] [INFO ] After 804ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:36:37] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-22 06:36:38] [INFO ] After 885ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:36:38] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 1 ms to minimize.
[2023-03-22 06:36:38] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Deduced a trap composed of 6 places in 183 ms of which 27 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 0 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 0 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 0 ms to minimize.
[2023-03-22 06:36:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1496 ms
[2023-03-22 06:36:40] [INFO ] Deduced a trap composed of 6 places in 219 ms of which 24 ms to minimize.
[2023-03-22 06:36:40] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2023-03-22 06:36:40] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-22 06:36:41] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 1 ms to minimize.
[2023-03-22 06:36:41] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2023-03-22 06:36:41] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2023-03-22 06:36:41] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 06:36:41] [INFO ] Deduced a trap composed of 7 places in 112 ms of which 0 ms to minimize.
[2023-03-22 06:36:42] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 14 ms to minimize.
[2023-03-22 06:36:42] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2023-03-22 06:36:42] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 3 ms to minimize.
[2023-03-22 06:36:42] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 0 ms to minimize.
[2023-03-22 06:36:42] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 2 ms to minimize.
[2023-03-22 06:36:43] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 25 ms to minimize.
[2023-03-22 06:36:43] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 13 ms to minimize.
[2023-03-22 06:36:43] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2023-03-22 06:36:43] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3397 ms
[2023-03-22 06:36:43] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 06:36:44] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-22 06:36:44] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-22 06:36:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2023-03-22 06:36:44] [INFO ] After 6913ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1060 ms.
[2023-03-22 06:36:45] [INFO ] After 9199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 335 ms.
Support contains 90 out of 864 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 864/864 places, 724/724 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 0 with 1 rules applied. Total rules applied 1 place count 864 transition count 723
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 863 transition count 723
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 862 transition count 723
Applied a total of 4 rules in 62 ms. Remains 862 /864 variables (removed 2) and now considering 723/724 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 862/864 places, 723/724 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 8) 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 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 90622 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 90622 steps, saw 70169 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 723 rows 862 cols
[2023-03-22 06:36:49] [INFO ] Computed 331 place invariants in 3 ms
[2023-03-22 06:36:50] [INFO ] [Real]Absence check using 331 positive place invariants in 83 ms returned sat
[2023-03-22 06:36:50] [INFO ] After 354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:36:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 61 ms returned sat
[2023-03-22 06:36:51] [INFO ] After 1107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:36:51] [INFO ] State equation strengthened by 125 read => feed constraints.
[2023-03-22 06:36:54] [INFO ] After 2286ms SMT Verify possible using 125 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:36:54] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2023-03-22 06:36:54] [INFO ] Deduced a trap composed of 13 places in 515 ms of which 1 ms to minimize.
[2023-03-22 06:36:55] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 1 ms to minimize.
[2023-03-22 06:36:56] [INFO ] Deduced a trap composed of 5 places in 731 ms of which 0 ms to minimize.
[2023-03-22 06:36:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1979 ms
[2023-03-22 06:36:56] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 0 ms to minimize.
[2023-03-22 06:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 453 ms
[2023-03-22 06:36:57] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 1 ms to minimize.
[2023-03-22 06:36:58] [INFO ] Deduced a trap composed of 9 places in 285 ms of which 1 ms to minimize.
[2023-03-22 06:36:58] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 0 ms to minimize.
[2023-03-22 06:36:58] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-22 06:36:58] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-22 06:36:59] [INFO ] Deduced a trap composed of 6 places in 160 ms of which 0 ms to minimize.
[2023-03-22 06:36:59] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2143 ms
[2023-03-22 06:36:59] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 1 ms to minimize.
[2023-03-22 06:36:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-22 06:37:00] [INFO ] Deduced a trap composed of 7 places in 196 ms of which 0 ms to minimize.
[2023-03-22 06:37:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2023-03-22 06:37:00] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 0 ms to minimize.
[2023-03-22 06:37:00] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2023-03-22 06:37:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 654 ms
[2023-03-22 06:37:00] [INFO ] After 9107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1483 ms.
[2023-03-22 06:37:02] [INFO ] After 12187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 163 ms.
Support contains 90 out of 862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 723/723 transitions.
Applied a total of 0 rules in 19 ms. Remains 862 /862 variables (removed 0) and now considering 723/723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 862/862 places, 723/723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 862/862 places, 723/723 transitions.
Applied a total of 0 rules in 19 ms. Remains 862 /862 variables (removed 0) and now considering 723/723 (removed 0) transitions.
[2023-03-22 06:37:02] [INFO ] Invariant cache hit.
[2023-03-22 06:37:03] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-22 06:37:03] [INFO ] Invariant cache hit.
[2023-03-22 06:37:04] [INFO ] State equation strengthened by 125 read => feed constraints.
[2023-03-22 06:37:06] [INFO ] Implicit Places using invariants and state equation in 3006 ms returned []
Implicit Place search using SMT with State Equation took 3592 ms to find 0 implicit places.
[2023-03-22 06:37:06] [INFO ] Redundant transitions in 38 ms returned []
[2023-03-22 06:37:06] [INFO ] Invariant cache hit.
[2023-03-22 06:37:06] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4301 ms. Remains : 862/862 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 862 transition count 722
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 861 transition count 722
Partial Free-agglomeration rule applied 142 times.
Drop transitions removed 142 transitions
Iterating global reduction 0 with 142 rules applied. Total rules applied 144 place count 861 transition count 722
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 145 place count 861 transition count 721
Applied a total of 145 rules in 75 ms. Remains 861 /862 variables (removed 1) and now considering 721/723 (removed 2) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 721 rows 861 cols
[2023-03-22 06:37:07] [INFO ] Computed 331 place invariants in 2 ms
[2023-03-22 06:37:07] [INFO ] [Real]Absence check using 331 positive place invariants in 56 ms returned sat
[2023-03-22 06:37:07] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:37:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 87 ms returned sat
[2023-03-22 06:37:09] [INFO ] After 1298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:37:09] [INFO ] State equation strengthened by 124 read => feed constraints.
[2023-03-22 06:37:10] [INFO ] After 832ms SMT Verify possible using 124 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 1 ms to minimize.
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-22 06:37:10] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 2 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2023-03-22 06:37:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1579 ms
[2023-03-22 06:37:12] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-22 06:37:12] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 1 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 1 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 0 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-22 06:37:13] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 6 places in 116 ms of which 0 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2098 ms
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 1 ms to minimize.
[2023-03-22 06:37:14] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-22 06:37:15] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 0 ms to minimize.
[2023-03-22 06:37:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 780 ms
[2023-03-22 06:37:15] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-22 06:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-22 06:37:16] [INFO ] After 6781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1377 ms.
[2023-03-22 06:37:17] [INFO ] After 10143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:37:17] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 37 ms.
[2023-03-22 06:37:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 862 places, 723 transitions and 3040 arcs took 7 ms.
[2023-03-22 06:37:17] [INFO ] Flatten gal took : 117 ms
Total runtime 88790 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/851/inv_0_ --invariant=/tmp/851/inv_1_ --invariant=/tmp/851/inv_2_ --invariant=/tmp/851/inv_3_ --invariant=/tmp/851/inv_4_ --invariant=/tmp/851/inv_5_ --invariant=/tmp/851/inv_6_ --invariant=/tmp/851/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 10602724 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097948 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-030B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldPPPt-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 r393-oct2-167903717300655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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