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

About the Execution of ITS-Tools for ShieldPPPt-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2029.111 291738.00 659344.00 2678.30 TTTTTFTFTFFTTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713800670.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 itstools
Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713800670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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-040B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-040B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679220117112

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=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202303021504
[2023-03-19 10:02:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 10:02:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 10:02:00] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-19 10:02:00] [INFO ] Transformed 3123 places.
[2023-03-19 10:02:00] [INFO ] Transformed 2843 transitions.
[2023-03-19 10:02:00] [INFO ] Found NUPN structural information;
[2023-03-19 10:02:00] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 359 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 10:02:01] [INFO ] Flatten gal took : 337 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 14) seen :3
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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
[2023-03-19 10:02:01] [INFO ] Flatten gal took : 284 ms
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
[2023-03-19 10:02:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2025401372488577886.gal : 61 ms
[2023-03-19 10:02:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18081832550614566149.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2025401372488577886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18081832550614566149.prop' '--nowitness' '--gen-order' 'FOLLOW'
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

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
Loading property file /tmp/ReachabilityCardinality18081832550614566149.prop.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-19 10:02:02] [INFO ] Computed 441 place invariants in 31 ms
[2023-03-19 10:02:04] [INFO ] [Real]Absence check using 441 positive place invariants in 404 ms returned sat
[2023-03-19 10:02:04] [INFO ] After 2003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-19 10:02:05] [INFO ] [Nat]Absence check using 441 positive place invariants in 214 ms returned sat
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :19 after 36
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-14 does not hold.
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :36 after 58
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-05 does not hold.
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :58 after 106
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :106 after 873
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :873 after 17553
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :17553 after 694761
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :694761 after 8.68056e+09
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :8.68056e+09 after 2.23667e+17
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-09 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :2.23667e+17 after 1.21274e+32
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :1.21274e+32 after 8.96431e+49
[2023-03-19 10:02:13] [INFO ] After 7404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-19 10:02:15] [INFO ] Deduced a trap composed of 22 places in 1469 ms of which 21 ms to minimize.
[2023-03-19 10:02:16] [INFO ] Deduced a trap composed of 23 places in 1197 ms of which 16 ms to minimize.
[2023-03-19 10:02:17] [INFO ] Deduced a trap composed of 24 places in 948 ms of which 3 ms to minimize.
[2023-03-19 10:02:18] [INFO ] Deduced a trap composed of 28 places in 910 ms of which 5 ms to minimize.
[2023-03-19 10:02:19] [INFO ] Deduced a trap composed of 32 places in 1018 ms of which 3 ms to minimize.
[2023-03-19 10:02:20] [INFO ] Deduced a trap composed of 34 places in 898 ms of which 3 ms to minimize.
[2023-03-19 10:02:21] [INFO ] Deduced a trap composed of 33 places in 1057 ms of which 19 ms to minimize.
[2023-03-19 10:02:23] [INFO ] Deduced a trap composed of 22 places in 1180 ms of which 2 ms to minimize.
[2023-03-19 10:02:24] [INFO ] Deduced a trap composed of 25 places in 1073 ms of which 3 ms to minimize.
[2023-03-19 10:02:25] [INFO ] Deduced a trap composed of 56 places in 1172 ms of which 2 ms to minimize.
[2023-03-19 10:02:27] [INFO ] Deduced a trap composed of 13 places in 1631 ms of which 14 ms to minimize.
[2023-03-19 10:02:28] [INFO ] Deduced a trap composed of 27 places in 1056 ms of which 2 ms to minimize.
[2023-03-19 10:02:30] [INFO ] Deduced a trap composed of 44 places in 1385 ms of which 2 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-19 10:02:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 10:02:30] [INFO ] After 26146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1404 ms.
Support contains 92 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 695 transitions
Trivial Post-agglo rules discarded 695 transitions
Performed 695 trivial Post agglomeration. Transition count delta: 695
Iterating post reduction 0 with 695 rules applied. Total rules applied 695 place count 3123 transition count 2148
Reduce places removed 695 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 697 rules applied. Total rules applied 1392 place count 2428 transition count 2146
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 1418 place count 2427 transition count 2121
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 1443 place count 2402 transition count 2121
Performed 171 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 171 Pre rules applied. Total rules applied 1443 place count 2402 transition count 1950
Deduced a syphon composed of 171 places in 5 ms
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 4 with 342 rules applied. Total rules applied 1785 place count 2231 transition count 1950
Discarding 262 places :
Symmetric choice reduction at 4 with 262 rule applications. Total rules 2047 place count 1969 transition count 1688
Iterating global reduction 4 with 262 rules applied. Total rules applied 2309 place count 1969 transition count 1688
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 105 Pre rules applied. Total rules applied 2309 place count 1969 transition count 1583
Deduced a syphon composed of 105 places in 3 ms
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 4 with 210 rules applied. Total rules applied 2519 place count 1864 transition count 1583
Performed 632 Post agglomeration using F-continuation condition.Transition count delta: 632
Deduced a syphon composed of 632 places in 5 ms
Reduce places removed 632 places and 0 transitions.
Iterating global reduction 4 with 1264 rules applied. Total rules applied 3783 place count 1232 transition count 951
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3985 place count 1131 transition count 951
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 3997 place count 1125 transition count 951
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 4003 place count 1125 transition count 945
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 4009 place count 1119 transition count 945
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 5 with 102 rules applied. Total rules applied 4111 place count 1119 transition count 945
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4112 place count 1118 transition count 944
Applied a total of 4112 rules in 1003 ms. Remains 1118 /3123 variables (removed 2005) and now considering 944/2843 (removed 1899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1004 ms. Remains : 1118/3123 places, 944/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 418 ms. (steps per millisecond=23 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) 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 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) 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 8) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 944 rows 1118 cols
[2023-03-19 10:02:33] [INFO ] Computed 441 place invariants in 5 ms
[2023-03-19 10:02:34] [INFO ] [Real]Absence check using 441 positive place invariants in 451 ms returned sat
[2023-03-19 10:02:34] [INFO ] After 853ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 10:02:35] [INFO ] [Nat]Absence check using 441 positive place invariants in 406 ms returned sat
[2023-03-19 10:02:37] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 10:02:37] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-19 10:02:38] [INFO ] After 1103ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 10:02:38] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 1 ms to minimize.
[2023-03-19 10:02:39] [INFO ] Deduced a trap composed of 7 places in 460 ms of which 1 ms to minimize.
[2023-03-19 10:02:39] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 1 ms to minimize.
[2023-03-19 10:02:40] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 1 ms to minimize.
[2023-03-19 10:02:40] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 1 ms to minimize.
[2023-03-19 10:02:41] [INFO ] Deduced a trap composed of 8 places in 264 ms of which 1 ms to minimize.
[2023-03-19 10:02:41] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 1 ms to minimize.
[2023-03-19 10:02:41] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2023-03-19 10:02:42] [INFO ] Deduced a trap composed of 9 places in 213 ms of which 2 ms to minimize.
[2023-03-19 10:02:42] [INFO ] Deduced a trap composed of 10 places in 389 ms of which 1 ms to minimize.
[2023-03-19 10:02:42] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4218 ms
[2023-03-19 10:02:43] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2023-03-19 10:02:43] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 1 ms to minimize.
[2023-03-19 10:02:43] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 1 ms to minimize.
[2023-03-19 10:02:44] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2023-03-19 10:02:44] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-19 10:02:44] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 0 ms to minimize.
[2023-03-19 10:02:45] [INFO ] Deduced a trap composed of 10 places in 273 ms of which 2 ms to minimize.
[2023-03-19 10:02:45] [INFO ] Deduced a trap composed of 6 places in 206 ms of which 1 ms to minimize.
[2023-03-19 10:02:45] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
[2023-03-19 10:02:45] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-19 10:02:46] [INFO ] Deduced a trap composed of 6 places in 234 ms of which 6 ms to minimize.
[2023-03-19 10:02:46] [INFO ] Deduced a trap composed of 6 places in 370 ms of which 1 ms to minimize.
[2023-03-19 10:02:46] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 0 ms to minimize.
[2023-03-19 10:02:47] [INFO ] Deduced a trap composed of 11 places in 345 ms of which 1 ms to minimize.
[2023-03-19 10:02:47] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 0 ms to minimize.
[2023-03-19 10:02:47] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 0 ms to minimize.
[2023-03-19 10:02:48] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 14 ms to minimize.
[2023-03-19 10:02:48] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5493 ms
[2023-03-19 10:02:48] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2023-03-19 10:02:49] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
[2023-03-19 10:02:49] [INFO ] Deduced a trap composed of 7 places in 249 ms of which 1 ms to minimize.
[2023-03-19 10:02:49] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2023-03-19 10:02:50] [INFO ] Deduced a trap composed of 8 places in 332 ms of which 1 ms to minimize.
[2023-03-19 10:02:50] [INFO ] Deduced a trap composed of 7 places in 317 ms of which 0 ms to minimize.
[2023-03-19 10:02:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2194 ms
[2023-03-19 10:02:51] [INFO ] After 13997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-19 10:02:51] [INFO ] After 17407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 210 ms.
Support contains 61 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 944/944 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1118 transition count 935
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 1109 transition count 935
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 18 place count 1109 transition count 932
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 1106 transition count 932
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 66 place count 1085 transition count 911
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 1082 transition count 911
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 1082 transition count 911
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 1080 transition count 909
Applied a total of 83 rules in 242 ms. Remains 1080 /1118 variables (removed 38) and now considering 909/944 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 1080/1118 places, 909/944 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) 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 7) 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 7) 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 7) 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 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 86113 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86113 steps, saw 62082 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 909 rows 1080 cols
[2023-03-19 10:02:56] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-19 10:02:56] [INFO ] [Real]Absence check using 441 positive place invariants in 143 ms returned sat
[2023-03-19 10:02:56] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 10:02:57] [INFO ] [Nat]Absence check using 441 positive place invariants in 110 ms returned sat
[2023-03-19 10:02:58] [INFO ] After 1008ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 10:02:58] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-19 10:02:59] [INFO ] After 789ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 10:02:59] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-03-19 10:02:59] [INFO ] Deduced a trap composed of 8 places in 362 ms of which 1 ms to minimize.
[2023-03-19 10:03:00] [INFO ] Deduced a trap composed of 5 places in 401 ms of which 2 ms to minimize.
[2023-03-19 10:03:00] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 14 ms to minimize.
[2023-03-19 10:03:01] [INFO ] Deduced a trap composed of 7 places in 355 ms of which 1 ms to minimize.
[2023-03-19 10:03:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1918 ms
[2023-03-19 10:03:01] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 2 ms to minimize.
[2023-03-19 10:03:02] [INFO ] Deduced a trap composed of 3 places in 291 ms of which 1 ms to minimize.
[2023-03-19 10:03:02] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 0 ms to minimize.
[2023-03-19 10:03:02] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 22 ms to minimize.
[2023-03-19 10:03:03] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-19 10:03:03] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1912 ms
[2023-03-19 10:03:03] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-19 10:03:03] [INFO ] Deduced a trap composed of 8 places in 245 ms of which 1 ms to minimize.
[2023-03-19 10:03:04] [INFO ] Deduced a trap composed of 8 places in 189 ms of which 0 ms to minimize.
[2023-03-19 10:03:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 916 ms
[2023-03-19 10:03:04] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 3 ms to minimize.
[2023-03-19 10:03:04] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2023-03-19 10:03:05] [INFO ] Deduced a trap composed of 7 places in 200 ms of which 1 ms to minimize.
[2023-03-19 10:03:05] [INFO ] Deduced a trap composed of 5 places in 267 ms of which 17 ms to minimize.
[2023-03-19 10:03:05] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2023-03-19 10:03:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1477 ms
[2023-03-19 10:03:06] [INFO ] After 7717ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 627 ms.
[2023-03-19 10:03:06] [INFO ] After 10027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 221 ms.
Support contains 61 out of 1080 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1080/1080 places, 909/909 transitions.
Applied a total of 0 rules in 50 ms. Remains 1080 /1080 variables (removed 0) and now considering 909/909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1080/1080 places, 909/909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1080/1080 places, 909/909 transitions.
Applied a total of 0 rules in 46 ms. Remains 1080 /1080 variables (removed 0) and now considering 909/909 (removed 0) transitions.
[2023-03-19 10:03:07] [INFO ] Invariant cache hit.
[2023-03-19 10:03:07] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-19 10:03:07] [INFO ] Invariant cache hit.
[2023-03-19 10:03:08] [INFO ] State equation strengthened by 93 read => feed constraints.
[2023-03-19 10:03:12] [INFO ] Implicit Places using invariants and state equation in 4174 ms returned []
Implicit Place search using SMT with State Equation took 4969 ms to find 0 implicit places.
[2023-03-19 10:03:12] [INFO ] Redundant transitions in 66 ms returned []
[2023-03-19 10:03:12] [INFO ] Invariant cache hit.
[2023-03-19 10:03:12] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5781 ms. Remains : 1080/1080 places, 909/909 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 1080 transition count 908
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 1079 transition count 908
Partial Free-agglomeration rule applied 220 times.
Drop transitions removed 220 transitions
Iterating global reduction 0 with 220 rules applied. Total rules applied 222 place count 1079 transition count 908
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 225 place count 1079 transition count 905
Applied a total of 225 rules in 101 ms. Remains 1079 /1080 variables (removed 1) and now considering 905/909 (removed 4) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 905 rows 1079 cols
[2023-03-19 10:03:12] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-19 10:03:13] [INFO ] [Real]Absence check using 441 positive place invariants in 53 ms returned sat
[2023-03-19 10:03:13] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 10:03:13] [INFO ] [Nat]Absence check using 441 positive place invariants in 61 ms returned sat
[2023-03-19 10:03:14] [INFO ] After 896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 10:03:14] [INFO ] State equation strengthened by 194 read => feed constraints.
[2023-03-19 10:03:15] [INFO ] After 861ms SMT Verify possible using 194 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-19 10:03:15] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 1 ms to minimize.
[2023-03-19 10:03:16] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 14 ms to minimize.
[2023-03-19 10:03:16] [INFO ] Deduced a trap composed of 6 places in 307 ms of which 1 ms to minimize.
[2023-03-19 10:03:16] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 1 ms to minimize.
[2023-03-19 10:03:17] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-19 10:03:17] [INFO ] Deduced a trap composed of 6 places in 349 ms of which 0 ms to minimize.
[2023-03-19 10:03:17] [INFO ] Deduced a trap composed of 6 places in 318 ms of which 2 ms to minimize.
[2023-03-19 10:03:18] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2023-03-19 10:03:18] [INFO ] Deduced a trap composed of 5 places in 543 ms of which 0 ms to minimize.
[2023-03-19 10:03:19] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2023-03-19 10:03:19] [INFO ] Deduced a trap composed of 6 places in 224 ms of which 1 ms to minimize.
[2023-03-19 10:03:19] [INFO ] Deduced a trap composed of 7 places in 250 ms of which 1 ms to minimize.
[2023-03-19 10:03:20] [INFO ] Deduced a trap composed of 7 places in 448 ms of which 0 ms to minimize.
[2023-03-19 10:03:20] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 1 ms to minimize.
[2023-03-19 10:03:20] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 1 ms to minimize.
[2023-03-19 10:03:21] [INFO ] Deduced a trap composed of 7 places in 290 ms of which 0 ms to minimize.
[2023-03-19 10:03:21] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2023-03-19 10:03:21] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2023-03-19 10:03:22] [INFO ] Deduced a trap composed of 12 places in 453 ms of which 1 ms to minimize.
[2023-03-19 10:03:22] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 1 ms to minimize.
[2023-03-19 10:03:22] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 1 ms to minimize.
[2023-03-19 10:03:22] [INFO ] Deduced a trap composed of 6 places in 201 ms of which 0 ms to minimize.
[2023-03-19 10:03:23] [INFO ] Deduced a trap composed of 8 places in 219 ms of which 1 ms to minimize.
[2023-03-19 10:03:23] [INFO ] Deduced a trap composed of 8 places in 201 ms of which 1 ms to minimize.
[2023-03-19 10:03:23] [INFO ] Deduced a trap composed of 7 places in 252 ms of which 1 ms to minimize.
[2023-03-19 10:03:23] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 0 ms to minimize.
[2023-03-19 10:03:24] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2023-03-19 10:03:24] [INFO ] Deduced a trap composed of 6 places in 190 ms of which 0 ms to minimize.
[2023-03-19 10:03:24] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2023-03-19 10:03:24] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 0 ms to minimize.
[2023-03-19 10:03:25] [INFO ] Deduced a trap composed of 7 places in 262 ms of which 1 ms to minimize.
[2023-03-19 10:03:25] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-03-19 10:03:25] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 2 ms to minimize.
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 7 places in 288 ms of which 1 ms to minimize.
[2023-03-19 10:03:26] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-19 10:03:27] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 1 ms to minimize.
[2023-03-19 10:03:27] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 11877 ms
[2023-03-19 10:03:27] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 6 places in 199 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 0 ms to minimize.
[2023-03-19 10:03:28] [INFO ] Deduced a trap composed of 8 places in 210 ms of which 1 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 1 ms to minimize.
[2023-03-19 10:03:29] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 0 ms to minimize.
[2023-03-19 10:03:30] [INFO ] Deduced a trap composed of 7 places in 720 ms of which 1 ms to minimize.
[2023-03-19 10:03:30] [INFO ] Deduced a trap composed of 14 places in 195 ms of which 0 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 6 places in 171 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2023-03-19 10:03:31] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2023-03-19 10:03:32] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 1 ms to minimize.
[2023-03-19 10:03:32] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2023-03-19 10:03:32] [INFO ] Deduced a trap composed of 13 places in 233 ms of which 0 ms to minimize.
[2023-03-19 10:03:32] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5364 ms
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 8 ms to minimize.
[2023-03-19 10:03:33] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 1 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 0 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 1 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-19 10:03:34] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 0 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2130 ms
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 0 ms to minimize.
[2023-03-19 10:03:35] [INFO ] Deduced a trap composed of 11 places in 202 ms of which 0 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 1 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-19 10:03:36] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 1 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 2 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1811 ms
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 0 ms to minimize.
[2023-03-19 10:03:37] [INFO ] Deduced a trap composed of 5 places in 226 ms of which 1 ms to minimize.
[2023-03-19 10:03:38] [INFO ] Deduced a trap composed of 8 places in 134 ms of which 0 ms to minimize.
[2023-03-19 10:03:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2023-03-19 10:03:38] [INFO ] After 23589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 700 ms.
[2023-03-19 10:03:38] [INFO ] After 25681ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2023-03-19 10:03:38] [INFO ] Flatten gal took : 51 ms
[2023-03-19 10:03:38] [INFO ] Flatten gal took : 48 ms
[2023-03-19 10:03:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12531636122188662986.gal : 7 ms
[2023-03-19 10:03:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2575694548800635052.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12531636122188662986.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2575694548800635052.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2575694548800635052.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :6 after 14
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :14 after 79
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :79 after 391
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :391 after 37536
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :37536 after 6.75648e+06
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-08 is true.
Detected timeout of ITS tools.
[2023-03-19 10:03:54] [INFO ] Flatten gal took : 67 ms
[2023-03-19 10:03:54] [INFO ] Applying decomposition
[2023-03-19 10:03:54] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16941047559042650562.txt' '-o' '/tmp/graph16941047559042650562.bin' '-w' '/tmp/graph16941047559042650562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16941047559042650562.bin' '-l' '-1' '-v' '-w' '/tmp/graph16941047559042650562.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:03:54] [INFO ] Decomposing Gal with order
[2023-03-19 10:03:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:03:54] [INFO ] Removed a total of 232 redundant transitions.
[2023-03-19 10:03:54] [INFO ] Flatten gal took : 131 ms
[2023-03-19 10:03:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 18 ms.
[2023-03-19 10:03:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5428612782974435213.gal : 20 ms
[2023-03-19 10:03:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8900021673155133812.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5428612782974435213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8900021673155133812.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality8900021673155133812.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :6 after 10
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :10 after 14
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :14 after 391
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :391 after 391
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :391 after 1.3513e+06
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.02283e+19 after 1.9021e+25
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-03 is true.
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-02 is true.
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-01 is true.
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-00 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.9021e+25 after 3.73135e+55
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7599540462789663816
[2023-03-19 10:04:09] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7599540462789663816
Running compilation step : cd /tmp/ltsmin7599540462789663816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1976 ms.
Running link step : cd /tmp/ltsmin7599540462789663816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin7599540462789663816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'ShieldPPPtPT040BReachabilityCardinality04==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-19 10:04:25] [INFO ] Flatten gal took : 77 ms
[2023-03-19 10:04:25] [INFO ] Applying decomposition
[2023-03-19 10:04:25] [INFO ] Flatten gal took : 75 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12959416047569254625.txt' '-o' '/tmp/graph12959416047569254625.bin' '-w' '/tmp/graph12959416047569254625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12959416047569254625.bin' '-l' '-1' '-v' '-w' '/tmp/graph12959416047569254625.weights' '-q' '0' '-e' '0.001'
[2023-03-19 10:04:25] [INFO ] Decomposing Gal with order
[2023-03-19 10:04:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 10:04:25] [INFO ] Removed a total of 240 redundant transitions.
[2023-03-19 10:04:25] [INFO ] Flatten gal took : 154 ms
[2023-03-19 10:04:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2023-03-19 10:04:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14129750172442315921.gal : 32 ms
[2023-03-19 10:04:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5456524892320016444.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14129750172442315921.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5456524892320016444.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5456524892320016444.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :1 after 8548
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :8548 after 277699
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :9.26866e+119 after 3.02625e+121
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-15 does not hold.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-08 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-04 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-03 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-02 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-01 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-00 is true.
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.4083e+145,119.428,624476,29029,57,1.24067e+06,2367,2690,2.86348e+06,60,13118,0
Total reachable state count : 5.408298840305230295123421498691637202375e+145

Verifying 7 reachability properties.
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-00,2.42888e+143,119.627,624476,23435,43,1.24067e+06,2367,2700,2.86348e+06,65,13118,0
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-01 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-01,5.23783e+93,142.114,624476,3090,44,1.24067e+06,2367,2878,2.86348e+06,75,13118,0
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-02 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-02,2.53088e+58,142.129,624476,2168,41,1.24067e+06,2367,2905,2.86348e+06,75,13118,0
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-03,1.09198e+118,142.154,624476,4014,41,1.24067e+06,2367,2941,2.86348e+06,75,13118,0
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-04,1.48706e+141,142.162,624476,6479,44,1.24067e+06,2367,2945,2.86348e+06,75,13118,0
Reachability property ShieldPPPt-PT-040B-ReachabilityCardinality-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-08,9.12541e+59,142.164,624476,2264,41,1.24067e+06,2367,2951,2.86348e+06,75,13118,0
Invariant property ShieldPPPt-PT-040B-ReachabilityCardinality-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldPPPt-PT-040B-ReachabilityCardinality-15,2.91465e+144,142.195,624476,18848,43,1.24067e+06,2367,2957,2.86348e+06,75,13118,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 288255 ms.

BK_STOP 1679220408850

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713800670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-040B.tgz
mv ShieldPPPt-PT-040B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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