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

About the Execution of LTSMin+red for ShieldRVs-PT-040B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2365.896 3600000.00 14286098.00 142.50 ??T????????????? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800138.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1012K
-rw-r--r-- 1 mcc users 8.5K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 498K 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 ShieldRVs-PT-040B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679299382986

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:03:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 08:03:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:03:05] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2023-03-20 08:03:05] [INFO ] Transformed 1603 places.
[2023-03-20 08:03:05] [INFO ] Transformed 1803 transitions.
[2023-03-20 08:03:05] [INFO ] Found NUPN structural information;
[2023-03-20 08:03:05] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 192 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 246 places :
Symmetric choice reduction at 0 with 246 rule applications. Total rules 246 place count 1357 transition count 1557
Iterating global reduction 0 with 246 rules applied. Total rules applied 492 place count 1357 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 493 place count 1356 transition count 1556
Iterating global reduction 0 with 1 rules applied. Total rules applied 494 place count 1356 transition count 1556
Applied a total of 494 rules in 517 ms. Remains 1356 /1603 variables (removed 247) and now considering 1556/1803 (removed 247) transitions.
// Phase 1: matrix 1556 rows 1356 cols
[2023-03-20 08:03:06] [INFO ] Computed 161 place invariants in 31 ms
[2023-03-20 08:03:07] [INFO ] Implicit Places using invariants in 1386 ms returned []
[2023-03-20 08:03:07] [INFO ] Invariant cache hit.
[2023-03-20 08:03:09] [INFO ] Implicit Places using invariants and state equation in 1833 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
[2023-03-20 08:03:09] [INFO ] Invariant cache hit.
[2023-03-20 08:03:10] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1356/1603 places, 1556/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4658 ms. Remains : 1356/1603 places, 1556/1803 transitions.
Support contains 192 out of 1356 places after structural reductions.
[2023-03-20 08:03:11] [INFO ] Flatten gal took : 252 ms
[2023-03-20 08:03:11] [INFO ] Flatten gal took : 158 ms
[2023-03-20 08:03:11] [INFO ] Input system was already deterministic with 1556 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 525 ms. (steps per millisecond=19 ) properties (out of 108) seen :85
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-20 08:03:12] [INFO ] Invariant cache hit.
[2023-03-20 08:03:13] [INFO ] [Real]Absence check using 161 positive place invariants in 47 ms returned sat
[2023-03-20 08:03:13] [INFO ] After 712ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-20 08:03:13] [INFO ] [Nat]Absence check using 161 positive place invariants in 50 ms returned sat
[2023-03-20 08:03:16] [INFO ] After 2165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-20 08:03:16] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 5 ms to minimize.
[2023-03-20 08:03:16] [INFO ] Deduced a trap composed of 29 places in 219 ms of which 1 ms to minimize.
[2023-03-20 08:03:17] [INFO ] Deduced a trap composed of 46 places in 371 ms of which 1 ms to minimize.
[2023-03-20 08:03:17] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 2 ms to minimize.
[2023-03-20 08:03:17] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 1 ms to minimize.
[2023-03-20 08:03:18] [INFO ] Deduced a trap composed of 49 places in 335 ms of which 1 ms to minimize.
[2023-03-20 08:03:18] [INFO ] Deduced a trap composed of 39 places in 322 ms of which 2 ms to minimize.
[2023-03-20 08:03:19] [INFO ] Deduced a trap composed of 45 places in 303 ms of which 1 ms to minimize.
[2023-03-20 08:03:19] [INFO ] Deduced a trap composed of 67 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:03:19] [INFO ] Deduced a trap composed of 69 places in 240 ms of which 1 ms to minimize.
[2023-03-20 08:03:19] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 0 ms to minimize.
[2023-03-20 08:03:20] [INFO ] Deduced a trap composed of 55 places in 276 ms of which 1 ms to minimize.
[2023-03-20 08:03:20] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 1 ms to minimize.
[2023-03-20 08:03:20] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4231 ms
[2023-03-20 08:03:21] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 1 ms to minimize.
[2023-03-20 08:03:21] [INFO ] Deduced a trap composed of 52 places in 201 ms of which 2 ms to minimize.
[2023-03-20 08:03:21] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 1 ms to minimize.
[2023-03-20 08:03:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 778 ms
[2023-03-20 08:03:21] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 4 ms to minimize.
[2023-03-20 08:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2023-03-20 08:03:22] [INFO ] Deduced a trap composed of 27 places in 304 ms of which 1 ms to minimize.
[2023-03-20 08:03:22] [INFO ] Deduced a trap composed of 37 places in 295 ms of which 1 ms to minimize.
[2023-03-20 08:03:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 819 ms
[2023-03-20 08:03:23] [INFO ] Deduced a trap composed of 36 places in 256 ms of which 0 ms to minimize.
[2023-03-20 08:03:23] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 0 ms to minimize.
[2023-03-20 08:03:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-20 08:03:23] [INFO ] Deduced a trap composed of 46 places in 330 ms of which 1 ms to minimize.
[2023-03-20 08:03:24] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 1 ms to minimize.
[2023-03-20 08:03:24] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 1 ms to minimize.
[2023-03-20 08:03:24] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 1 ms to minimize.
[2023-03-20 08:03:25] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 0 ms to minimize.
[2023-03-20 08:03:25] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 0 ms to minimize.
[2023-03-20 08:03:25] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 0 ms to minimize.
[2023-03-20 08:03:26] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 1 ms to minimize.
[2023-03-20 08:03:26] [INFO ] Deduced a trap composed of 42 places in 204 ms of which 1 ms to minimize.
[2023-03-20 08:03:26] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 1 ms to minimize.
[2023-03-20 08:03:27] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 0 ms to minimize.
[2023-03-20 08:03:27] [INFO ] Deduced a trap composed of 41 places in 226 ms of which 3 ms to minimize.
[2023-03-20 08:03:27] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 5 ms to minimize.
[2023-03-20 08:03:27] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4144 ms
[2023-03-20 08:03:28] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 0 ms to minimize.
[2023-03-20 08:03:28] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 0 ms to minimize.
[2023-03-20 08:03:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 838 ms
[2023-03-20 08:03:29] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 1 ms to minimize.
[2023-03-20 08:03:29] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 1 ms to minimize.
[2023-03-20 08:03:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 722 ms
[2023-03-20 08:03:30] [INFO ] Deduced a trap composed of 43 places in 310 ms of which 1 ms to minimize.
[2023-03-20 08:03:30] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 2 ms to minimize.
[2023-03-20 08:03:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 760 ms
[2023-03-20 08:03:31] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 0 ms to minimize.
[2023-03-20 08:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2023-03-20 08:03:31] [INFO ] Deduced a trap composed of 38 places in 327 ms of which 1 ms to minimize.
[2023-03-20 08:03:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 463 ms
[2023-03-20 08:03:32] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 1 ms to minimize.
[2023-03-20 08:03:32] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 1 ms to minimize.
[2023-03-20 08:03:32] [INFO ] Deduced a trap composed of 49 places in 314 ms of which 1 ms to minimize.
[2023-03-20 08:03:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1156 ms
[2023-03-20 08:03:33] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 1 ms to minimize.
[2023-03-20 08:03:33] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 1 ms to minimize.
[2023-03-20 08:03:33] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 0 ms to minimize.
[2023-03-20 08:03:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 908 ms
[2023-03-20 08:03:34] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2023-03-20 08:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2023-03-20 08:03:34] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 0 ms to minimize.
[2023-03-20 08:03:35] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 4 ms to minimize.
[2023-03-20 08:03:35] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 1 ms to minimize.
[2023-03-20 08:03:35] [INFO ] Deduced a trap composed of 61 places in 255 ms of which 1 ms to minimize.
[2023-03-20 08:03:36] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 1 ms to minimize.
[2023-03-20 08:03:36] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 0 ms to minimize.
[2023-03-20 08:03:36] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 4 ms to minimize.
[2023-03-20 08:03:37] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 1 ms to minimize.
[2023-03-20 08:03:37] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 0 ms to minimize.
[2023-03-20 08:03:37] [INFO ] Deduced a trap composed of 45 places in 318 ms of which 1 ms to minimize.
[2023-03-20 08:03:43] [INFO ] Deduced a trap composed of 26 places in 5165 ms of which 26 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.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-20 08:03:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 08:03:43] [INFO ] After 29987ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Parikh walk visited 1 properties in 1187 ms.
Support contains 59 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Drop transitions removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 1356 transition count 1412
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 288 place count 1212 transition count 1412
Performed 197 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 197 Pre rules applied. Total rules applied 288 place count 1212 transition count 1215
Deduced a syphon composed of 197 places in 2 ms
Reduce places removed 197 places and 0 transitions.
Iterating global reduction 2 with 394 rules applied. Total rules applied 682 place count 1015 transition count 1215
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 709 place count 988 transition count 1188
Iterating global reduction 2 with 27 rules applied. Total rules applied 736 place count 988 transition count 1188
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 736 place count 988 transition count 1178
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 756 place count 978 transition count 1178
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 2 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 2 with 754 rules applied. Total rules applied 1510 place count 601 transition count 801
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 76 times.
Drop transitions removed 76 transitions
Iterating global reduction 2 with 76 rules applied. Total rules applied 1586 place count 601 transition count 801
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1587 place count 600 transition count 800
Applied a total of 1587 rules in 353 ms. Remains 600 /1356 variables (removed 756) and now considering 800/1556 (removed 756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 600/1356 places, 800/1556 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) 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 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 800 rows 600 cols
[2023-03-20 08:03:45] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-20 08:03:45] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:03:45] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2023-03-20 08:03:45] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:03:45] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 1 ms to minimize.
[2023-03-20 08:03:45] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-20 08:03:46] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2023-03-20 08:03:46] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-20 08:03:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 382 ms
[2023-03-20 08:03:46] [INFO ] After 698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-20 08:03:46] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 800/800 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 600 transition count 797
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 597 transition count 797
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 6 place count 597 transition count 783
Deduced a syphon composed of 14 places in 9 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 34 place count 583 transition count 783
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 582 transition count 782
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 582 transition count 782
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 64 place count 568 transition count 768
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 568 transition count 768
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 566 transition count 766
Applied a total of 71 rules in 159 ms. Remains 566 /600 variables (removed 34) and now considering 766/800 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 566/600 places, 766/800 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :1
Finished Best-First random walk after 3193 steps, including 0 resets, run visited all 1 properties in 8 ms. (steps per millisecond=399 )
[2023-03-20 08:03:46] [INFO ] Flatten gal took : 54 ms
[2023-03-20 08:03:46] [INFO ] Flatten gal took : 51 ms
[2023-03-20 08:03:46] [INFO ] Input system was already deterministic with 1556 transitions.
Computed a total of 338 stabilizing places and 338 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1324 transition count 1524
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1324 transition count 1524
Applied a total of 64 rules in 68 ms. Remains 1324 /1356 variables (removed 32) and now considering 1524/1556 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 1324/1356 places, 1524/1556 transitions.
[2023-03-20 08:03:46] [INFO ] Flatten gal took : 77 ms
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 48 ms
[2023-03-20 08:03:47] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1324 transition count 1524
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1324 transition count 1524
Applied a total of 64 rules in 76 ms. Remains 1324 /1356 variables (removed 32) and now considering 1524/1556 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 1324/1356 places, 1524/1556 transitions.
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 57 ms
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 47 ms
[2023-03-20 08:03:47] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1355 transition count 1394
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1194 transition count 1394
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1194 transition count 1195
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 995 transition count 1195
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 754 place count 961 transition count 1161
Iterating global reduction 2 with 34 rules applied. Total rules applied 788 place count 961 transition count 1161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 788 place count 961 transition count 1149
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 812 place count 949 transition count 1149
Performed 384 Post agglomeration using F-continuation condition.Transition count delta: 384
Deduced a syphon composed of 384 places in 1 ms
Reduce places removed 384 places and 0 transitions.
Iterating global reduction 2 with 768 rules applied. Total rules applied 1580 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1582 place count 563 transition count 763
Applied a total of 1582 rules in 184 ms. Remains 563 /1356 variables (removed 793) and now considering 763/1556 (removed 793) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 185 ms. Remains : 563/1356 places, 763/1556 transitions.
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 35 ms
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 36 ms
[2023-03-20 08:03:47] [INFO ] Input system was already deterministic with 763 transitions.
Finished random walk after 436 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=109 )
FORMULA ShieldRVs-PT-040B-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1322 transition count 1522
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1322 transition count 1522
Applied a total of 68 rules in 103 ms. Remains 1322 /1356 variables (removed 34) and now considering 1522/1556 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1322/1356 places, 1522/1556 transitions.
[2023-03-20 08:03:47] [INFO ] Flatten gal took : 53 ms
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 42 ms
[2023-03-20 08:03:48] [INFO ] Input system was already deterministic with 1522 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1323 transition count 1523
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1323 transition count 1523
Applied a total of 66 rules in 97 ms. Remains 1323 /1356 variables (removed 33) and now considering 1523/1556 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1323/1356 places, 1523/1556 transitions.
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 38 ms
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 42 ms
[2023-03-20 08:03:48] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1326 transition count 1526
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1326 transition count 1526
Applied a total of 60 rules in 111 ms. Remains 1326 /1356 variables (removed 30) and now considering 1526/1556 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 1326/1356 places, 1526/1556 transitions.
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 50 ms
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 39 ms
[2023-03-20 08:03:48] [INFO ] Input system was already deterministic with 1526 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1324 transition count 1524
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1324 transition count 1524
Applied a total of 64 rules in 95 ms. Remains 1324 /1356 variables (removed 32) and now considering 1524/1556 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1324/1356 places, 1524/1556 transitions.
[2023-03-20 08:03:48] [INFO ] Flatten gal took : 61 ms
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 66 ms
[2023-03-20 08:03:49] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1355 transition count 1398
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 1198 transition count 1398
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 314 place count 1198 transition count 1198
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 714 place count 998 transition count 1198
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 748 place count 964 transition count 1164
Iterating global reduction 2 with 34 rules applied. Total rules applied 782 place count 964 transition count 1164
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 782 place count 964 transition count 1152
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 806 place count 952 transition count 1152
Performed 381 Post agglomeration using F-continuation condition.Transition count delta: 381
Deduced a syphon composed of 381 places in 1 ms
Reduce places removed 381 places and 0 transitions.
Iterating global reduction 2 with 762 rules applied. Total rules applied 1568 place count 571 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1570 place count 569 transition count 769
Applied a total of 1570 rules in 179 ms. Remains 569 /1356 variables (removed 787) and now considering 769/1556 (removed 787) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 180 ms. Remains : 569/1356 places, 769/1556 transitions.
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 23 ms
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 24 ms
[2023-03-20 08:03:49] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1330 transition count 1530
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1330 transition count 1530
Applied a total of 52 rules in 58 ms. Remains 1330 /1356 variables (removed 26) and now considering 1530/1556 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1330/1356 places, 1530/1556 transitions.
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 34 ms
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 36 ms
[2023-03-20 08:03:49] [INFO ] Input system was already deterministic with 1530 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1326 transition count 1526
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1326 transition count 1526
Applied a total of 60 rules in 55 ms. Remains 1326 /1356 variables (removed 30) and now considering 1526/1556 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1326/1356 places, 1526/1556 transitions.
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 33 ms
[2023-03-20 08:03:49] [INFO ] Flatten gal took : 49 ms
[2023-03-20 08:03:50] [INFO ] Input system was already deterministic with 1526 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1325 transition count 1525
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1325 transition count 1525
Applied a total of 62 rules in 71 ms. Remains 1325 /1356 variables (removed 31) and now considering 1525/1556 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 1325/1356 places, 1525/1556 transitions.
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 67 ms
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 64 ms
[2023-03-20 08:03:50] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1355 transition count 1394
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1194 transition count 1394
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 322 place count 1194 transition count 1196
Deduced a syphon composed of 198 places in 1 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 718 place count 996 transition count 1196
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 752 place count 962 transition count 1162
Iterating global reduction 2 with 34 rules applied. Total rules applied 786 place count 962 transition count 1162
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 786 place count 962 transition count 1150
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 810 place count 950 transition count 1150
Performed 385 Post agglomeration using F-continuation condition.Transition count delta: 385
Deduced a syphon composed of 385 places in 1 ms
Reduce places removed 385 places and 0 transitions.
Iterating global reduction 2 with 770 rules applied. Total rules applied 1580 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1582 place count 563 transition count 763
Applied a total of 1582 rules in 190 ms. Remains 563 /1356 variables (removed 793) and now considering 763/1556 (removed 793) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 190 ms. Remains : 563/1356 places, 763/1556 transitions.
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 18 ms
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 19 ms
[2023-03-20 08:03:50] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1325 transition count 1525
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1325 transition count 1525
Applied a total of 62 rules in 56 ms. Remains 1325 /1356 variables (removed 31) and now considering 1525/1556 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1325/1356 places, 1525/1556 transitions.
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 37 ms
[2023-03-20 08:03:50] [INFO ] Flatten gal took : 51 ms
[2023-03-20 08:03:50] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1325 transition count 1525
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1325 transition count 1525
Applied a total of 62 rules in 68 ms. Remains 1325 /1356 variables (removed 31) and now considering 1525/1556 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 1325/1356 places, 1525/1556 transitions.
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 35 ms
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 37 ms
[2023-03-20 08:03:51] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1324 transition count 1524
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1324 transition count 1524
Applied a total of 64 rules in 53 ms. Remains 1324 /1356 variables (removed 32) and now considering 1524/1556 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1324/1356 places, 1524/1556 transitions.
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 33 ms
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 34 ms
[2023-03-20 08:03:51] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1356/1356 places, 1556/1556 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1325 transition count 1525
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1325 transition count 1525
Applied a total of 62 rules in 78 ms. Remains 1325 /1356 variables (removed 31) and now considering 1525/1556 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 1325/1356 places, 1525/1556 transitions.
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 33 ms
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 34 ms
[2023-03-20 08:03:51] [INFO ] Input system was already deterministic with 1525 transitions.
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 35 ms
[2023-03-20 08:03:51] [INFO ] Flatten gal took : 34 ms
[2023-03-20 08:03:51] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-20 08:03:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1356 places, 1556 transitions and 5266 arcs took 9 ms.
Total runtime 46596 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 --ctl=/tmp/696/ctl_0_ --ctl=/tmp/696/ctl_1_ --ctl=/tmp/696/ctl_2_ --ctl=/tmp/696/ctl_3_ --ctl=/tmp/696/ctl_4_ --ctl=/tmp/696/ctl_5_ --ctl=/tmp/696/ctl_6_ --ctl=/tmp/696/ctl_7_ --ctl=/tmp/696/ctl_8_ --ctl=/tmp/696/ctl_9_ --ctl=/tmp/696/ctl_10_ --ctl=/tmp/696/ctl_11_ --ctl=/tmp/696/ctl_12_ --ctl=/tmp/696/ctl_13_ --ctl=/tmp/696/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 13778208 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097604 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 CTLFireability -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="ShieldRVs-PT-040B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800138"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-040B.tgz
mv ShieldRVs-PT-040B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;