fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Smart+red for JoinFreeModules-PT-0500

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3371.804 351751.00 450332.00 859.90 T 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.r249-tall-167856435800127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is JoinFreeModules-PT-0500, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r249-tall-167856435800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.1K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678732452978

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=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=JoinFreeModules-PT-0500
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 18:34:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-13 18:34:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:34:14] [INFO ] Load time of PNML (sax parser for PT used): 183 ms
[2023-03-13 18:34:14] [INFO ] Transformed 2501 places.
[2023-03-13 18:34:14] [INFO ] Transformed 4001 transitions.
[2023-03-13 18:34:14] [INFO ] Parsed PT model containing 2501 places and 4001 transitions and 11502 arcs in 278 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2501/2501 places, 4001/4001 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2500 transition count 4001
Applied a total of 1 rules in 74 ms. Remains 2500 /2501 variables (removed 1) and now considering 4001/4001 (removed 0) transitions.
// Phase 1: matrix 4001 rows 2500 cols
[2023-03-13 18:34:15] [INFO ] Computed 500 place invariants in 43 ms
[2023-03-13 18:34:17] [INFO ] Dead Transitions using invariants and state equation in 2024 ms found 0 transitions.
[2023-03-13 18:34:17] [INFO ] Invariant cache hit.
[2023-03-13 18:34:17] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-13 18:34:17] [INFO ] Invariant cache hit.
[2023-03-13 18:34:19] [INFO ] State equation strengthened by 500 read => feed constraints.
[2023-03-13 18:34:19] [INFO ] Implicit Places using invariants and state equation in 1668 ms returned []
Implicit Place search using SMT with State Equation took 2102 ms to find 0 implicit places.
[2023-03-13 18:34:19] [INFO ] Invariant cache hit.
[2023-03-13 18:34:20] [INFO ] Dead Transitions using invariants and state equation in 1720 ms found 0 transitions.
Starting structural reductions in LIVENESS mode, iteration 1 : 2500/2501 places, 4001/4001 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 6146 ms. Remains : 2500/2501 places, 4001/4001 transitions.
Discarding 2000 transitions out of 4001. Remains 2001
Initial state reduction rules removed 1 formulas.
Incomplete random walk after 10028 steps, including 2 resets, run finished after 274 ms. (steps per millisecond=36 ) properties (out of 2000) seen :38
Probabilistic random walk after 16042 steps, saw 16022 distinct states, run finished after 3008 ms. (steps per millisecond=5 ) properties seen :489
Running SMT prover for 1473 properties.
[2023-03-13 18:34:24] [INFO ] Invariant cache hit.
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.assertInvariants(DeadlockTester.java:2340)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:618)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-13 18:34:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 18:34:50] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 1473 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1473 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 4001/4001 transitions.
Graph (complete) has 6000 edges and 2500 vertex of which 2495 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.9 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2495 transition count 3992
Applied a total of 2 rules in 158 ms. Remains 2495 /2500 variables (removed 5) and now considering 3992/4001 (removed 9) transitions.
// Phase 1: matrix 3992 rows 2495 cols
[2023-03-13 18:34:50] [INFO ] Computed 499 place invariants in 18 ms
[2023-03-13 18:34:52] [INFO ] Dead Transitions using invariants and state equation in 1820 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1979 ms. Remains : 2495/2500 places, 3992/4001 transitions.
Incomplete random walk after 1000233 steps, including 2 resets, run finished after 23390 ms. (steps per millisecond=42 ) properties (out of 1473) seen :1420
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2183 ms. (steps per millisecond=45 ) properties (out of 53) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2252 ms. (steps per millisecond=44 ) properties (out of 53) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2164 ms. (steps per millisecond=46 ) properties (out of 51) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2432 ms. (steps per millisecond=41 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2418 ms. (steps per millisecond=41 ) properties (out of 50) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2407 ms. (steps per millisecond=41 ) properties (out of 50) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2419 ms. (steps per millisecond=41 ) properties (out of 48) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2420 ms. (steps per millisecond=41 ) properties (out of 48) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2354 ms. (steps per millisecond=42 ) properties (out of 46) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2317 ms. (steps per millisecond=43 ) properties (out of 45) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2324 ms. (steps per millisecond=43 ) properties (out of 43) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2310 ms. (steps per millisecond=43 ) properties (out of 43) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2305 ms. (steps per millisecond=43 ) properties (out of 41) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2307 ms. (steps per millisecond=43 ) properties (out of 40) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2317 ms. (steps per millisecond=43 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 38) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2316 ms. (steps per millisecond=43 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2306 ms. (steps per millisecond=43 ) properties (out of 37) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2309 ms. (steps per millisecond=43 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2307 ms. (steps per millisecond=43 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2303 ms. (steps per millisecond=43 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2335 ms. (steps per millisecond=42 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2313 ms. (steps per millisecond=43 ) properties (out of 30) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2312 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2318 ms. (steps per millisecond=43 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2323 ms. (steps per millisecond=43 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2314 ms. (steps per millisecond=43 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2319 ms. (steps per millisecond=43 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=43 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2301 ms. (steps per millisecond=43 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2298 ms. (steps per millisecond=43 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2297 ms. (steps per millisecond=43 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2240 ms. (steps per millisecond=44 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2203 ms. (steps per millisecond=45 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2172 ms. (steps per millisecond=46 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2127 ms. (steps per millisecond=47 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2135 ms. (steps per millisecond=46 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=46 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 2129 ms. (steps per millisecond=46 ) properties (out of 18) seen :2
Running SMT prover for 16 properties.
[2023-03-13 18:36:45] [INFO ] Invariant cache hit.
[2023-03-13 18:36:46] [INFO ] [Real]Absence check using 499 positive place invariants in 92 ms returned sat
[2023-03-13 18:36:50] [INFO ] After 4922ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-13 18:36:51] [INFO ] [Nat]Absence check using 499 positive place invariants in 94 ms returned sat
[2023-03-13 18:37:04] [INFO ] After 12416ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-13 18:37:04] [INFO ] State equation strengthened by 499 read => feed constraints.
[2023-03-13 18:37:05] [INFO ] After 1705ms SMT Verify possible using 499 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-13 18:37:06] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 4 ms to minimize.
[2023-03-13 18:37:06] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 1 ms to minimize.
[2023-03-13 18:37:06] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 1 ms to minimize.
[2023-03-13 18:37:07] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 2 ms to minimize.
[2023-03-13 18:37:07] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 1 ms to minimize.
[2023-03-13 18:37:08] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 1 ms to minimize.
[2023-03-13 18:37:08] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 0 ms to minimize.
[2023-03-13 18:37:08] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 2 ms to minimize.
[2023-03-13 18:37:09] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 1 ms to minimize.
[2023-03-13 18:37:09] [INFO ] Deduced a trap composed of 3 places in 232 ms of which 1 ms to minimize.
[2023-03-13 18:37:09] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2023-03-13 18:37:09] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3889 ms
[2023-03-13 18:37:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3889 ms
[2023-03-13 18:37:10] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 1 ms to minimize.
[2023-03-13 18:37:10] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 1 ms to minimize.
[2023-03-13 18:37:10] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 1 ms to minimize.
[2023-03-13 18:37:11] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 0 ms to minimize.
[2023-03-13 18:37:11] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 1 ms to minimize.
[2023-03-13 18:37:11] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 1 ms to minimize.
[2023-03-13 18:37:12] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 1 ms to minimize.
[2023-03-13 18:37:12] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 1 ms to minimize.
[2023-03-13 18:37:12] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2023-03-13 18:37:12] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 1 ms to minimize.
[2023-03-13 18:37:13] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 1 ms to minimize.
[2023-03-13 18:37:13] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3437 ms
[2023-03-13 18:37:13] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3437 ms
[2023-03-13 18:37:13] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 1 ms to minimize.
[2023-03-13 18:37:13] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 1 ms to minimize.
[2023-03-13 18:37:14] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 0 ms to minimize.
[2023-03-13 18:37:14] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 1 ms to minimize.
[2023-03-13 18:37:14] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 0 ms to minimize.
[2023-03-13 18:37:15] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 8 ms to minimize.
[2023-03-13 18:37:15] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-03-13 18:37:15] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2023-03-13 18:37:16] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 1 ms to minimize.
[2023-03-13 18:37:16] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2023-03-13 18:37:16] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-03-13 18:37:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3326 ms
[2023-03-13 18:37:16] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3326 ms
[2023-03-13 18:37:17] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 1 ms to minimize.
[2023-03-13 18:37:17] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 4 ms to minimize.
[2023-03-13 18:37:17] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 1 ms to minimize.
[2023-03-13 18:37:17] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-03-13 18:37:18] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 1 ms to minimize.
[2023-03-13 18:37:18] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 1 ms to minimize.
[2023-03-13 18:37:18] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 1 ms to minimize.
[2023-03-13 18:37:19] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 0 ms to minimize.
[2023-03-13 18:37:19] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 1 ms to minimize.
[2023-03-13 18:37:19] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-03-13 18:37:19] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 1 ms to minimize.
[2023-03-13 18:37:19] [INFO ] Trap strengthening procedure interrupted after too many repetitions 3191 ms
[2023-03-13 18:37:19] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3192 ms
[2023-03-13 18:37:20] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 0 ms to minimize.
[2023-03-13 18:37:20] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 1 ms to minimize.
[2023-03-13 18:37:20] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 0 ms to minimize.
[2023-03-13 18:37:21] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 1 ms to minimize.
[2023-03-13 18:37:21] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-03-13 18:37:21] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 1 ms to minimize.
[2023-03-13 18:37:21] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 1 ms to minimize.
[2023-03-13 18:37:22] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 0 ms to minimize.
[2023-03-13 18:37:22] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 0 ms to minimize.
[2023-03-13 18:37:22] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 1 ms to minimize.
[2023-03-13 18:37:23] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-03-13 18:37:23] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-03-13 18:37:23] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 5 ms to minimize.
[2023-03-13 18:37:23] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 0 ms to minimize.
[2023-03-13 18:37:24] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-03-13 18:37:24] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-03-13 18:37:24] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:37:25] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-03-13 18:37:25] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:37:25] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-03-13 18:37:25] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 0 ms to minimize.
[2023-03-13 18:37:25] [INFO ] Trap strengthening procedure interrupted after too many repetitions 5780 ms
[2023-03-13 18:37:25] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5780 ms
[2023-03-13 18:37:26] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2023-03-13 18:37:26] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 2 ms to minimize.
[2023-03-13 18:37:26] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 4 ms to minimize.
[2023-03-13 18:37:26] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-03-13 18:37:27] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-03-13 18:37:27] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-03-13 18:37:27] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 1 ms to minimize.
[2023-03-13 18:37:27] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 1 ms to minimize.
[2023-03-13 18:37:28] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 0 ms to minimize.
[2023-03-13 18:37:28] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 0 ms to minimize.
[2023-03-13 18:37:28] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-03-13 18:37:28] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2865 ms
[2023-03-13 18:37:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2865 ms
[2023-03-13 18:37:29] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-03-13 18:37:29] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2023-03-13 18:37:29] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 1 ms to minimize.
[2023-03-13 18:37:29] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 1 ms to minimize.
[2023-03-13 18:37:30] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-03-13 18:37:30] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-03-13 18:37:30] [INFO ] Deduced a trap composed of 3 places in 158 ms of which 0 ms to minimize.
[2023-03-13 18:37:30] [INFO ] Deduced a trap composed of 3 places in 155 ms of which 0 ms to minimize.
[2023-03-13 18:37:31] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:37:31] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 0 ms to minimize.
[2023-03-13 18:37:31] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 0 ms to minimize.
[2023-03-13 18:37:31] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2722 ms
[2023-03-13 18:37:31] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2722 ms
[2023-03-13 18:37:31] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-03-13 18:37:32] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 0 ms to minimize.
[2023-03-13 18:37:32] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 1 ms to minimize.
[2023-03-13 18:37:32] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 0 ms to minimize.
[2023-03-13 18:37:32] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2023-03-13 18:37:33] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-03-13 18:37:33] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 0 ms to minimize.
[2023-03-13 18:37:33] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-03-13 18:37:33] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-03-13 18:37:33] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:37:34] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-03-13 18:37:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2619 ms
[2023-03-13 18:37:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2619 ms
[2023-03-13 18:37:34] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2023-03-13 18:37:34] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 0 ms to minimize.
[2023-03-13 18:37:35] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 0 ms to minimize.
[2023-03-13 18:37:35] [INFO ] Deduced a trap composed of 3 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:37:35] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 1 ms to minimize.
[2023-03-13 18:37:35] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 0 ms to minimize.
[2023-03-13 18:37:35] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 0 ms to minimize.
[2023-03-13 18:37:36] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2023-03-13 18:37:36] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-03-13 18:37:36] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-03-13 18:37:36] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:37:37] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 0 ms to minimize.
[2023-03-13 18:37:37] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-03-13 18:37:37] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-03-13 18:37:37] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 1 ms to minimize.
[2023-03-13 18:37:37] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-03-13 18:37:38] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-03-13 18:37:38] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-03-13 18:37:38] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 0 ms to minimize.
[2023-03-13 18:37:38] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:37:39] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 0 ms to minimize.
[2023-03-13 18:37:39] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 1 ms to minimize.
[2023-03-13 18:37:39] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 1 ms to minimize.
[2023-03-13 18:37:39] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 0 ms to minimize.
[2023-03-13 18:37:39] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2023-03-13 18:37:40] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-03-13 18:37:40] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-03-13 18:37:40] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 0 ms to minimize.
[2023-03-13 18:37:40] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2023-03-13 18:37:40] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2023-03-13 18:37:41] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:37:41] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-03-13 18:37:41] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 0 ms to minimize.
[2023-03-13 18:37:41] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 0 ms to minimize.
[2023-03-13 18:37:41] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 0 ms to minimize.
[2023-03-13 18:37:42] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 0 ms to minimize.
[2023-03-13 18:37:42] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 0 ms to minimize.
[2023-03-13 18:37:42] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:37:42] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-03-13 18:37:42] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:37:43] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:37:43] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2023-03-13 18:37:43] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9022 ms
[2023-03-13 18:37:43] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 9023 ms
[2023-03-13 18:37:43] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:37:43] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2023-03-13 18:37:43] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-03-13 18:37:44] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:37:44] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 0 ms to minimize.
[2023-03-13 18:37:44] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:37:44] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-03-13 18:37:44] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2023-03-13 18:37:45] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 0 ms to minimize.
[2023-03-13 18:37:45] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:37:45] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2023-03-13 18:37:45] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2115 ms
[2023-03-13 18:37:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2115 ms
[2023-03-13 18:37:45] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-03-13 18:37:45] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:37:46] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:37:46] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:37:46] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-03-13 18:37:46] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-03-13 18:37:46] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2023-03-13 18:37:47] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-13 18:37:47] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2023-03-13 18:37:47] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:37:47] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 0 ms to minimize.
[2023-03-13 18:37:47] [INFO ] Trap strengthening procedure interrupted after too many repetitions 2035 ms
[2023-03-13 18:37:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2035 ms
[2023-03-13 18:37:47] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-03-13 18:37:48] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:37:49] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:37:49] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:37:49] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:37:49] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:37:49] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1958 ms
[2023-03-13 18:37:49] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1959 ms
[2023-03-13 18:37:49] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 0 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:37:50] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-03-13 18:37:51] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:37:51] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:37:51] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2023-03-13 18:37:51] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-03-13 18:37:51] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1874 ms
[2023-03-13 18:37:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1874 ms
[2023-03-13 18:37:51] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:37:52] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 0 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1841 ms
[2023-03-13 18:37:53] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1841 ms
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-03-13 18:37:53] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-03-13 18:37:54] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1759 ms
[2023-03-13 18:37:55] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1759 ms
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:37:55] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 0 ms to minimize.
[2023-03-13 18:37:56] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-03-13 18:37:57] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-03-13 18:37:57] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-03-13 18:37:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 1702 ms
[2023-03-13 18:37:57] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1703 ms
[2023-03-13 18:37:57] [INFO ] After 53118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 1578 ms.
[2023-03-13 18:37:58] [INFO ] After 68558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 2 properties in 125008 ms.
Support contains 14 out of 2495 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2495/2495 places, 3992/3992 transitions.
Graph (complete) has 5988 edges and 2495 vertex of which 70 are kept as prefixes of interest. Removing 2425 places using SCC suffix rule.2 ms
Discarding 2425 places :
Also discarding 3880 output transitions
Drop transitions removed 3880 transitions
Applied a total of 1 rules in 25 ms. Remains 70 /2495 variables (removed 2425) and now considering 112/3992 (removed 3880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 70/2495 places, 112/3992 transitions.
Finished random walk after 18881 steps, including 0 resets, run visited all 14 properties in 21 ms. (steps per millisecond=899 )
Able to resolve query QuasiLiveness after proving 2001 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 349465 ms.
ITS solved all properties within timeout

BK_STOP 1678732804729

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML

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="JoinFreeModules-PT-0500"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is JoinFreeModules-PT-0500, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r249-tall-167856435800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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