fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LTSMin+red for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6451.079 3600000.00 13968632.00 40.70 ????T???TT???T?F 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.r393-oct2-167903717300687.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-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717300687
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 8.5K Feb 25 20:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 25 20:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17: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 17K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 20:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Feb 25 20:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 20:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 20:57 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 955K 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-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679470699715

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:38:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:38:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:38:22] [INFO ] Load time of PNML (sax parser for PT used): 217 ms
[2023-03-22 07:38:22] [INFO ] Transformed 3903 places.
[2023-03-22 07:38:22] [INFO ] Transformed 3553 transitions.
[2023-03-22 07:38:22] [INFO ] Found NUPN structural information;
[2023-03-22 07:38:22] [INFO ] Parsed PT model containing 3903 places and 3553 transitions and 8906 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 16) seen :5
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 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 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3553 rows 3903 cols
[2023-03-22 07:38:23] [INFO ] Computed 551 place invariants in 36 ms
[2023-03-22 07:38:25] [INFO ] [Real]Absence check using 551 positive place invariants in 282 ms returned sat
[2023-03-22 07:38:25] [INFO ] After 1950ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:38:27] [INFO ] [Nat]Absence check using 551 positive place invariants in 354 ms returned sat
[2023-03-22 07:38:39] [INFO ] After 11125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:38:41] [INFO ] Deduced a trap composed of 18 places in 1573 ms of which 12 ms to minimize.
[2023-03-22 07:38:43] [INFO ] Deduced a trap composed of 25 places in 1456 ms of which 3 ms to minimize.
[2023-03-22 07:38:44] [INFO ] Deduced a trap composed of 20 places in 1544 ms of which 3 ms to minimize.
[2023-03-22 07:38:46] [INFO ] Deduced a trap composed of 20 places in 1582 ms of which 5 ms to minimize.
[2023-03-22 07:38:48] [INFO ] Deduced a trap composed of 30 places in 1396 ms of which 2 ms to minimize.
[2023-03-22 07:38:49] [INFO ] Deduced a trap composed of 28 places in 1284 ms of which 2 ms to minimize.
[2023-03-22 07:38:50] [INFO ] Deduced a trap composed of 24 places in 1130 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-22 07:38:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:38:50] [INFO ] After 25214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 2408 ms.
Support contains 252 out of 3903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Drop transitions removed 766 transitions
Trivial Post-agglo rules discarded 766 transitions
Performed 766 trivial Post agglomeration. Transition count delta: 766
Iterating post reduction 0 with 766 rules applied. Total rules applied 766 place count 3903 transition count 2787
Reduce places removed 766 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 768 rules applied. Total rules applied 1534 place count 3137 transition count 2785
Reduce places removed 1 places and 0 transitions.
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Iterating post reduction 2 with 66 rules applied. Total rules applied 1600 place count 3136 transition count 2720
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 1665 place count 3071 transition count 2720
Performed 223 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 223 Pre rules applied. Total rules applied 1665 place count 3071 transition count 2497
Deduced a syphon composed of 223 places in 9 ms
Reduce places removed 223 places and 0 transitions.
Iterating global reduction 4 with 446 rules applied. Total rules applied 2111 place count 2848 transition count 2497
Discarding 301 places :
Symmetric choice reduction at 4 with 301 rule applications. Total rules 2412 place count 2547 transition count 2196
Iterating global reduction 4 with 301 rules applied. Total rules applied 2713 place count 2547 transition count 2196
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 103 Pre rules applied. Total rules applied 2713 place count 2547 transition count 2093
Deduced a syphon composed of 103 places in 15 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 4 with 206 rules applied. Total rules applied 2919 place count 2444 transition count 2093
Performed 751 Post agglomeration using F-continuation condition.Transition count delta: 751
Deduced a syphon composed of 751 places in 4 ms
Reduce places removed 751 places and 0 transitions.
Iterating global reduction 4 with 1502 rules applied. Total rules applied 4421 place count 1693 transition count 1342
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 13 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4623 place count 1592 transition count 1342
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 4645 place count 1581 transition count 1342
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 4655 place count 1581 transition count 1332
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 4665 place count 1571 transition count 1332
Partial Free-agglomeration rule applied 125 times.
Drop transitions removed 125 transitions
Iterating global reduction 5 with 125 rules applied. Total rules applied 4790 place count 1571 transition count 1332
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4791 place count 1570 transition count 1331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 4792 place count 1569 transition count 1331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 4792 place count 1569 transition count 1329
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 4796 place count 1567 transition count 1329
Applied a total of 4796 rules in 1575 ms. Remains 1567 /3903 variables (removed 2336) and now considering 1329/3553 (removed 2224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1577 ms. Remains : 1567/3903 places, 1329/3553 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) 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 11) seen :0
Interrupted probabilistic random walk after 78773 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78773 steps, saw 45067 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 1329 rows 1567 cols
[2023-03-22 07:38:58] [INFO ] Computed 550 place invariants in 12 ms
[2023-03-22 07:38:59] [INFO ] [Real]Absence check using 550 positive place invariants in 189 ms returned sat
[2023-03-22 07:38:59] [INFO ] After 803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:39:00] [INFO ] [Nat]Absence check using 550 positive place invariants in 199 ms returned sat
[2023-03-22 07:39:02] [INFO ] After 1694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:39:02] [INFO ] State equation strengthened by 206 read => feed constraints.
[2023-03-22 07:39:04] [INFO ] After 1918ms SMT Verify possible using 206 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:39:04] [INFO ] Deduced a trap composed of 12 places in 283 ms of which 1 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 0 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2023-03-22 07:39:05] [INFO ] Deduced a trap composed of 6 places in 214 ms of which 2 ms to minimize.
[2023-03-22 07:39:06] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-22 07:39:06] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2023-03-22 07:39:06] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 1 ms to minimize.
[2023-03-22 07:39:07] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2023-03-22 07:39:07] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 0 ms to minimize.
[2023-03-22 07:39:07] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2023-03-22 07:39:08] [INFO ] Deduced a trap composed of 15 places in 311 ms of which 1 ms to minimize.
[2023-03-22 07:39:08] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 1 ms to minimize.
[2023-03-22 07:39:08] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 2 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 14 places in 264 ms of which 0 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 13 places in 266 ms of which 0 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-22 07:39:09] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 0 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 1 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-22 07:39:10] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 1 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2023-03-22 07:39:11] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 7290 ms
[2023-03-22 07:39:13] [INFO ] Deduced a trap composed of 6 places in 431 ms of which 1 ms to minimize.
[2023-03-22 07:39:13] [INFO ] Deduced a trap composed of 8 places in 440 ms of which 1 ms to minimize.
[2023-03-22 07:39:14] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 1 ms to minimize.
[2023-03-22 07:39:14] [INFO ] Deduced a trap composed of 6 places in 378 ms of which 14 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 7 places in 452 ms of which 1 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 15 places in 429 ms of which 1 ms to minimize.
[2023-03-22 07:39:15] [INFO ] Deduced a trap composed of 12 places in 332 ms of which 1 ms to minimize.
[2023-03-22 07:39:16] [INFO ] Deduced a trap composed of 9 places in 417 ms of which 1 ms to minimize.
[2023-03-22 07:39:16] [INFO ] Deduced a trap composed of 16 places in 460 ms of which 2 ms to minimize.
[2023-03-22 07:39:17] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 2 ms to minimize.
[2023-03-22 07:39:17] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 1 ms to minimize.
[2023-03-22 07:39:18] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 1 ms to minimize.
[2023-03-22 07:39:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5984 ms
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 7 places in 278 ms of which 1 ms to minimize.
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 6 places in 325 ms of which 0 ms to minimize.
[2023-03-22 07:39:19] [INFO ] Deduced a trap composed of 8 places in 292 ms of which 1 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Deduced a trap composed of 16 places in 275 ms of which 0 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Deduced a trap composed of 16 places in 268 ms of which 1 ms to minimize.
[2023-03-22 07:39:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1832 ms
[2023-03-22 07:39:21] [INFO ] Deduced a trap composed of 13 places in 323 ms of which 0 ms to minimize.
[2023-03-22 07:39:21] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 0 ms to minimize.
[2023-03-22 07:39:21] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 0 ms to minimize.
[2023-03-22 07:39:22] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2023-03-22 07:39:22] [INFO ] Deduced a trap composed of 18 places in 358 ms of which 1 ms to minimize.
[2023-03-22 07:39:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1877 ms
[2023-03-22 07:39:23] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 1 ms to minimize.
[2023-03-22 07:39:23] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 1 ms to minimize.
[2023-03-22 07:39:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 776 ms
[2023-03-22 07:39:24] [INFO ] Deduced a trap composed of 7 places in 300 ms of which 0 ms to minimize.
[2023-03-22 07:39:24] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:39:24] [INFO ] Deduced a trap composed of 7 places in 275 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 07:39:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:39:24] [INFO ] After 25094ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 216 ms.
Support contains 252 out of 1567 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1329/1329 transitions.
Applied a total of 0 rules in 44 ms. Remains 1567 /1567 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1567/1567 places, 1329/1329 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1567/1567 places, 1329/1329 transitions.
Applied a total of 0 rules in 36 ms. Remains 1567 /1567 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2023-03-22 07:39:25] [INFO ] Invariant cache hit.
[2023-03-22 07:39:25] [INFO ] Implicit Places using invariants in 735 ms returned [1544, 1548]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 739 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1565/1567 places, 1329/1329 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1563 transition count 1327
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1563 transition count 1327
Applied a total of 4 rules in 72 ms. Remains 1563 /1565 variables (removed 2) and now considering 1327/1329 (removed 2) transitions.
// Phase 1: matrix 1327 rows 1563 cols
[2023-03-22 07:39:26] [INFO ] Computed 548 place invariants in 5 ms
[2023-03-22 07:39:26] [INFO ] Implicit Places using invariants in 743 ms returned []
[2023-03-22 07:39:26] [INFO ] Invariant cache hit.
[2023-03-22 07:39:27] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 07:39:31] [INFO ] Implicit Places using invariants and state equation in 4633 ms returned []
Implicit Place search using SMT with State Equation took 5391 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1563/1567 places, 1327/1329 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6238 ms. Remains : 1563/1567 places, 1327/1329 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 82351 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82351 steps, saw 48567 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 11 properties.
[2023-03-22 07:39:35] [INFO ] Invariant cache hit.
[2023-03-22 07:39:36] [INFO ] [Real]Absence check using 548 positive place invariants in 165 ms returned sat
[2023-03-22 07:39:36] [INFO ] After 722ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:39:36] [INFO ] [Nat]Absence check using 548 positive place invariants in 153 ms returned sat
[2023-03-22 07:39:39] [INFO ] After 1970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:39:39] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 07:39:41] [INFO ] After 2056ms SMT Verify possible using 204 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:39:41] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 1 ms to minimize.
[2023-03-22 07:39:42] [INFO ] Deduced a trap composed of 8 places in 186 ms of which 0 ms to minimize.
[2023-03-22 07:39:42] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-03-22 07:39:42] [INFO ] Deduced a trap composed of 11 places in 203 ms of which 0 ms to minimize.
[2023-03-22 07:39:42] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 1 ms to minimize.
[2023-03-22 07:39:43] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2023-03-22 07:39:43] [INFO ] Deduced a trap composed of 12 places in 206 ms of which 1 ms to minimize.
[2023-03-22 07:39:43] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 13 ms to minimize.
[2023-03-22 07:39:44] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 0 ms to minimize.
[2023-03-22 07:39:44] [INFO ] Deduced a trap composed of 7 places in 233 ms of which 0 ms to minimize.
[2023-03-22 07:39:44] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 1 ms to minimize.
[2023-03-22 07:39:44] [INFO ] Deduced a trap composed of 6 places in 248 ms of which 1 ms to minimize.
[2023-03-22 07:39:45] [INFO ] Deduced a trap composed of 9 places in 226 ms of which 1 ms to minimize.
[2023-03-22 07:39:45] [INFO ] Deduced a trap composed of 7 places in 204 ms of which 1 ms to minimize.
[2023-03-22 07:39:45] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2023-03-22 07:39:45] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2023-03-22 07:39:46] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 0 ms to minimize.
[2023-03-22 07:39:46] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 0 ms to minimize.
[2023-03-22 07:39:46] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 0 ms to minimize.
[2023-03-22 07:39:46] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 0 ms to minimize.
[2023-03-22 07:39:47] [INFO ] Deduced a trap composed of 14 places in 205 ms of which 1 ms to minimize.
[2023-03-22 07:39:47] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 1 ms to minimize.
[2023-03-22 07:39:47] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2023-03-22 07:39:48] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 1 ms to minimize.
[2023-03-22 07:39:48] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6720 ms
[2023-03-22 07:39:49] [INFO ] Deduced a trap composed of 3 places in 496 ms of which 1 ms to minimize.
[2023-03-22 07:39:50] [INFO ] Deduced a trap composed of 9 places in 540 ms of which 1 ms to minimize.
[2023-03-22 07:39:50] [INFO ] Deduced a trap composed of 13 places in 510 ms of which 1 ms to minimize.
[2023-03-22 07:39:51] [INFO ] Deduced a trap composed of 13 places in 448 ms of which 1 ms to minimize.
[2023-03-22 07:39:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2542 ms
[2023-03-22 07:39:52] [INFO ] Deduced a trap composed of 7 places in 369 ms of which 1 ms to minimize.
[2023-03-22 07:39:52] [INFO ] Deduced a trap composed of 9 places in 316 ms of which 1 ms to minimize.
[2023-03-22 07:39:53] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 1 ms to minimize.
[2023-03-22 07:39:53] [INFO ] Deduced a trap composed of 8 places in 398 ms of which 0 ms to minimize.
[2023-03-22 07:39:54] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2023-03-22 07:39:54] [INFO ] Deduced a trap composed of 14 places in 294 ms of which 1 ms to minimize.
[2023-03-22 07:39:55] [INFO ] Deduced a trap composed of 16 places in 530 ms of which 0 ms to minimize.
[2023-03-22 07:39:55] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 1 ms to minimize.
[2023-03-22 07:39:55] [INFO ] Deduced a trap composed of 12 places in 375 ms of which 0 ms to minimize.
[2023-03-22 07:39:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4033 ms
[2023-03-22 07:39:56] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 2 ms to minimize.
[2023-03-22 07:39:57] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 1 ms to minimize.
[2023-03-22 07:39:57] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 0 ms to minimize.
[2023-03-22 07:39:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1175 ms
[2023-03-22 07:39:58] [INFO ] Deduced a trap composed of 7 places in 340 ms of which 1 ms to minimize.
[2023-03-22 07:39:58] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 1 ms to minimize.
[2023-03-22 07:39:59] [INFO ] Deduced a trap composed of 7 places in 353 ms of which 1 ms to minimize.
[2023-03-22 07:39:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1381 ms
[2023-03-22 07:39:59] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 1 ms to minimize.
[2023-03-22 07:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 452 ms
[2023-03-22 07:40:01] [INFO ] Deduced a trap composed of 6 places in 403 ms of which 1 ms to minimize.
[2023-03-22 07:40:01] [INFO ] Deduced a trap composed of 5 places in 300 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 07:40:01] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 07:40:01] [INFO ] After 25214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:11
Parikh walk visited 0 properties in 320 ms.
Support contains 252 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1327/1327 transitions.
Applied a total of 0 rules in 41 ms. Remains 1563 /1563 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 1563/1563 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1327/1327 transitions.
Applied a total of 0 rules in 41 ms. Remains 1563 /1563 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-22 07:40:01] [INFO ] Invariant cache hit.
[2023-03-22 07:40:02] [INFO ] Implicit Places using invariants in 712 ms returned []
[2023-03-22 07:40:02] [INFO ] Invariant cache hit.
[2023-03-22 07:40:03] [INFO ] State equation strengthened by 204 read => feed constraints.
[2023-03-22 07:40:07] [INFO ] Implicit Places using invariants and state equation in 4493 ms returned []
Implicit Place search using SMT with State Equation took 5207 ms to find 0 implicit places.
[2023-03-22 07:40:07] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-22 07:40:07] [INFO ] Invariant cache hit.
[2023-03-22 07:40:08] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6319 ms. Remains : 1563/1563 places, 1327/1327 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1563 transition count 1327
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 206 place count 1563 transition count 1324
Applied a total of 206 rules in 132 ms. Remains 1563 /1563 variables (removed 0) and now considering 1324/1327 (removed 3) transitions.
Running SMT prover for 11 properties.
// Phase 1: matrix 1324 rows 1563 cols
[2023-03-22 07:40:08] [INFO ] Computed 548 place invariants in 6 ms
[2023-03-22 07:40:08] [INFO ] [Real]Absence check using 548 positive place invariants in 149 ms returned sat
[2023-03-22 07:40:08] [INFO ] After 608ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-22 07:40:09] [INFO ] [Nat]Absence check using 548 positive place invariants in 151 ms returned sat
[2023-03-22 07:40:11] [INFO ] After 1842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:40:11] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-22 07:40:14] [INFO ] After 2506ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:40:14] [INFO ] Deduced a trap composed of 7 places in 395 ms of which 1 ms to minimize.
[2023-03-22 07:40:15] [INFO ] Deduced a trap composed of 6 places in 319 ms of which 0 ms to minimize.
[2023-03-22 07:40:15] [INFO ] Deduced a trap composed of 8 places in 303 ms of which 1 ms to minimize.
[2023-03-22 07:40:16] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 1 ms to minimize.
[2023-03-22 07:40:16] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2023-03-22 07:40:16] [INFO ] Deduced a trap composed of 12 places in 252 ms of which 1 ms to minimize.
[2023-03-22 07:40:17] [INFO ] Deduced a trap composed of 12 places in 345 ms of which 1 ms to minimize.
[2023-03-22 07:40:17] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2023-03-22 07:40:17] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 0 ms to minimize.
[2023-03-22 07:40:18] [INFO ] Deduced a trap composed of 13 places in 248 ms of which 1 ms to minimize.
[2023-03-22 07:40:18] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 0 ms to minimize.
[2023-03-22 07:40:18] [INFO ] Deduced a trap composed of 16 places in 340 ms of which 1 ms to minimize.
[2023-03-22 07:40:19] [INFO ] Deduced a trap composed of 13 places in 277 ms of which 1 ms to minimize.
[2023-03-22 07:40:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4856 ms
[2023-03-22 07:40:20] [INFO ] Deduced a trap composed of 9 places in 376 ms of which 1 ms to minimize.
[2023-03-22 07:40:20] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2023-03-22 07:40:21] [INFO ] Deduced a trap composed of 11 places in 341 ms of which 1 ms to minimize.
[2023-03-22 07:40:21] [INFO ] Deduced a trap composed of 8 places in 352 ms of which 1 ms to minimize.
[2023-03-22 07:40:22] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 0 ms to minimize.
[2023-03-22 07:40:22] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:40:22] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 1 ms to minimize.
[2023-03-22 07:40:23] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 1 ms to minimize.
[2023-03-22 07:40:23] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 0 ms to minimize.
[2023-03-22 07:40:23] [INFO ] Deduced a trap composed of 18 places in 311 ms of which 1 ms to minimize.
[2023-03-22 07:40:24] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 1 ms to minimize.
[2023-03-22 07:40:24] [INFO ] Deduced a trap composed of 13 places in 279 ms of which 1 ms to minimize.
[2023-03-22 07:40:25] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 1 ms to minimize.
[2023-03-22 07:40:25] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 14 ms to minimize.
[2023-03-22 07:40:25] [INFO ] Deduced a trap composed of 16 places in 303 ms of which 1 ms to minimize.
[2023-03-22 07:40:26] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-22 07:40:26] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 0 ms to minimize.
[2023-03-22 07:40:26] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 6674 ms
[2023-03-22 07:40:27] [INFO ] Deduced a trap composed of 9 places in 378 ms of which 1 ms to minimize.
[2023-03-22 07:40:27] [INFO ] Deduced a trap composed of 9 places in 453 ms of which 1 ms to minimize.
[2023-03-22 07:40:28] [INFO ] Deduced a trap composed of 14 places in 328 ms of which 1 ms to minimize.
[2023-03-22 07:40:28] [INFO ] Deduced a trap composed of 13 places in 377 ms of which 1 ms to minimize.
[2023-03-22 07:40:29] [INFO ] Deduced a trap composed of 15 places in 392 ms of which 1 ms to minimize.
[2023-03-22 07:40:29] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 1 ms to minimize.
[2023-03-22 07:40:30] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2023-03-22 07:40:30] [INFO ] Deduced a trap composed of 13 places in 367 ms of which 1 ms to minimize.
[2023-03-22 07:40:30] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 1 ms to minimize.
[2023-03-22 07:40:31] [INFO ] Deduced a trap composed of 12 places in 277 ms of which 1 ms to minimize.
[2023-03-22 07:40:31] [INFO ] Deduced a trap composed of 19 places in 350 ms of which 2 ms to minimize.
[2023-03-22 07:40:32] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 1 ms to minimize.
[2023-03-22 07:40:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5329 ms
[2023-03-22 07:40:32] [INFO ] Deduced a trap composed of 13 places in 350 ms of which 1 ms to minimize.
[2023-03-22 07:40:33] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 1 ms to minimize.
[2023-03-22 07:40:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 906 ms
[2023-03-22 07:40:33] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2023-03-22 07:40:34] [INFO ] Deduced a trap composed of 7 places in 287 ms of which 1 ms to minimize.
[2023-03-22 07:40:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 780 ms
[2023-03-22 07:40:34] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 2 ms to minimize.
[2023-03-22 07:40:35] [INFO ] Deduced a trap composed of 3 places in 321 ms of which 0 ms to minimize.
[2023-03-22 07:40:35] [INFO ] Deduced a trap composed of 8 places in 380 ms of which 1 ms to minimize.
[2023-03-22 07:40:35] [INFO ] Deduced a trap composed of 7 places in 318 ms of which 1 ms to minimize.
[2023-03-22 07:40:36] [INFO ] Deduced a trap composed of 14 places in 337 ms of which 1 ms to minimize.
[2023-03-22 07:40:36] [INFO ] Deduced a trap composed of 15 places in 258 ms of which 1 ms to minimize.
[2023-03-22 07:40:37] [INFO ] Deduced a trap composed of 15 places in 302 ms of which 1 ms to minimize.
[2023-03-22 07:40:37] [INFO ] Deduced a trap composed of 17 places in 244 ms of which 0 ms to minimize.
[2023-03-22 07:40:37] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 1 ms to minimize.
[2023-03-22 07:40:38] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2023-03-22 07:40:38] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 0 ms to minimize.
[2023-03-22 07:40:38] [INFO ] Deduced a trap composed of 14 places in 320 ms of which 1 ms to minimize.
[2023-03-22 07:40:39] [INFO ] Deduced a trap composed of 16 places in 310 ms of which 0 ms to minimize.
[2023-03-22 07:40:39] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 1 ms to minimize.
[2023-03-22 07:40:39] [INFO ] Deduced a trap composed of 12 places in 314 ms of which 1 ms to minimize.
[2023-03-22 07:40:40] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 5645 ms
[2023-03-22 07:40:40] [INFO ] Deduced a trap composed of 13 places in 381 ms of which 1 ms to minimize.
[2023-03-22 07:40:41] [INFO ] Deduced a trap composed of 13 places in 337 ms of which 0 ms to minimize.
[2023-03-22 07:40:41] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-22 07:40:41] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2023-03-22 07:40:42] [INFO ] Deduced a trap composed of 16 places in 276 ms of which 1 ms to minimize.
[2023-03-22 07:40:42] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 1 ms to minimize.
[2023-03-22 07:40:42] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2023-03-22 07:40:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2821 ms
[2023-03-22 07:40:43] [INFO ] Deduced a trap composed of 14 places in 310 ms of which 1 ms to minimize.
[2023-03-22 07:40:44] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 0 ms to minimize.
[2023-03-22 07:40:44] [INFO ] Deduced a trap composed of 17 places in 295 ms of which 0 ms to minimize.
[2023-03-22 07:40:44] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2023-03-22 07:40:45] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2023-03-22 07:40:45] [INFO ] Deduced a trap composed of 17 places in 301 ms of which 1 ms to minimize.
[2023-03-22 07:40:45] [INFO ] Deduced a trap composed of 18 places in 330 ms of which 1 ms to minimize.
[2023-03-22 07:40:46] [INFO ] Deduced a trap composed of 13 places in 270 ms of which 1 ms to minimize.
[2023-03-22 07:40:46] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 1 ms to minimize.
[2023-03-22 07:40:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3253 ms
[2023-03-22 07:40:47] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 1 ms to minimize.
[2023-03-22 07:40:47] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 1 ms to minimize.
[2023-03-22 07:40:47] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 1 ms to minimize.
[2023-03-22 07:40:48] [INFO ] Deduced a trap composed of 15 places in 339 ms of which 1 ms to minimize.
[2023-03-22 07:40:48] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-22 07:40:48] [INFO ] Deduced a trap composed of 14 places in 250 ms of which 1 ms to minimize.
[2023-03-22 07:40:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2062 ms
[2023-03-22 07:40:49] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 1 ms to minimize.
[2023-03-22 07:40:49] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 0 ms to minimize.
[2023-03-22 07:40:50] [INFO ] Deduced a trap composed of 6 places in 242 ms of which 1 ms to minimize.
[2023-03-22 07:40:50] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 1 ms to minimize.
[2023-03-22 07:40:50] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 0 ms to minimize.
[2023-03-22 07:40:50] [INFO ] Deduced a trap composed of 16 places in 188 ms of which 1 ms to minimize.
[2023-03-22 07:40:51] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 1 ms to minimize.
[2023-03-22 07:40:51] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2023-03-22 07:40:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2426 ms
[2023-03-22 07:40:52] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 1 ms to minimize.
[2023-03-22 07:40:52] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 0 ms to minimize.
[2023-03-22 07:40:52] [INFO ] Deduced a trap composed of 8 places in 249 ms of which 0 ms to minimize.
[2023-03-22 07:40:53] [INFO ] Deduced a trap composed of 18 places in 253 ms of which 1 ms to minimize.
[2023-03-22 07:40:53] [INFO ] Deduced a trap composed of 11 places in 249 ms of which 0 ms to minimize.
[2023-03-22 07:40:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1798 ms
[2023-03-22 07:40:53] [INFO ] After 41788ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 3427 ms.
[2023-03-22 07:40:57] [INFO ] After 48255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
[2023-03-22 07:40:57] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-22 07:40:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1563 places, 1327 transitions and 5222 arcs took 12 ms.
[2023-03-22 07:40:57] [INFO ] Flatten gal took : 139 ms
Total runtime 155618 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/1135/inv_0_ --invariant=/tmp/1135/inv_1_ --invariant=/tmp/1135/inv_2_ --invariant=/tmp/1135/inv_3_ --invariant=/tmp/1135/inv_4_ --invariant=/tmp/1135/inv_5_ --invariant=/tmp/1135/inv_6_ --invariant=/tmp/1135/inv_7_ --invariant=/tmp/1135/inv_8_ --invariant=/tmp/1135/inv_9_ --invariant=/tmp/1135/inv_10_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9693608 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16094600 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903717300687"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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