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-167903717300670.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldPPPt-PT-040B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300670
=====================================================================

--------------------
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 1679468186175

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 06:56:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:56:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:56:29] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2023-03-22 06:56:29] [INFO ] Transformed 3123 places.
[2023-03-22 06:56:29] [INFO ] Transformed 2843 transitions.
[2023-03-22 06:56:29] [INFO ] Found NUPN structural information;
[2023-03-22 06:56:29] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 425 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
Incomplete random walk after 10000 steps, including 2 resets, run finished after 720 ms. (steps per millisecond=13 ) 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 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-22 06:56:30] [INFO ] Computed 441 place invariants in 31 ms
[2023-03-22 06:56:32] [INFO ] [Real]Absence check using 441 positive place invariants in 349 ms returned sat
[2023-03-22 06:56:32] [INFO ] After 2128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 06:56:34] [INFO ] [Nat]Absence check using 441 positive place invariants in 306 ms returned sat
[2023-03-22 06:56:42] [INFO ] After 7191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 06:56:46] [INFO ] Deduced a trap composed of 22 places in 3402 ms of which 23 ms to minimize.
[2023-03-22 06:56:48] [INFO ] Deduced a trap composed of 23 places in 2031 ms of which 28 ms to minimize.
[2023-03-22 06:56:50] [INFO ] Deduced a trap composed of 24 places in 1986 ms of which 3 ms to minimize.
[2023-03-22 06:56:54] [INFO ] Deduced a trap composed of 28 places in 3921 ms of which 14 ms to minimize.
[2023-03-22 06:56:56] [INFO ] Deduced a trap composed of 32 places in 1629 ms of which 2 ms to minimize.
[2023-03-22 06:56:58] [INFO ] Deduced a trap composed of 34 places in 2027 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:56:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:56:58] [INFO ] After 25677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1695 ms.
Support contains 104 out of 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 686 transitions
Trivial Post-agglo rules discarded 686 transitions
Performed 686 trivial Post agglomeration. Transition count delta: 686
Iterating post reduction 0 with 686 rules applied. Total rules applied 686 place count 3123 transition count 2157
Reduce places removed 686 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 688 rules applied. Total rules applied 1374 place count 2437 transition count 2155
Reduce places removed 1 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 2 with 31 rules applied. Total rules applied 1405 place count 2436 transition count 2125
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 1435 place count 2406 transition count 2125
Performed 169 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 169 Pre rules applied. Total rules applied 1435 place count 2406 transition count 1956
Deduced a syphon composed of 169 places in 6 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 1773 place count 2237 transition count 1956
Discarding 258 places :
Symmetric choice reduction at 4 with 258 rule applications. Total rules 2031 place count 1979 transition count 1698
Iterating global reduction 4 with 258 rules applied. Total rules applied 2289 place count 1979 transition count 1698
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 101 Pre rules applied. Total rules applied 2289 place count 1979 transition count 1597
Deduced a syphon composed of 101 places in 10 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2491 place count 1878 transition count 1597
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 3755 place count 1246 transition count 965
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 3957 place count 1145 transition count 965
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3959 place count 1144 transition count 965
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 3965 place count 1144 transition count 959
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 3971 place count 1138 transition count 959
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 4071 place count 1138 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4072 place count 1137 transition count 958
Applied a total of 4072 rules in 1360 ms. Remains 1137 /3123 variables (removed 1986) and now considering 958/2843 (removed 1885) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1361 ms. Remains : 1137/3123 places, 958/2843 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=21 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :1
FORMULA ShieldPPPt-PT-040B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 958 rows 1137 cols
[2023-03-22 06:57:02] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-22 06:57:03] [INFO ] [Real]Absence check using 441 positive place invariants in 125 ms returned sat
[2023-03-22 06:57:03] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:57:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 138 ms returned sat
[2023-03-22 06:57:05] [INFO ] After 1195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:57:05] [INFO ] State equation strengthened by 216 read => feed constraints.
[2023-03-22 06:57:07] [INFO ] After 1827ms SMT Verify possible using 216 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:57:07] [INFO ] Deduced a trap composed of 3 places in 322 ms of which 1 ms to minimize.
[2023-03-22 06:57:09] [INFO ] Deduced a trap composed of 9 places in 2034 ms of which 1 ms to minimize.
[2023-03-22 06:57:10] [INFO ] Deduced a trap composed of 7 places in 307 ms of which 1 ms to minimize.
[2023-03-22 06:57:10] [INFO ] Deduced a trap composed of 8 places in 263 ms of which 0 ms to minimize.
[2023-03-22 06:57:10] [INFO ] Deduced a trap composed of 6 places in 169 ms of which 1 ms to minimize.
[2023-03-22 06:57:11] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 1 ms to minimize.
[2023-03-22 06:57:11] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2023-03-22 06:57:11] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-22 06:57:12] [INFO ] Deduced a trap composed of 9 places in 624 ms of which 1 ms to minimize.
[2023-03-22 06:57:13] [INFO ] Deduced a trap composed of 9 places in 1137 ms of which 1 ms to minimize.
[2023-03-22 06:57:13] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 2 ms to minimize.
[2023-03-22 06:57:14] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-22 06:57:14] [INFO ] Deduced a trap composed of 8 places in 231 ms of which 1 ms to minimize.
[2023-03-22 06:57:14] [INFO ] Deduced a trap composed of 7 places in 260 ms of which 1 ms to minimize.
[2023-03-22 06:57:15] [INFO ] Deduced a trap composed of 8 places in 677 ms of which 1 ms to minimize.
[2023-03-22 06:57:15] [INFO ] Deduced a trap composed of 7 places in 294 ms of which 1 ms to minimize.
[2023-03-22 06:57:16] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 8620 ms
[2023-03-22 06:57:16] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 1 ms to minimize.
[2023-03-22 06:57:16] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2023-03-22 06:57:17] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2023-03-22 06:57:17] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 0 ms to minimize.
[2023-03-22 06:57:17] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 1 ms to minimize.
[2023-03-22 06:57:18] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2023-03-22 06:57:18] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 1 ms to minimize.
[2023-03-22 06:57:18] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 1 ms to minimize.
[2023-03-22 06:57:18] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2023-03-22 06:57:19] [INFO ] Deduced a trap composed of 8 places in 217 ms of which 1 ms to minimize.
[2023-03-22 06:57:19] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2023-03-22 06:57:20] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-22 06:57:20] [INFO ] Deduced a trap composed of 11 places in 401 ms of which 0 ms to minimize.
[2023-03-22 06:57:20] [INFO ] Deduced a trap composed of 7 places in 189 ms of which 1 ms to minimize.
[2023-03-22 06:57:21] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2023-03-22 06:57:21] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-22 06:57:21] [INFO ] Deduced a trap composed of 8 places in 367 ms of which 1 ms to minimize.
[2023-03-22 06:57:22] [INFO ] Deduced a trap composed of 6 places in 228 ms of which 0 ms to minimize.
[2023-03-22 06:57:22] [INFO ] Deduced a trap composed of 8 places in 323 ms of which 1 ms to minimize.
[2023-03-22 06:57:22] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 1 ms to minimize.
[2023-03-22 06:57:23] [INFO ] Deduced a trap composed of 6 places in 344 ms of which 22 ms to minimize.
[2023-03-22 06:57:23] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 7172 ms
[2023-03-22 06:57:23] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 1 ms to minimize.
[2023-03-22 06:57:24] [INFO ] Deduced a trap composed of 8 places in 485 ms of which 1 ms to minimize.
[2023-03-22 06:57:24] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-22 06:57:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1039 ms
[2023-03-22 06:57:25] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2023-03-22 06:57:25] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 2 ms to minimize.
[2023-03-22 06:57:25] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-22 06:57:26] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 0 ms to minimize.
[2023-03-22 06:57:26] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1415 ms
[2023-03-22 06:57:28] [INFO ] Deduced a trap composed of 8 places in 718 ms of which 2 ms to minimize.
[2023-03-22 06:57:28] [INFO ] Deduced a trap composed of 7 places in 255 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 06:57:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 06:57:28] [INFO ] After 25140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 316 ms.
Support contains 92 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 958/958 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1137 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1136 transition count 957
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 1136 transition count 951
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 1130 transition count 951
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1129 transition count 950
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1129 transition count 950
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 28 place count 1123 transition count 944
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 38 place count 1118 transition count 944
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1118 transition count 944
Applied a total of 40 rules in 294 ms. Remains 1118 /1137 variables (removed 19) and now considering 944/958 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 294 ms. Remains : 1118/1137 places, 944/958 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 8) seen :0
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 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 91 ms. (steps per millisecond=109 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 68914 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 68914 steps, saw 46624 distinct states, run finished after 3002 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 944 rows 1118 cols
[2023-03-22 06:57:33] [INFO ] Computed 441 place invariants in 3 ms
[2023-03-22 06:57:33] [INFO ] [Real]Absence check using 441 positive place invariants in 164 ms returned sat
[2023-03-22 06:57:33] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:57:34] [INFO ] [Nat]Absence check using 441 positive place invariants in 276 ms returned sat
[2023-03-22 06:57:36] [INFO ] After 1314ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:57:36] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-22 06:57:38] [INFO ] After 1833ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:57:38] [INFO ] Deduced a trap composed of 6 places in 430 ms of which 0 ms to minimize.
[2023-03-22 06:57:38] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-22 06:57:39] [INFO ] Deduced a trap composed of 7 places in 216 ms of which 12 ms to minimize.
[2023-03-22 06:57:39] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 21 ms to minimize.
[2023-03-22 06:57:39] [INFO ] Deduced a trap composed of 8 places in 356 ms of which 1 ms to minimize.
[2023-03-22 06:57:40] [INFO ] Deduced a trap composed of 7 places in 511 ms of which 1 ms to minimize.
[2023-03-22 06:57:40] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 1 ms to minimize.
[2023-03-22 06:57:41] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 0 ms to minimize.
[2023-03-22 06:57:41] [INFO ] Deduced a trap composed of 7 places in 356 ms of which 1 ms to minimize.
[2023-03-22 06:57:42] [INFO ] Deduced a trap composed of 6 places in 509 ms of which 0 ms to minimize.
[2023-03-22 06:57:42] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2023-03-22 06:57:43] [INFO ] Deduced a trap composed of 4 places in 433 ms of which 13 ms to minimize.
[2023-03-22 06:57:43] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 7 ms to minimize.
[2023-03-22 06:57:43] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 1 ms to minimize.
[2023-03-22 06:57:44] [INFO ] Deduced a trap composed of 9 places in 443 ms of which 1 ms to minimize.
[2023-03-22 06:57:44] [INFO ] Deduced a trap composed of 7 places in 193 ms of which 14 ms to minimize.
[2023-03-22 06:57:44] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 6465 ms
[2023-03-22 06:57:45] [INFO ] Deduced a trap composed of 7 places in 409 ms of which 1 ms to minimize.
[2023-03-22 06:57:45] [INFO ] Deduced a trap composed of 7 places in 394 ms of which 1 ms to minimize.
[2023-03-22 06:57:46] [INFO ] Deduced a trap composed of 7 places in 399 ms of which 0 ms to minimize.
[2023-03-22 06:57:46] [INFO ] Deduced a trap composed of 13 places in 329 ms of which 1 ms to minimize.
[2023-03-22 06:57:47] [INFO ] Deduced a trap composed of 7 places in 376 ms of which 0 ms to minimize.
[2023-03-22 06:57:47] [INFO ] Deduced a trap composed of 11 places in 242 ms of which 1 ms to minimize.
[2023-03-22 06:57:47] [INFO ] Deduced a trap composed of 7 places in 297 ms of which 0 ms to minimize.
[2023-03-22 06:57:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3106 ms
[2023-03-22 06:57:48] [INFO ] Deduced a trap composed of 6 places in 253 ms of which 1 ms to minimize.
[2023-03-22 06:57:48] [INFO ] Deduced a trap composed of 6 places in 527 ms of which 1 ms to minimize.
[2023-03-22 06:57:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 925 ms
[2023-03-22 06:57:49] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-22 06:57:49] [INFO ] Deduced a trap composed of 8 places in 246 ms of which 0 ms to minimize.
[2023-03-22 06:57:50] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2023-03-22 06:57:50] [INFO ] Deduced a trap composed of 10 places in 454 ms of which 1 ms to minimize.
[2023-03-22 06:57:50] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2023-03-22 06:57:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1857 ms
[2023-03-22 06:57:51] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2023-03-22 06:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-22 06:57:53] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2023-03-22 06:57:54] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-22 06:57:54] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-22 06:57:54] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2023-03-22 06:57:55] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2023-03-22 06:57:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1638 ms
[2023-03-22 06:57:55] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 0 ms to minimize.
[2023-03-22 06:57:56] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 1 ms to minimize.
[2023-03-22 06:57:56] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 1 ms to minimize.
[2023-03-22 06:57:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1013 ms
[2023-03-22 06:57:56] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2023-03-22 06:57:56] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 0 ms to minimize.
[2023-03-22 06:57:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 636 ms
[2023-03-22 06:57:57] [INFO ] After 20879ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 1941 ms.
[2023-03-22 06:57:59] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 479 ms.
Support contains 92 out of 1118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 944/944 transitions.
Applied a total of 0 rules in 28 ms. Remains 1118 /1118 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 1118/1118 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1118/1118 places, 944/944 transitions.
Applied a total of 0 rules in 26 ms. Remains 1118 /1118 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2023-03-22 06:57:59] [INFO ] Invariant cache hit.
[2023-03-22 06:58:00] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2023-03-22 06:58:00] [INFO ] Invariant cache hit.
[2023-03-22 06:58:01] [INFO ] State equation strengthened by 224 read => feed constraints.
[2023-03-22 06:58:04] [INFO ] Implicit Places using invariants and state equation in 4056 ms returned []
Implicit Place search using SMT with State Equation took 5092 ms to find 0 implicit places.
[2023-03-22 06:58:04] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-22 06:58:04] [INFO ] Invariant cache hit.
[2023-03-22 06:58:05] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5796 ms. Remains : 1118/1118 places, 944/944 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 1118 transition count 943
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1117 transition count 943
Partial Free-agglomeration rule applied 226 times.
Drop transitions removed 226 transitions
Iterating global reduction 0 with 226 rules applied. Total rules applied 228 place count 1117 transition count 943
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 231 place count 1117 transition count 940
Applied a total of 231 rules in 182 ms. Remains 1117 /1118 variables (removed 1) and now considering 940/944 (removed 4) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 940 rows 1117 cols
[2023-03-22 06:58:05] [INFO ] Computed 441 place invariants in 4 ms
[2023-03-22 06:58:06] [INFO ] [Real]Absence check using 441 positive place invariants in 172 ms returned sat
[2023-03-22 06:58:06] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 06:58:06] [INFO ] [Nat]Absence check using 441 positive place invariants in 91 ms returned sat
[2023-03-22 06:58:07] [INFO ] After 1129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 06:58:07] [INFO ] State equation strengthened by 187 read => feed constraints.
[2023-03-22 06:58:11] [INFO ] After 3477ms SMT Verify possible using 187 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:58:11] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 1 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 0 ms to minimize.
[2023-03-22 06:58:12] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 6 places in 166 ms of which 1 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 6 places in 174 ms of which 0 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 7 places in 280 ms of which 0 ms to minimize.
[2023-03-22 06:58:13] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 0 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 7 places in 180 ms of which 0 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 6 places in 200 ms of which 1 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 0 ms to minimize.
[2023-03-22 06:58:14] [INFO ] Deduced a trap composed of 11 places in 239 ms of which 0 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 10 places in 330 ms of which 1 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 10 places in 189 ms of which 0 ms to minimize.
[2023-03-22 06:58:15] [INFO ] Deduced a trap composed of 14 places in 281 ms of which 0 ms to minimize.
[2023-03-22 06:58:16] [INFO ] Deduced a trap composed of 7 places in 387 ms of which 1 ms to minimize.
[2023-03-22 06:58:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4806 ms
[2023-03-22 06:58:16] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 6 places in 1012 ms of which 1 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 6 places in 342 ms of which 1 ms to minimize.
[2023-03-22 06:58:18] [INFO ] Deduced a trap composed of 7 places in 427 ms of which 0 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-22 06:58:19] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2023-03-22 06:58:20] [INFO ] Deduced a trap composed of 9 places in 738 ms of which 0 ms to minimize.
[2023-03-22 06:58:20] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 0 ms to minimize.
[2023-03-22 06:58:21] [INFO ] Deduced a trap composed of 8 places in 898 ms of which 0 ms to minimize.
[2023-03-22 06:58:22] [INFO ] Deduced a trap composed of 7 places in 275 ms of which 0 ms to minimize.
[2023-03-22 06:58:22] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2023-03-22 06:58:22] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-22 06:58:22] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 0 ms to minimize.
[2023-03-22 06:58:23] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2023-03-22 06:58:23] [INFO ] Deduced a trap composed of 8 places in 230 ms of which 1 ms to minimize.
[2023-03-22 06:58:23] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2023-03-22 06:58:23] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 1 ms to minimize.
[2023-03-22 06:58:24] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2023-03-22 06:58:24] [INFO ] Deduced a trap composed of 9 places in 462 ms of which 1 ms to minimize.
[2023-03-22 06:58:25] [INFO ] Deduced a trap composed of 10 places in 232 ms of which 0 ms to minimize.
[2023-03-22 06:58:25] [INFO ] Deduced a trap composed of 8 places in 291 ms of which 1 ms to minimize.
[2023-03-22 06:58:25] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2023-03-22 06:58:25] [INFO ] Deduced a trap composed of 8 places in 145 ms of which 1 ms to minimize.
[2023-03-22 06:58:26] [INFO ] Deduced a trap composed of 8 places in 436 ms of which 1 ms to minimize.
[2023-03-22 06:58:26] [INFO ] Deduced a trap composed of 8 places in 203 ms of which 1 ms to minimize.
[2023-03-22 06:58:26] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10221 ms
[2023-03-22 06:58:27] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-22 06:58:27] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2023-03-22 06:58:27] [INFO ] Deduced a trap composed of 6 places in 164 ms of which 0 ms to minimize.
[2023-03-22 06:58:27] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 1 ms to minimize.
[2023-03-22 06:58:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1114 ms
[2023-03-22 06:58:28] [INFO ] Deduced a trap composed of 7 places in 509 ms of which 0 ms to minimize.
[2023-03-22 06:58:29] [INFO ] Deduced a trap composed of 9 places in 484 ms of which 29 ms to minimize.
[2023-03-22 06:58:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1214 ms
[2023-03-22 06:58:30] [INFO ] Deduced a trap composed of 14 places in 635 ms of which 1 ms to minimize.
[2023-03-22 06:58:30] [INFO ] Deduced a trap composed of 14 places in 351 ms of which 1 ms to minimize.
[2023-03-22 06:58:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1124 ms
[2023-03-22 06:58:32] [INFO ] Deduced a trap composed of 9 places in 683 ms of which 1 ms to minimize.
[2023-03-22 06:58:32] [INFO ] Deduced a trap composed of 8 places in 370 ms of which 1 ms to minimize.
[2023-03-22 06:58:33] [INFO ] Deduced a trap composed of 7 places in 571 ms of which 1 ms to minimize.
[2023-03-22 06:58:34] [INFO ] Deduced a trap composed of 12 places in 447 ms of which 1 ms to minimize.
[2023-03-22 06:58:34] [INFO ] Deduced a trap composed of 10 places in 398 ms of which 1 ms to minimize.
[2023-03-22 06:58:35] [INFO ] Deduced a trap composed of 7 places in 444 ms of which 1 ms to minimize.
[2023-03-22 06:58:35] [INFO ] Deduced a trap composed of 8 places in 306 ms of which 1 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 12 places in 518 ms of which 1 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Deduced a trap composed of 11 places in 326 ms of which 1 ms to minimize.
[2023-03-22 06:58:36] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4894 ms
[2023-03-22 06:58:37] [INFO ] Deduced a trap composed of 6 places in 1220 ms of which 1 ms to minimize.
[2023-03-22 06:58:38] [INFO ] Deduced a trap composed of 7 places in 838 ms of which 0 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Deduced a trap composed of 4 places in 421 ms of which 2 ms to minimize.
[2023-03-22 06:58:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2682 ms
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 6 places in 685 ms of which 1 ms to minimize.
[2023-03-22 06:58:40] [INFO ] Deduced a trap composed of 12 places in 337 ms of which 1 ms to minimize.
[2023-03-22 06:58:41] [INFO ] Deduced a trap composed of 12 places in 793 ms of which 1 ms to minimize.
[2023-03-22 06:58:41] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2023-03-22 06:58:42] [INFO ] Deduced a trap composed of 10 places in 420 ms of which 1 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 11 places in 619 ms of which 1 ms to minimize.
[2023-03-22 06:58:43] [INFO ] Deduced a trap composed of 11 places in 562 ms of which 1 ms to minimize.
[2023-03-22 06:58:44] [INFO ] Deduced a trap composed of 10 places in 647 ms of which 1 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Deduced a trap composed of 13 places in 1324 ms of which 1 ms to minimize.
[2023-03-22 06:58:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 6412 ms
[2023-03-22 06:58:45] [INFO ] After 37964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 2774 ms.
[2023-03-22 06:58:48] [INFO ] After 42509ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2023-03-22 06:58:48] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-22 06:58:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1118 places, 944 transitions and 4095 arcs took 11 ms.
[2023-03-22 06:58:49] [INFO ] Flatten gal took : 122 ms
Total runtime 140329 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 --invariant=/tmp/1011/inv_0_ --invariant=/tmp/1011/inv_1_ --invariant=/tmp/1011/inv_2_ --invariant=/tmp/1011/inv_3_ --invariant=/tmp/1011/inv_4_ --invariant=/tmp/1011/inv_5_ --invariant=/tmp/1011/inv_6_ --invariant=/tmp/1011/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12918228 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094880 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 ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPt-PT-040B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-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 r393-oct2-167903717300670"
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 ;