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-167903716900319.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 ShieldIIPt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 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 686K 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-040B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679439529157

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=ShieldIIPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:58:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:58:51] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-21 22:58:51] [INFO ] Transformed 2803 places.
[2023-03-21 22:58:51] [INFO ] Transformed 2603 transitions.
[2023-03-21 22:58:51] [INFO ] Found NUPN structural information;
[2023-03-21 22:58:51] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 523 ms. (steps per millisecond=19 ) properties (out of 16) seen :7
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 2603 rows 2803 cols
[2023-03-21 22:58:52] [INFO ] Computed 361 place invariants in 40 ms
[2023-03-21 22:58:53] [INFO ] After 1072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:58:54] [INFO ] [Nat]Absence check using 361 positive place invariants in 189 ms returned sat
[2023-03-21 22:59:01] [INFO ] After 6110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:59:02] [INFO ] Deduced a trap composed of 30 places in 840 ms of which 8 ms to minimize.
[2023-03-21 22:59:03] [INFO ] Deduced a trap composed of 20 places in 721 ms of which 1 ms to minimize.
[2023-03-21 22:59:04] [INFO ] Deduced a trap composed of 37 places in 927 ms of which 8 ms to minimize.
[2023-03-21 22:59:05] [INFO ] Deduced a trap composed of 24 places in 894 ms of which 2 ms to minimize.
[2023-03-21 22:59:06] [INFO ] Deduced a trap composed of 21 places in 1010 ms of which 1 ms to minimize.
[2023-03-21 22:59:07] [INFO ] Deduced a trap composed of 14 places in 963 ms of which 2 ms to minimize.
[2023-03-21 22:59:09] [INFO ] Deduced a trap composed of 26 places in 1085 ms of which 2 ms to minimize.
[2023-03-21 22:59:10] [INFO ] Deduced a trap composed of 28 places in 814 ms of which 2 ms to minimize.
[2023-03-21 22:59:11] [INFO ] Deduced a trap composed of 32 places in 948 ms of which 4 ms to minimize.
[2023-03-21 22:59:12] [INFO ] Deduced a trap composed of 24 places in 791 ms of which 2 ms to minimize.
[2023-03-21 22:59:13] [INFO ] Deduced a trap composed of 24 places in 973 ms of which 2 ms to minimize.
[2023-03-21 22:59:14] [INFO ] Deduced a trap composed of 27 places in 812 ms of which 2 ms to minimize.
[2023-03-21 22:59:15] [INFO ] Deduced a trap composed of 24 places in 931 ms of which 2 ms to minimize.
[2023-03-21 22:59:16] [INFO ] Deduced a trap composed of 19 places in 876 ms of which 1 ms to minimize.
[2023-03-21 22:59:17] [INFO ] Deduced a trap composed of 20 places in 826 ms of which 1 ms to minimize.
[2023-03-21 22:59:18] [INFO ] Deduced a trap composed of 21 places in 912 ms of which 3 ms to minimize.
[2023-03-21 22:59:18] [INFO ] Trap strengthening (SAT) tested/added 16/16 trap constraints in 17357 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
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-21 22:59:18] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:59:18] [INFO ] After 25054ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Parikh walk visited 0 properties in 1411 ms.
Support contains 159 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 2803 transition count 2045
Reduce places removed 558 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 560 rules applied. Total rules applied 1118 place count 2245 transition count 2043
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 1144 place count 2244 transition count 2018
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1169 place count 2219 transition count 2018
Performed 174 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 174 Pre rules applied. Total rules applied 1169 place count 2219 transition count 1844
Deduced a syphon composed of 174 places in 6 ms
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 4 with 348 rules applied. Total rules applied 1517 place count 2045 transition count 1844
Discarding 274 places :
Symmetric choice reduction at 4 with 274 rule applications. Total rules 1791 place count 1771 transition count 1570
Iterating global reduction 4 with 274 rules applied. Total rules applied 2065 place count 1771 transition count 1570
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 94 Pre rules applied. Total rules applied 2065 place count 1771 transition count 1476
Deduced a syphon composed of 94 places in 8 ms
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 4 with 188 rules applied. Total rules applied 2253 place count 1677 transition count 1476
Performed 606 Post agglomeration using F-continuation condition.Transition count delta: 606
Deduced a syphon composed of 606 places in 1 ms
Reduce places removed 606 places and 0 transitions.
Iterating global reduction 4 with 1212 rules applied. Total rules applied 3465 place count 1071 transition count 870
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 88 places in 2 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 3641 place count 983 transition count 911
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3642 place count 983 transition count 910
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 3650 place count 983 transition count 902
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 3658 place count 975 transition count 902
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 3692 place count 975 transition count 902
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 3694 place count 975 transition count 902
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3695 place count 974 transition count 901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3697 place count 972 transition count 901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3697 place count 972 transition count 900
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3699 place count 971 transition count 900
Applied a total of 3699 rules in 819 ms. Remains 971 /2803 variables (removed 1832) and now considering 900/2603 (removed 1703) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 ms. Remains : 971/2803 places, 900/2603 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 9) seen :1
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) 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 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 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 900 rows 971 cols
[2023-03-21 22:59:22] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-21 22:59:22] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-21 22:59:22] [INFO ] [Nat]Absence check using 359 positive place invariants in 154 ms returned sat
[2023-03-21 22:59:23] [INFO ] After 850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-21 22:59:23] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-21 22:59:24] [INFO ] After 581ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-21 22:59:24] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-21 22:59:24] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2023-03-21 22:59:25] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2023-03-21 22:59:25] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 1 ms to minimize.
[2023-03-21 22:59:25] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2023-03-21 22:59:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1027 ms
[2023-03-21 22:59:25] [INFO ] Deduced a trap composed of 6 places in 168 ms of which 14 ms to minimize.
[2023-03-21 22:59:26] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 1 ms to minimize.
[2023-03-21 22:59:26] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2023-03-21 22:59:26] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2023-03-21 22:59:26] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 0 ms to minimize.
[2023-03-21 22:59:26] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2023-03-21 22:59:27] [INFO ] Deduced a trap composed of 7 places in 139 ms of which 1 ms to minimize.
[2023-03-21 22:59:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1427 ms
[2023-03-21 22:59:27] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 1 ms to minimize.
[2023-03-21 22:59:27] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2023-03-21 22:59:27] [INFO ] Deduced a trap composed of 6 places in 130 ms of which 1 ms to minimize.
[2023-03-21 22:59:27] [INFO ] Deduced a trap composed of 6 places in 170 ms of which 0 ms to minimize.
[2023-03-21 22:59:28] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2023-03-21 22:59:28] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 0 ms to minimize.
[2023-03-21 22:59:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1121 ms
[2023-03-21 22:59:28] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-21 22:59:28] [INFO ] Deduced a trap composed of 8 places in 169 ms of which 1 ms to minimize.
[2023-03-21 22:59:29] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 0 ms to minimize.
[2023-03-21 22:59:29] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 1 ms to minimize.
[2023-03-21 22:59:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 953 ms
[2023-03-21 22:59:29] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2023-03-21 22:59:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-21 22:59:30] [INFO ] Deduced a trap composed of 8 places in 307 ms of which 1 ms to minimize.
[2023-03-21 22:59:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-21 22:59:30] [INFO ] After 6410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 618 ms.
[2023-03-21 22:59:30] [INFO ] After 8593ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 225 ms.
Support contains 101 out of 971 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 971/971 places, 900/900 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 971 transition count 888
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 959 transition count 885
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 956 transition count 885
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 30 place count 956 transition count 868
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 64 place count 939 transition count 868
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 938 transition count 867
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 938 transition count 867
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 130 place count 906 transition count 835
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 150 place count 896 transition count 846
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 151 place count 896 transition count 845
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 152 place count 895 transition count 845
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 895 transition count 845
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 159 place count 889 transition count 839
Applied a total of 159 rules in 250 ms. Remains 889 /971 variables (removed 82) and now considering 839/900 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 889/971 places, 839/900 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 8) seen :2
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 839 rows 889 cols
[2023-03-21 22:59:31] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-21 22:59:32] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 22:59:32] [INFO ] [Nat]Absence check using 359 positive place invariants in 129 ms returned sat
[2023-03-21 22:59:33] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:33] [INFO ] State equation strengthened by 85 read => feed constraints.
[2023-03-21 22:59:33] [INFO ] After 445ms SMT Verify possible using 85 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:33] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 1 ms to minimize.
[2023-03-21 22:59:34] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2023-03-21 22:59:34] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-21 22:59:34] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-21 22:59:34] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2023-03-21 22:59:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 913 ms
[2023-03-21 22:59:34] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2023-03-21 22:59:35] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-21 22:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 373 ms
[2023-03-21 22:59:35] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 0 ms to minimize.
[2023-03-21 22:59:35] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 1 ms to minimize.
[2023-03-21 22:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2023-03-21 22:59:35] [INFO ] After 2668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 479 ms.
[2023-03-21 22:59:36] [INFO ] After 4224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 137 ms.
Support contains 61 out of 889 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 889/889 places, 839/839 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 889 transition count 829
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 879 transition count 829
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 20 place count 879 transition count 816
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 46 place count 866 transition count 816
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 865 transition count 815
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 865 transition count 815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 48 place count 865 transition count 814
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 864 transition count 814
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 78 place count 850 transition count 800
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 94 place count 842 transition count 805
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 101 place count 835 transition count 798
Applied a total of 101 rules in 140 ms. Remains 835 /889 variables (removed 54) and now considering 798/839 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 835/889 places, 798/839 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 97730 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97730 steps, saw 73331 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 798 rows 835 cols
[2023-03-21 22:59:40] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-21 22:59:40] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 22:59:40] [INFO ] [Nat]Absence check using 359 positive place invariants in 84 ms returned sat
[2023-03-21 22:59:41] [INFO ] After 750ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:41] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-21 22:59:42] [INFO ] After 402ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:42] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-03-21 22:59:42] [INFO ] Deduced a trap composed of 4 places in 123 ms of which 1 ms to minimize.
[2023-03-21 22:59:42] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-21 22:59:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 399 ms
[2023-03-21 22:59:43] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2023-03-21 22:59:43] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 13 ms to minimize.
[2023-03-21 22:59:43] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-21 22:59:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 533 ms
[2023-03-21 22:59:43] [INFO ] After 1834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 387 ms.
[2023-03-21 22:59:43] [INFO ] After 3393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 109 ms.
Support contains 61 out of 835 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 16 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 835/835 places, 798/798 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 835/835 places, 798/798 transitions.
Applied a total of 0 rules in 30 ms. Remains 835 /835 variables (removed 0) and now considering 798/798 (removed 0) transitions.
[2023-03-21 22:59:44] [INFO ] Invariant cache hit.
[2023-03-21 22:59:44] [INFO ] Implicit Places using invariants in 594 ms returned [824]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 608 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 834/835 places, 798/798 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 833 transition count 797
Applied a total of 2 rules in 36 ms. Remains 833 /834 variables (removed 1) and now considering 797/798 (removed 1) transitions.
// Phase 1: matrix 797 rows 833 cols
[2023-03-21 22:59:44] [INFO ] Computed 358 place invariants in 7 ms
[2023-03-21 22:59:45] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-21 22:59:45] [INFO ] Invariant cache hit.
[2023-03-21 22:59:45] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-21 22:59:46] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 833/835 places, 797/798 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2850 ms. Remains : 833/835 places, 797/798 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) 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 6) 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 6) seen :0
Interrupted probabilistic random walk after 112365 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112365 steps, saw 83524 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-21 22:59:50] [INFO ] Invariant cache hit.
[2023-03-21 22:59:50] [INFO ] After 243ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 22:59:51] [INFO ] [Nat]Absence check using 358 positive place invariants in 72 ms returned sat
[2023-03-21 22:59:51] [INFO ] After 698ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-21 22:59:52] [INFO ] After 492ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:52] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-03-21 22:59:52] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2023-03-21 22:59:52] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 1 ms to minimize.
[2023-03-21 22:59:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 482 ms
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 0 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 0 ms to minimize.
[2023-03-21 22:59:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
[2023-03-21 22:59:53] [INFO ] After 2072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-21 22:59:54] [INFO ] After 3587ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 156 ms.
Support contains 61 out of 833 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 17 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 833/833 places, 797/797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 833/833 places, 797/797 transitions.
Applied a total of 0 rules in 16 ms. Remains 833 /833 variables (removed 0) and now considering 797/797 (removed 0) transitions.
[2023-03-21 22:59:54] [INFO ] Invariant cache hit.
[2023-03-21 22:59:55] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-21 22:59:55] [INFO ] Invariant cache hit.
[2023-03-21 22:59:55] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-21 22:59:56] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-21 22:59:56] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-21 22:59:56] [INFO ] Invariant cache hit.
[2023-03-21 22:59:57] [INFO ] Dead Transitions using invariants and state equation in 475 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2563 ms. Remains : 833/833 places, 797/797 transitions.
Partial Free-agglomeration rule applied 95 times.
Drop transitions removed 95 transitions
Iterating global reduction 0 with 95 rules applied. Total rules applied 95 place count 833 transition count 797
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 98 place count 833 transition count 794
Applied a total of 98 rules in 43 ms. Remains 833 /833 variables (removed 0) and now considering 794/797 (removed 3) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 794 rows 833 cols
[2023-03-21 22:59:57] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-21 22:59:57] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-21 22:59:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 46 ms returned sat
[2023-03-21 22:59:58] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:58] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-21 22:59:58] [INFO ] After 375ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-21 22:59:58] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 0 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-03-21 22:59:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1148 ms
[2023-03-21 23:00:00] [INFO ] After 2024ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 400 ms.
[2023-03-21 23:00:00] [INFO ] After 3222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-21 23:00:00] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2023-03-21 23:00:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 833 places, 797 transitions and 3729 arcs took 12 ms.
[2023-03-21 23:00:01] [INFO ] Flatten gal took : 107 ms
Total runtime 70018 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/728/inv_0_ --invariant=/tmp/728/inv_1_ --invariant=/tmp/728/inv_2_ --invariant=/tmp/728/inv_3_ --invariant=/tmp/728/inv_4_ --invariant=/tmp/728/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 16014224 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16093148 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:
++ 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
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="ShieldIIPt-PT-040B"
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 ShieldIIPt-PT-040B, 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-167903716900319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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