MCC'2023- Execution of r231-tall-167856415700197

About the Execution of LoLa+red for JoinFreeModules-PT-0200

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8745.268	3600000.00	13227200.00	1545.40	? ? 203 202 ? 203 202 ? ? 202 202 ? 202 203 ? 203	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.r231-tall-167856415700197.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 lolaxred
Input is JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700197
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 613K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679437030859

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:17:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:17:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:17:12] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-21 22:17:12] [INFO ] Transformed 1001 places.
[2023-03-21 22:17:12] [INFO ] Transformed 1601 transitions.
[2023-03-21 22:17:12] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-21 22:17:12] [INFO ] Computed 200 place invariants in 36 ms
Incomplete random walk after 10158 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=66 ) properties (out of 16) seen :311
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 16) seen :223
[2023-03-21 22:17:14] [INFO ] Invariant cache hit.
[2023-03-21 22:17:14] [INFO ] [Real]Absence check using 200 positive place invariants in 66 ms returned sat
[2023-03-21 22:17:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:15] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2023-03-21 22:17:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:15] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:17:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:17] [INFO ] [Nat]Absence check using state equation in 1430 ms returned sat
[2023-03-21 22:17:17] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-21 22:17:17] [INFO ] [Nat]Added 200 Read/Feed constraints in 148 ms returned sat
[2023-03-21 22:17:17] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 7 ms to minimize.
[2023-03-21 22:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 346 ms
[2023-03-21 22:17:17] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 91 ms.
[2023-03-21 22:17:20] [INFO ] Deduced a trap composed of 3 places in 400 ms of which 2 ms to minimize.
[2023-03-21 22:17:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:21] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:21] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-21 22:17:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:21] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:23] [INFO ] [Nat]Absence check using state equation in 2008 ms returned sat
[2023-03-21 22:17:23] [INFO ] [Nat]Added 200 Read/Feed constraints in 122 ms returned sat
[2023-03-21 22:17:23] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-21 22:17:26] [INFO ] Added : 115 causal constraints over 23 iterations in 2696 ms. Result :unknown
[2023-03-21 22:17:26] [INFO ] [Real]Absence check using 200 positive place invariants in 31 ms returned sat
[2023-03-21 22:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:26] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2023-03-21 22:17:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:27] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-21 22:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:28] [INFO ] [Nat]Absence check using state equation in 1528 ms returned sat
[2023-03-21 22:17:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 148 ms returned sat
[2023-03-21 22:17:28] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-21 22:17:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:32] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:32] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-21 22:17:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 44 ms returned sat
[2023-03-21 22:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:34] [INFO ] [Nat]Absence check using state equation in 1495 ms returned sat
[2023-03-21 22:17:34] [INFO ] [Nat]Added 200 Read/Feed constraints in 131 ms returned sat
[2023-03-21 22:17:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-21 22:17:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:37] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:38] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-21 22:17:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:39] [INFO ] [Nat]Absence check using state equation in 1530 ms returned sat
[2023-03-21 22:17:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 138 ms returned sat
[2023-03-21 22:17:40] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-21 22:17:43] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 1 ms to minimize.
[2023-03-21 22:17:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:43] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-21 22:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:44] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2023-03-21 22:17:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:45] [INFO ] [Nat]Absence check using state equation in 1509 ms returned sat
[2023-03-21 22:17:45] [INFO ] [Nat]Added 200 Read/Feed constraints in 127 ms returned sat
[2023-03-21 22:17:45] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-21 22:17:49] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 3 ms to minimize.
[2023-03-21 22:17:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:49] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-21 22:17:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:49] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-21 22:17:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:50] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:17:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:53] [INFO ] [Nat]Absence check using state equation in 3622 ms returned sat
[2023-03-21 22:17:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 94 ms returned sat
[2023-03-21 22:17:53] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-21 22:17:55] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 1 ms to minimize.
[2023-03-21 22:17:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:17:55] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:55] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-21 22:17:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:17:56] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:17:57] [INFO ] [Nat]Absence check using state equation in 1735 ms returned sat
[2023-03-21 22:17:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 106 ms returned sat
[2023-03-21 22:17:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-21 22:17:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:17:58] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-21 22:17:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 289 ms
[2023-03-21 22:17:58] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-21 22:18:01] [INFO ] Deduced a trap composed of 3 places in 363 ms of which 1 ms to minimize.
[2023-03-21 22:18:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:01] [INFO ] [Real]Absence check using 200 positive place invariants in 40 ms returned sat
[2023-03-21 22:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:01] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-21 22:18:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:02] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:03] [INFO ] [Nat]Absence check using state equation in 1533 ms returned sat
[2023-03-21 22:18:03] [INFO ] [Nat]Added 200 Read/Feed constraints in 105 ms returned sat
[2023-03-21 22:18:03] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-21 22:18:07] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 1 ms to minimize.
[2023-03-21 22:18:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:07] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:07] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-21 22:18:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:08] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-21 22:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:09] [INFO ] [Nat]Absence check using state equation in 1393 ms returned sat
[2023-03-21 22:18:09] [INFO ] [Nat]Added 200 Read/Feed constraints in 119 ms returned sat
[2023-03-21 22:18:09] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-21 22:18:13] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 0 ms to minimize.
[2023-03-21 22:18:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:13] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:13] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-21 22:18:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:15] [INFO ] [Nat]Absence check using state equation in 1509 ms returned sat
[2023-03-21 22:18:15] [INFO ] [Nat]Added 200 Read/Feed constraints in 127 ms returned sat
[2023-03-21 22:18:15] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-21 22:18:19] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 1 ms to minimize.
[2023-03-21 22:18:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:19] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-21 22:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:19] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2023-03-21 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:19] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-21 22:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:21] [INFO ] [Nat]Absence check using state equation in 1515 ms returned sat
[2023-03-21 22:18:21] [INFO ] [Nat]Added 200 Read/Feed constraints in 82 ms returned sat
[2023-03-21 22:18:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:18:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:18:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 255 ms
[2023-03-21 22:18:21] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2023-03-21 22:18:24] [INFO ] Added : 185 causal constraints over 37 iterations in 3013 ms. Result :unknown
[2023-03-21 22:18:24] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:25] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2023-03-21 22:18:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:25] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:27] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2023-03-21 22:18:27] [INFO ] [Nat]Added 200 Read/Feed constraints in 117 ms returned sat
[2023-03-21 22:18:27] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-21 22:18:30] [INFO ] Deduced a trap composed of 3 places in 377 ms of which 1 ms to minimize.
[2023-03-21 22:18:30] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:30] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:31] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-21 22:18:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:31] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-21 22:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:32] [INFO ] [Nat]Absence check using state equation in 1511 ms returned sat
[2023-03-21 22:18:33] [INFO ] [Nat]Added 200 Read/Feed constraints in 121 ms returned sat
[2023-03-21 22:18:33] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 71 ms.
[2023-03-21 22:18:36] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 1 ms to minimize.
[2023-03-21 22:18:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:18:36] [INFO ] [Real]Absence check using 200 positive place invariants in 30 ms returned sat
[2023-03-21 22:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:37] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2023-03-21 22:18:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:37] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-21 22:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:39] [INFO ] [Nat]Absence check using state equation in 1898 ms returned sat
[2023-03-21 22:18:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-21 22:18:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 2986 ms returned unknown
[2023-03-21 22:18:42] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-21 22:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:42] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-21 22:18:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:18:42] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-21 22:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:18:44] [INFO ] [Nat]Absence check using state equation in 1537 ms returned sat
[2023-03-21 22:18:44] [INFO ] [Nat]Added 200 Read/Feed constraints in 124 ms returned sat
[2023-03-21 22:18:44] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-21 22:18:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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)
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[9, 10, 12, 9, 10, 12, 2, 9, 200, 2, 2, 9, 2, 12, 10, 100]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.4 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 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 80 transition count 128
Applied a total of 2 rules in 27 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-21 22:19:47] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-21 22:19:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 80/1000 places, 128/1601 transitions.
[2023-03-21 22:19:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000055 steps, including 2 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 16) seen :3178
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 14) seen :742
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=947 ) properties (out of 14) seen :698
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 14) seen :711
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 14) seen :721
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 14) seen :672
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 14) seen :722
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 14) seen :624
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1096 ms. (steps per millisecond=912 ) properties (out of 14) seen :731
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 14) seen :562
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 14) seen :626
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 14) seen :634
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 14) seen :730
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 14) seen :615
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1056 ms. (steps per millisecond=946 ) properties (out of 14) seen :690
[2023-03-21 22:20:03] [INFO ] Invariant cache hit.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:04] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-21 22:20:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-21 22:20:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:04] [INFO ] Added : 66 causal constraints over 14 iterations in 279 ms. Result :sat
Minimization took 52 ms.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-21 22:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:04] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:04] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:04] [INFO ] Added : 46 causal constraints over 11 iterations in 118 ms. Result :sat
Minimization took 44 ms.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:04] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-21 22:20:05] [INFO ] Added : 45 causal constraints over 9 iterations in 141 ms. Result :sat
Minimization took 38 ms.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:05] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-21 22:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-03-21 22:20:05] [INFO ] Added : 56 causal constraints over 15 iterations in 182 ms. Result :sat
Minimization took 41 ms.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:20:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Nat]Added 16 Read/Feed constraints in 11 ms returned sat
[2023-03-21 22:20:05] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:20:05] [INFO ] Added : 45 causal constraints over 10 iterations in 130 ms. Result :sat
Minimization took 49 ms.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:20:06] [INFO ] Added : 50 causal constraints over 11 iterations in 135 ms. Result :sat
Minimization took 34 ms.
[2023-03-21 22:20:06] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-21 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:20:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:20:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-21 22:20:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-03-21 22:20:06] [INFO ] Added : 54 causal constraints over 12 iterations in 225 ms. Result :sat
Minimization took 38 ms.
[2023-03-21 22:20:06] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:06] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-21 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:06] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2023-03-21 22:20:06] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:06] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:07] [INFO ] Added : 54 causal constraints over 12 iterations in 152 ms. Result :sat
Minimization took 50 ms.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:07] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:07] [INFO ] Added : 59 causal constraints over 12 iterations in 147 ms. Result :sat
Minimization took 45 ms.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-21 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:07] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:07] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:20:07] [INFO ] Added : 53 causal constraints over 11 iterations in 155 ms. Result :sat
Minimization took 43 ms.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:08] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:08] [INFO ] Added : 56 causal constraints over 12 iterations in 179 ms. Result :sat
Minimization took 49 ms.
[2023-03-21 22:20:08] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:08] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:08] [INFO ] Added : 48 causal constraints over 10 iterations in 204 ms. Result :sat
Minimization took 39 ms.
[2023-03-21 22:20:08] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-21 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:08] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-21 22:20:08] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:08] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:20:08] [INFO ] Added : 62 causal constraints over 15 iterations in 167 ms. Result :sat
Minimization took 44 ms.
[2023-03-21 22:20:09] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-21 22:20:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:09] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:09] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-21 22:20:09] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:09] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:09] [INFO ] Added : 51 causal constraints over 11 iterations in 175 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 202, 200, 201, 202, 199, 199, 200, 192, 196, 198, 196, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 60 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 3 ms. Remains 60 /80 variables (removed 20) and now considering 96/128 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 60/80 places, 96/128 transitions.
// Phase 1: matrix 96 rows 60 cols
[2023-03-21 22:20:10] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000072 steps, including 2 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 12) seen :2386
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 12) seen :844
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 842 ms. (steps per millisecond=1187 ) properties (out of 12) seen :779
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 12) seen :800
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 12) seen :734
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 12) seen :821
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 12) seen :804
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 12) seen :637
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 12) seen :800
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 12) seen :757
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 859 ms. (steps per millisecond=1164 ) properties (out of 12) seen :787
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 12) seen :795
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 12) seen :751
[2023-03-21 22:20:21] [INFO ] Invariant cache hit.
[2023-03-21 22:20:21] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:20:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:21] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:21] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-21 22:20:21] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-21 22:20:21] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:21] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:21] [INFO ] Added : 35 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 53 ms.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:22] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:22] [INFO ] Added : 36 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 39 ms.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 22 ms returned sat
[2023-03-21 22:20:22] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:20:22] [INFO ] Added : 38 causal constraints over 10 iterations in 102 ms. Result :sat
Minimization took 47 ms.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:22] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:22] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-21 22:20:22] [INFO ] Added : 29 causal constraints over 7 iterations in 119 ms. Result :sat
Minimization took 32 ms.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-21 22:20:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-21 22:20:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:23] [INFO ] Added : 38 causal constraints over 9 iterations in 94 ms. Result :sat
Minimization took 42 ms.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:20:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:20:23] [INFO ] Added : 34 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 33 ms.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-21 22:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-21 22:20:23] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:20:23] [INFO ] Added : 39 causal constraints over 10 iterations in 116 ms. Result :sat
Minimization took 24 ms.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-21 22:20:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:20:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:24] [INFO ] Added : 26 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 20 ms.
[2023-03-21 22:20:24] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:24] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-21 22:20:24] [INFO ] Added : 25 causal constraints over 6 iterations in 107 ms. Result :sat
Minimization took 29 ms.
[2023-03-21 22:20:24] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:20:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:20:24] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-21 22:20:24] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:20:24] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 3 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 3 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 4 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 3 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:26] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-21 22:20:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:20:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:32] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:33] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:34] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:35] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:41] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:42] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:46] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:47] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:50] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:56] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:56] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:57] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:58] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:20:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:20:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 67 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 38 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:03] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:21:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 29 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 43 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 35 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 37 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 41 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 34 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:21:07] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 49 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 60 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 61 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 45 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:21:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 33 ms
[2023-03-21 22:21:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 28 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 32 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2023-03-21 22:21:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-21 22:21:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
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-21 22:21:09] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:09] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-21 22:21:09] [INFO ] [Nat]Added 12 Read/Feed constraints in 23 ms returned sat
[2023-03-21 22:21:09] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-21 22:21:09] [INFO ] Added : 38 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 200, 201, 202, 200, 200, 202, 202, 201, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 55 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 55 /60 variables (removed 5) and now considering 88/96 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/60 places, 88/96 transitions.
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:10] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000056 steps, including 2 resets, run finished after 719 ms. (steps per millisecond=1390 ) properties (out of 11) seen :2193
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 11) seen :867
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 11) seen :754
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 11) seen :826
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 11) seen :751
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 11) seen :835
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 11) seen :645
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=1133 ) properties (out of 11) seen :815
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 11) seen :816
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 11) seen :837
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 11) seen :767
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 11) seen :815
[2023-03-21 22:21:20] [INFO ] Invariant cache hit.
[2023-03-21 22:21:20] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:20] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-21 22:21:20] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:20] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:20] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:21] [INFO ] Added : 31 causal constraints over 7 iterations in 46 ms. Result :sat
Minimization took 35 ms.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:21:21] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:21] [INFO ] Added : 31 causal constraints over 7 iterations in 128 ms. Result :sat
Minimization took 31 ms.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:21] [INFO ] Added : 32 causal constraints over 7 iterations in 65 ms. Result :sat
Minimization took 41 ms.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:21] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-21 22:21:21] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:21] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-21 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-21 22:21:22] [INFO ] Added : 39 causal constraints over 9 iterations in 154 ms. Result :sat
Minimization took 23 ms.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:21:22] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:22] [INFO ] Added : 16 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 25 ms.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:21:22] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:22] [INFO ] Added : 37 causal constraints over 8 iterations in 59 ms. Result :sat
Minimization took 41 ms.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-21 22:21:22] [INFO ] Added : 27 causal constraints over 6 iterations in 123 ms. Result :sat
Minimization took 21 ms.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-21 22:21:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-21 22:21:22] [INFO ] [Nat]Added 11 Read/Feed constraints in 22 ms returned sat
[2023-03-21 22:21:23] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:23] [INFO ] Added : 29 causal constraints over 6 iterations in 146 ms. Result :sat
Minimization took 21 ms.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-21 22:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-21 22:21:23] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:23] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-21 22:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2023-03-21 22:21:23] [INFO ] Added : 45 causal constraints over 9 iterations in 119 ms. Result :sat
Minimization took 30 ms.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-21 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2023-03-21 22:21:23] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:23] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-21 22:21:23] [INFO ] Added : 31 causal constraints over 7 iterations in 128 ms. Result :sat
Minimization took 23 ms.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 22:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-21 22:21:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:23] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:21:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-21 22:21:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-21 22:21:23] [INFO ] Added : 28 causal constraints over 7 iterations in 131 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 200, 201, 202, 200, 202, 202, 201, 202, 201]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-21 22:21:24] [INFO ] Invariant cache hit.
[2023-03-21 22:21:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 22:21:24] [INFO ] Invariant cache hit.
[2023-03-21 22:21:24] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-21 22:21:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:21:24] [INFO ] Invariant cache hit.
[2023-03-21 22:21:24] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 55/55 places, 88/88 transitions.
[2023-03-21 22:21:24] [INFO ] Invariant cache hit.
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 11) seen :2184
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 11) seen :823
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 869 ms. (steps per millisecond=1150 ) properties (out of 11) seen :734
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 11) seen :833
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 11) seen :733
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 11) seen :827
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 11) seen :648
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 11) seen :839
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 11) seen :850
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 11) seen :883
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 11) seen :834
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 11) seen :792
[2023-03-21 22:21:35] [INFO ] Invariant cache hit.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-21 22:21:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:35] [INFO ] Added : 31 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 37 ms.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:21:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:35] [INFO ] Added : 31 causal constraints over 7 iterations in 126 ms. Result :sat
Minimization took 31 ms.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:35] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-21 22:21:35] [INFO ] [Nat]Added 11 Read/Feed constraints in 18 ms returned sat
[2023-03-21 22:21:35] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-21 22:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-21 22:21:35] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:36] [INFO ] Added : 39 causal constraints over 9 iterations in 68 ms. Result :sat
Minimization took 23 ms.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:21:36] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-21 22:21:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-21 22:21:36] [INFO ] Added : 39 causal constraints over 9 iterations in 146 ms. Result :sat
Minimization took 22 ms.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:21:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:36] [INFO ] Added : 16 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 20 ms.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 22:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:21:36] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:36] [INFO ] Added : 37 causal constraints over 8 iterations in 62 ms. Result :sat
Minimization took 41 ms.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:36] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-21 22:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-21 22:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-21 22:21:37] [INFO ] Added : 27 causal constraints over 6 iterations in 111 ms. Result :sat
Minimization took 19 ms.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2023-03-21 22:21:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:21:37] [INFO ] Added : 29 causal constraints over 6 iterations in 151 ms. Result :sat
Minimization took 18 ms.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-21 22:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-21 22:21:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-21 22:21:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-21 22:21:37] [INFO ] Added : 45 causal constraints over 9 iterations in 120 ms. Result :sat
Minimization took 30 ms.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:37] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-21 22:21:37] [INFO ] [Nat]Added 11 Read/Feed constraints in 24 ms returned sat
[2023-03-21 22:21:37] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-21 22:21:38] [INFO ] Added : 31 causal constraints over 7 iterations in 127 ms. Result :sat
Minimization took 23 ms.
[2023-03-21 22:21:38] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:38] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:38] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-21 22:21:38] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:38] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2023-03-21 22:21:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-21 22:21:38] [INFO ] Added : 28 causal constraints over 7 iterations in 139 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 201, 201, 202, 200, 202, 202, 201, 202, 201]
Support contains 11 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 55/55 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
[2023-03-21 22:21:39] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
[2023-03-21 22:21:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-21 22:21:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
[2023-03-21 22:21:39] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 55/55 places, 88/88 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
Incomplete random walk after 10050 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1675 ) properties (out of 1) seen :151
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :104
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
[2023-03-21 22:21:39] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:39] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:39] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-21 22:21:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:39] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:39] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:39] [INFO ] Added : 29 causal constraints over 6 iterations in 140 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[151]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:39] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000066 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=9091 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :200
[2023-03-21 22:21:39] [INFO ] Invariant cache hit.
[2023-03-21 22:21:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:39] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 22:21:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-21 22:21:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-21 22:21:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-21 22:21:39] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-21 22:21:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8771 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :200
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:40] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 22:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:40] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2023-03-21 22:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-21 22:21:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 22:21:40] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:40] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-21 22:21:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 1323 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:40] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :143
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :140
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:40] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:40] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-21 22:21:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:40] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:40] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:40] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2023-03-21 22:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2023-03-21 22:21:40] [INFO ] Added : 31 causal constraints over 8 iterations in 118 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[143]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 22:21:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:40] [INFO ] Invariant cache hit.
Incomplete random walk after 1000050 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8197 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=4347 ) properties (out of 1) seen :201
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
[2023-03-21 22:21:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 22:21:41] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
[2023-03-21 22:21:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
[2023-03-21 22:21:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-21 22:21:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
[2023-03-21 22:21:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 922 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:41] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :104
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
[2023-03-21 22:21:41] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:41] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-21 22:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:41] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-21 22:21:41] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:41] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:41] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:41] [INFO ] Added : 34 causal constraints over 8 iterations in 79 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[104]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:41] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 22:21:41] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:41] [INFO ] Invariant cache hit.
Incomplete random walk after 1000016 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=8547 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7462 ) properties (out of 1) seen :200
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:42] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 22:21:42] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:42] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-21 22:21:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 5/5 places, 8/8 transitions.
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=8403 ) properties (out of 1) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :198
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 55 ms returned sat
[2023-03-21 22:21:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-21 22:21:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 1142 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:42] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10036 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 1) seen :159
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :140
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:42] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-21 22:21:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:42] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:42] [INFO ] Added : 31 causal constraints over 7 iterations in 79 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[159]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:42] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000026 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8695 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :201
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
[2023-03-21 22:21:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:43] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:43] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 22:21:43] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
[2023-03-21 22:21:43] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
[2023-03-21 22:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-21 22:21:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
[2023-03-21 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04 in 710 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:43] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 1) seen :100
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :108
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
[2023-03-21 22:21:43] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 22:21:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:43] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-21 22:21:43] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:43] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:21:43] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 22:21:43] [INFO ] Added : 51 causal constraints over 11 iterations in 104 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[108]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=8620 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=7352 ) properties (out of 1) seen :198
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:44] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-21 22:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2023-03-21 22:21:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 22:21:44] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-21 22:21:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 910 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:44] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10008 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :200
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-21 22:21:44] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:44] [INFO ] [Nat]Added 11 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:21:44] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 22:21:44] [INFO ] Added : 37 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:44] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000037 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=9009 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :200
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:44] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 22:21:44] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-21 22:21:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 694 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:44] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1429 ) properties (out of 1) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :12
[2023-03-21 22:21:44] [INFO ] Invariant cache hit.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:44] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-21 22:21:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 4 ms returned sat
[2023-03-21 22:21:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2023-03-21 22:21:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-21 22:21:45] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:45] [INFO ] Added : 37 causal constraints over 9 iterations in 96 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[103]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:45] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 22:21:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:45] [INFO ] Invariant cache hit.
Incomplete random walk after 1000028 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=8772 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :202
[2023-03-21 22:21:45] [INFO ] Invariant cache hit.
[2023-03-21 22:21:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:45] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:45] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2023-03-21 22:21:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-09 in 714 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:45] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10023 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1431 ) properties (out of 1) seen :141
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :8
[2023-03-21 22:21:45] [INFO ] Invariant cache hit.
[2023-03-21 22:21:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-21 22:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:45] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-21 22:21:45] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:21:45] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:45] [INFO ] Added : 35 causal constraints over 8 iterations in 106 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[141]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:46] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=8849 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :202
[2023-03-21 22:21:46] [INFO ] Invariant cache hit.
[2023-03-21 22:21:46] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:46] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:46] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-21 22:21:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 19 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-10 in 751 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:46] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 10052 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1116 ) properties (out of 1) seen :171
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :108
[2023-03-21 22:21:46] [INFO ] Invariant cache hit.
[2023-03-21 22:21:46] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-21 22:21:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:46] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-21 22:21:46] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 3 ms returned sat
[2023-03-21 22:21:46] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 22:21:46] [INFO ] Added : 44 causal constraints over 9 iterations in 135 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[171]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:46] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000029 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=9259 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=7462 ) properties (out of 1) seen :200
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:47] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:47] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-21 22:21:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:47] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-21 22:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-21 22:21:47] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 22:21:47] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 5 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:47] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:47] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-21 22:21:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:47] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11 in 901 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:47] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1252 ) properties (out of 1) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :7
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:47] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:47] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:47] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:47] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-21 22:21:47] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:47] [INFO ] [Nat]Added 11 Read/Feed constraints in 1 ms returned sat
[2023-03-21 22:21:47] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 22:21:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2023-03-21 22:21:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-21 22:21:47] [INFO ] Added : 32 causal constraints over 8 iterations in 108 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[102]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000007 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :199
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=6250 ) properties (out of 1) seen :202
[2023-03-21 22:21:47] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 22:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-21 22:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:48] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-21 22:21:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
Current structural bounds on expressions (after SMT) : [202] Max seen :[202]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-12 in 760 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 88 rows 55 cols
[2023-03-21 22:21:48] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :140
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-21 22:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-21 22:21:48] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-21 22:21:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 2 ms returned sat
[2023-03-21 22:21:48] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-21 22:21:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2023-03-21 22:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-21 22:21:48] [INFO ] Added : 28 causal constraints over 7 iterations in 148 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 5 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /55 variables (removed 50) and now considering 8/88 (removed 80) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-21 22:21:48] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 22:21:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 5/55 places, 8/88 transitions.
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
Incomplete random walk after 1000091 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=9175 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=6493 ) properties (out of 1) seen :201
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 22:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:21:48] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-21 22:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 22:21:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 22:21:48] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:21:48] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-21 22:21:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 22:21:48] [INFO ] Invariant cache hit.
[2023-03-21 22:21:48] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 781 ms.
[2023-03-21 22:21:48] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:21:48] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-21 22:21:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 55 places, 88 transitions and 231 arcs took 1 ms.
Total runtime 276737 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-0200
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
Upper Bounds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14114208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16102128 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 29 (type EXCL) for 3 JoinFreeModules-PT-0200-UpperBounds-01
lola: time limit : 360 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 21 (type FNDP) for 12 JoinFreeModules-PT-0200-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type EQUN) for 12 JoinFreeModules-PT-0200-UpperBounds-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 24 (type FNDP) for 6 JoinFreeModules-PT-0200-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 203
sara: try reading problem file /home/mcc/execution/377/UpperBounds-22.sara.
sara: warning, failure of lp_solve (at job 14)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 5/720 0/5 JoinFreeModules-PT-0200-UpperBounds-08 2920818 t fired, 3 attempts, .
22 BOUND STEQ 5/720 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 5/900 0/5 JoinFreeModules-PT-0200-UpperBounds-04 2474572 t fired, 3 attempts, .
29 BOUND EXCL 5/360 8/32 JoinFreeModules-PT-0200-UpperBounds-01 2311970 m, 462394 m/sec, 9246592 t fired, result in [201,203] .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 10/715 0/5 JoinFreeModules-PT-0200-UpperBounds-08 5455808 t fired, 6 attempts, .
22 BOUND STEQ 10/715 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 10/895 0/5 JoinFreeModules-PT-0200-UpperBounds-04 4858604 t fired, 5 attempts, .
29 BOUND EXCL 10/360 14/32 JoinFreeModules-PT-0200-UpperBounds-01 4050841 m, 347774 m/sec, 17290967 t fired, result in [201,203] .

Time elapsed: 10 secs. Pages in use: 14
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 15/710 0/5 JoinFreeModules-PT-0200-UpperBounds-08 7984375 t fired, 8 attempts, .
22 BOUND STEQ 15/710 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 15/890 0/5 JoinFreeModules-PT-0200-UpperBounds-04 7222147 t fired, 8 attempts, .
29 BOUND EXCL 15/360 19/32 JoinFreeModules-PT-0200-UpperBounds-01 5724664 m, 334764 m/sec, 25102944 t fired, result in [201,203] .

Time elapsed: 15 secs. Pages in use: 19
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 20/705 0/5 JoinFreeModules-PT-0200-UpperBounds-08 10421397 t fired, 11 attempts, .
22 BOUND STEQ 20/705 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 20/885 0/5 JoinFreeModules-PT-0200-UpperBounds-04 9571244 t fired, 10 attempts, .
29 BOUND EXCL 20/360 24/32 JoinFreeModules-PT-0200-UpperBounds-01 7196845 m, 294436 m/sec, 32040701 t fired, result in [201,203] .

Time elapsed: 20 secs. Pages in use: 24
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 25/700 0/5 JoinFreeModules-PT-0200-UpperBounds-08 12916806 t fired, 13 attempts, .
22 BOUND STEQ 25/700 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 25/880 0/5 JoinFreeModules-PT-0200-UpperBounds-04 11939331 t fired, 12 attempts, .
29 BOUND EXCL 25/360 29/32 JoinFreeModules-PT-0200-UpperBounds-01 8722542 m, 305139 m/sec, 39243292 t fired, result in [201,203] .

Time elapsed: 25 secs. Pages in use: 29
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 29 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 30/695 0/5 JoinFreeModules-PT-0200-UpperBounds-08 15457203 t fired, 16 attempts, .
22 BOUND STEQ 30/695 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 30/875 0/5 JoinFreeModules-PT-0200-UpperBounds-04 14288814 t fired, 15 attempts, .

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 41 (type EXCL) for 0 JoinFreeModules-PT-0200-UpperBounds-00
lola: time limit : 396 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 35/690 0/5 JoinFreeModules-PT-0200-UpperBounds-08 17961689 t fired, 18 attempts, .
22 BOUND STEQ 35/690 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 35/870 0/5 JoinFreeModules-PT-0200-UpperBounds-04 16623716 t fired, 17 attempts, .
41 BOUND EXCL 5/396 9/32 JoinFreeModules-PT-0200-UpperBounds-00 2767933 m, 553586 m/sec, 8633143 t fired, result in [202,203] .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 40/685 0/5 JoinFreeModules-PT-0200-UpperBounds-08 20448769 t fired, 21 attempts, .
22 BOUND STEQ 40/685 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 40/865 0/5 JoinFreeModules-PT-0200-UpperBounds-04 18952423 t fired, 19 attempts, .
41 BOUND EXCL 10/396 17/32 JoinFreeModules-PT-0200-UpperBounds-00 5138067 m, 474026 m/sec, 16211122 t fired, result in [202,203] .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 45/680 0/5 JoinFreeModules-PT-0200-UpperBounds-08 22937661 t fired, 23 attempts, .
22 BOUND STEQ 45/680 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 45/860 0/5 JoinFreeModules-PT-0200-UpperBounds-04 21284308 t fired, 22 attempts, .
41 BOUND EXCL 15/396 24/32 JoinFreeModules-PT-0200-UpperBounds-00 7345397 m, 441466 m/sec, 23310040 t fired, result in [202,203] .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 50/675 0/5 JoinFreeModules-PT-0200-UpperBounds-08 25394155 t fired, 26 attempts, .
22 BOUND STEQ 50/675 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 50/855 0/5 JoinFreeModules-PT-0200-UpperBounds-04 23606693 t fired, 24 attempts, .
41 BOUND EXCL 20/396 31/32 JoinFreeModules-PT-0200-UpperBounds-00 9547289 m, 440378 m/sec, 30409837 t fired, result in [202,203] .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 41 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 3 0 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 55/670 0/5 JoinFreeModules-PT-0200-UpperBounds-08 27975606 t fired, 28 attempts, .
22 BOUND STEQ 55/670 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 55/850 0/5 JoinFreeModules-PT-0200-UpperBounds-04 25932486 t fired, 26 attempts, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 38 (type EXCL) for 15 JoinFreeModules-PT-0200-UpperBounds-11
lola: time limit : 443 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 60/665 0/5 JoinFreeModules-PT-0200-UpperBounds-08 30307383 t fired, 31 attempts, .
22 BOUND STEQ 60/665 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 60/845 0/5 JoinFreeModules-PT-0200-UpperBounds-04 28252500 t fired, 29 attempts, .
38 BOUND EXCL 5/443 9/32 JoinFreeModules-PT-0200-UpperBounds-11 2624843 m, 524968 m/sec, 8179158 t fired, result in [202,203] .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 65/660 0/5 JoinFreeModules-PT-0200-UpperBounds-08 32662526 t fired, 33 attempts, .
22 BOUND STEQ 65/660 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 65/840 0/5 JoinFreeModules-PT-0200-UpperBounds-04 30578308 t fired, 31 attempts, .
38 BOUND EXCL 10/443 16/32 JoinFreeModules-PT-0200-UpperBounds-11 4815721 m, 438175 m/sec, 15174126 t fired, result in [202,203] .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 70/655 0/5 JoinFreeModules-PT-0200-UpperBounds-08 35078405 t fired, 36 attempts, .
22 BOUND STEQ 70/655 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 70/835 0/5 JoinFreeModules-PT-0200-UpperBounds-04 32883663 t fired, 33 attempts, .
38 BOUND EXCL 15/443 23/32 JoinFreeModules-PT-0200-UpperBounds-11 6866336 m, 410123 m/sec, 21766954 t fired, result in [202,203] .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 1 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 75/650 0/5 JoinFreeModules-PT-0200-UpperBounds-08 37546497 t fired, 38 attempts, .
22 BOUND STEQ 75/650 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 75/830 0/5 JoinFreeModules-PT-0200-UpperBounds-04 35196428 t fired, 36 attempts, .
38 BOUND EXCL 20/443 30/32 JoinFreeModules-PT-0200-UpperBounds-11 9028200 m, 432372 m/sec, 28742065 t fired, result in [202,203] .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 38 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 3 0 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 80/645 0/5 JoinFreeModules-PT-0200-UpperBounds-08 40129825 t fired, 41 attempts, .
22 BOUND STEQ 80/645 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 80/825 0/5 JoinFreeModules-PT-0200-UpperBounds-04 37593243 t fired, 38 attempts, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 35 (type EXCL) for 9 JoinFreeModules-PT-0200-UpperBounds-07
lola: time limit : 502 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 85/640 0/5 JoinFreeModules-PT-0200-UpperBounds-08 42540281 t fired, 43 attempts, .
22 BOUND STEQ 85/640 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 85/820 0/5 JoinFreeModules-PT-0200-UpperBounds-04 39907503 t fired, 40 attempts, .
35 BOUND EXCL 5/502 9/32 JoinFreeModules-PT-0200-UpperBounds-07 2746644 m, 549328 m/sec, 8565650 t fired, result in [202,203] .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 90/635 0/5 JoinFreeModules-PT-0200-UpperBounds-08 44932271 t fired, 45 attempts, .
22 BOUND STEQ 90/635 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 90/815 0/5 JoinFreeModules-PT-0200-UpperBounds-04 42235356 t fired, 43 attempts, .
35 BOUND EXCL 10/502 17/32 JoinFreeModules-PT-0200-UpperBounds-07 5059447 m, 462560 m/sec, 15958215 t fired, result in [202,203] .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 95/630 0/5 JoinFreeModules-PT-0200-UpperBounds-08 47377908 t fired, 48 attempts, .
22 BOUND STEQ 95/630 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 95/810 0/5 JoinFreeModules-PT-0200-UpperBounds-04 44554522 t fired, 45 attempts, .
35 BOUND EXCL 15/502 24/32 JoinFreeModules-PT-0200-UpperBounds-07 7327633 m, 453637 m/sec, 23253444 t fired, result in [202,203] .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 100/625 0/5 JoinFreeModules-PT-0200-UpperBounds-08 49879001 t fired, 50 attempts, .
22 BOUND STEQ 100/625 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 100/805 0/5 JoinFreeModules-PT-0200-UpperBounds-04 46865745 t fired, 47 attempts, .
35 BOUND EXCL 20/502 32/32 JoinFreeModules-PT-0200-UpperBounds-07 9633290 m, 461131 m/sec, 30693544 t fired, result in [202,203] .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 35 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 3 0 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 105/620 0/5 JoinFreeModules-PT-0200-UpperBounds-08 52488392 t fired, 53 attempts, .
22 BOUND STEQ 105/620 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 105/800 0/5 JoinFreeModules-PT-0200-UpperBounds-04 49179694 t fired, 50 attempts, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 32 (type EXCL) for 18 JoinFreeModules-PT-0200-UpperBounds-14
lola: time limit : 582 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 110/615 0/5 JoinFreeModules-PT-0200-UpperBounds-08 55053198 t fired, 56 attempts, .
22 BOUND STEQ 110/615 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 110/795 0/5 JoinFreeModules-PT-0200-UpperBounds-04 51514352 t fired, 52 attempts, .
32 BOUND EXCL 5/582 8/32 JoinFreeModules-PT-0200-UpperBounds-14 2219809 m, 443961 m/sec, 9542058 t fired, result in [201,203] .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 115/610 0/5 JoinFreeModules-PT-0200-UpperBounds-08 57563946 t fired, 58 attempts, .
22 BOUND STEQ 115/610 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 115/790 0/5 JoinFreeModules-PT-0200-UpperBounds-04 53830527 t fired, 54 attempts, .
32 BOUND EXCL 10/582 14/32 JoinFreeModules-PT-0200-UpperBounds-14 4091721 m, 374382 m/sec, 18042653 t fired, result in [201,203] .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 120/605 0/5 JoinFreeModules-PT-0200-UpperBounds-08 60068910 t fired, 61 attempts, .
22 BOUND STEQ 120/605 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 120/785 0/5 JoinFreeModules-PT-0200-UpperBounds-04 56150610 t fired, 57 attempts, .
32 BOUND EXCL 15/582 19/32 JoinFreeModules-PT-0200-UpperBounds-14 5811134 m, 343882 m/sec, 25966100 t fired, result in [201,203] .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 125/600 0/5 JoinFreeModules-PT-0200-UpperBounds-08 62494936 t fired, 63 attempts, .
22 BOUND STEQ 125/600 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 125/780 0/5 JoinFreeModules-PT-0200-UpperBounds-04 58474933 t fired, 59 attempts, .
32 BOUND EXCL 20/582 25/32 JoinFreeModules-PT-0200-UpperBounds-14 7381293 m, 314031 m/sec, 33258564 t fired, result in [201,203] .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 1 0 0 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 130/595 0/5 JoinFreeModules-PT-0200-UpperBounds-08 64897718 t fired, 65 attempts, .
22 BOUND STEQ 130/595 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 130/775 0/5 JoinFreeModules-PT-0200-UpperBounds-04 60804202 t fired, 61 attempts, .
32 BOUND EXCL 25/582 29/32 JoinFreeModules-PT-0200-UpperBounds-14 8887889 m, 301319 m/sec, 40275429 t fired, result in [201,203] .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 32 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 2 1 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 135/590 0/5 JoinFreeModules-PT-0200-UpperBounds-08 67431111 t fired, 68 attempts, .
22 BOUND STEQ 135/590 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 135/770 0/5 JoinFreeModules-PT-0200-UpperBounds-04 63122554 t fired, 64 attempts, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 26 (type EXCL) for 6 JoinFreeModules-PT-0200-UpperBounds-04
lola: time limit : 693 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 2 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 140/585 0/5 JoinFreeModules-PT-0200-UpperBounds-08 69941517 t fired, 70 attempts, .
22 BOUND STEQ 140/585 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 140/765 0/5 JoinFreeModules-PT-0200-UpperBounds-04 65433152 t fired, 66 attempts, .
26 BOUND EXCL 5/693 8/32 JoinFreeModules-PT-0200-UpperBounds-04 2379046 m, 475809 m/sec, 9550875 t fired, result in [201,203] .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 2 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 145/580 0/5 JoinFreeModules-PT-0200-UpperBounds-08 72431918 t fired, 73 attempts, .
22 BOUND STEQ 145/580 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 145/760 0/5 JoinFreeModules-PT-0200-UpperBounds-04 67737760 t fired, 68 attempts, .
26 BOUND EXCL 10/693 14/32 JoinFreeModules-PT-0200-UpperBounds-04 4221790 m, 368548 m/sec, 18095495 t fired, result in [201,203] .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 2 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 150/575 0/5 JoinFreeModules-PT-0200-UpperBounds-08 74890015 t fired, 75 attempts, .
22 BOUND STEQ 150/575 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 150/755 0/5 JoinFreeModules-PT-0200-UpperBounds-04 70047633 t fired, 71 attempts, .
26 BOUND EXCL 15/693 20/32 JoinFreeModules-PT-0200-UpperBounds-04 5890373 m, 333716 m/sec, 25885160 t fired, result in [201,203] .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 2 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 155/570 0/5 JoinFreeModules-PT-0200-UpperBounds-08 77363513 t fired, 78 attempts, .
22 BOUND STEQ 155/570 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 155/750 0/5 JoinFreeModules-PT-0200-UpperBounds-04 72370480 t fired, 73 attempts, .
26 BOUND EXCL 20/693 25/32 JoinFreeModules-PT-0200-UpperBounds-04 7478554 m, 317636 m/sec, 33379850 t fired, result in [201,203] .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 2 0 1 0 0 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 160/565 0/5 JoinFreeModules-PT-0200-UpperBounds-08 79824471 t fired, 80 attempts, .
22 BOUND STEQ 160/565 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 160/745 0/5 JoinFreeModules-PT-0200-UpperBounds-04 74694349 t fired, 75 attempts, .
26 BOUND EXCL 25/693 30/32 JoinFreeModules-PT-0200-UpperBounds-04 9021018 m, 308492 m/sec, 40663175 t fired, result in [201,203] .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 26 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 1 2 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 165/560 0/5 JoinFreeModules-PT-0200-UpperBounds-08 82330470 t fired, 83 attempts, .
22 BOUND STEQ 165/560 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 165/740 0/5 JoinFreeModules-PT-0200-UpperBounds-04 77010460 t fired, 78 attempts, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 23 (type EXCL) for 12 JoinFreeModules-PT-0200-UpperBounds-08
lola: time limit : 858 sec
lola: memory limit: 32 pages
lola: Structural Bound: 203
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 3 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 170/555 0/5 JoinFreeModules-PT-0200-UpperBounds-08 84831493 t fired, 85 attempts, .
22 BOUND STEQ 170/555 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
23 BOUND EXCL 5/858 11/32 JoinFreeModules-PT-0200-UpperBounds-08 3309174 m, 661834 m/sec, 8459787 t fired, result in [200,203] .
24 BOUND FNDP 170/735 0/5 JoinFreeModules-PT-0200-UpperBounds-04 79340945 t fired, 80 attempts, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 3 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 175/550 0/5 JoinFreeModules-PT-0200-UpperBounds-08 87344465 t fired, 88 attempts, .
22 BOUND STEQ 175/550 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
23 BOUND EXCL 10/858 19/32 JoinFreeModules-PT-0200-UpperBounds-08 5762185 m, 490602 m/sec, 17013057 t fired, result in [200,203] .
24 BOUND FNDP 175/730 0/5 JoinFreeModules-PT-0200-UpperBounds-04 81677445 t fired, 82 attempts, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 3 0 0 0 0 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 180/545 0/5 JoinFreeModules-PT-0200-UpperBounds-08 89814031 t fired, 90 attempts, .
22 BOUND STEQ 180/545 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
23 BOUND EXCL 15/858 28/32 JoinFreeModules-PT-0200-UpperBounds-08 8278949 m, 503352 m/sec, 25813064 t fired, result in [200,203] .
24 BOUND FNDP 180/725 0/5 JoinFreeModules-PT-0200-UpperBounds-04 84004336 t fired, 85 attempts, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 23 (type EXCL) for JoinFreeModules-PT-0200-UpperBounds-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 185/540 0/5 JoinFreeModules-PT-0200-UpperBounds-08 92305635 t fired, 93 attempts, .
22 BOUND STEQ 185/540 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 185/720 0/5 JoinFreeModules-PT-0200-UpperBounds-04 86341259 t fired, 87 attempts, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 27 (type FNDP) for 3 JoinFreeModules-PT-0200-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 190/1015 0/5 JoinFreeModules-PT-0200-UpperBounds-08 94125318 t fired, 95 attempts, .
22 BOUND STEQ 190/715 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 190/1015 0/5 JoinFreeModules-PT-0200-UpperBounds-04 88181613 t fired, 89 attempts, .
27 BOUND FNDP 5/853 0/5 JoinFreeModules-PT-0200-UpperBounds-01 2132569 t fired, 3 attempts, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 195/1010 0/5 JoinFreeModules-PT-0200-UpperBounds-08 95952342 t fired, 96 attempts, .
22 BOUND STEQ 195/710 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 195/1010 0/5 JoinFreeModules-PT-0200-UpperBounds-04 90013221 t fired, 91 attempts, .
27 BOUND FNDP 10/848 0/5 JoinFreeModules-PT-0200-UpperBounds-01 4229052 t fired, 5 attempts, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 200/1005 0/5 JoinFreeModules-PT-0200-UpperBounds-08 97777816 t fired, 98 attempts, .
22 BOUND STEQ 200/705 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 200/1005 0/5 JoinFreeModules-PT-0200-UpperBounds-04 91846941 t fired, 92 attempts, .
27 BOUND FNDP 15/843 0/5 JoinFreeModules-PT-0200-UpperBounds-01 6339103 t fired, 7 attempts, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 205/1000 0/5 JoinFreeModules-PT-0200-UpperBounds-08 99608390 t fired, 100 attempts, .
22 BOUND STEQ 205/700 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 205/1000 0/5 JoinFreeModules-PT-0200-UpperBounds-04 93686084 t fired, 94 attempts, .
27 BOUND FNDP 20/838 0/5 JoinFreeModules-PT-0200-UpperBounds-01 8442558 t fired, 9 attempts, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 210/995 0/5 JoinFreeModules-PT-0200-UpperBounds-08 101412401 t fired, 102 attempts, .
22 BOUND STEQ 210/695 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 210/995 0/5 JoinFreeModules-PT-0200-UpperBounds-04 95523276 t fired, 96 attempts, .
27 BOUND FNDP 25/833 0/5 JoinFreeModules-PT-0200-UpperBounds-01 10541820 t fired, 11 attempts, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 215/990 0/5 JoinFreeModules-PT-0200-UpperBounds-08 103274892 t fired, 104 attempts, .
22 BOUND STEQ 215/690 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 215/990 0/5 JoinFreeModules-PT-0200-UpperBounds-04 97373683 t fired, 98 attempts, .
27 BOUND FNDP 30/828 0/5 JoinFreeModules-PT-0200-UpperBounds-01 12647335 t fired, 13 attempts, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 220/985 0/5 JoinFreeModules-PT-0200-UpperBounds-08 105131213 t fired, 106 attempts, .
22 BOUND STEQ 220/685 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 220/985 0/5 JoinFreeModules-PT-0200-UpperBounds-04 99212165 t fired, 100 attempts, .
27 BOUND FNDP 35/823 0/5 JoinFreeModules-PT-0200-UpperBounds-01 14753793 t fired, 15 attempts, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 225/980 0/5 JoinFreeModules-PT-0200-UpperBounds-08 106985618 t fired, 107 attempts, .
22 BOUND STEQ 225/680 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 225/980 0/5 JoinFreeModules-PT-0200-UpperBounds-04 101049945 t fired, 102 attempts, .
27 BOUND FNDP 40/818 0/5 JoinFreeModules-PT-0200-UpperBounds-01 16851325 t fired, 17 attempts, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 230/975 0/5 JoinFreeModules-PT-0200-UpperBounds-08 108834480 t fired, 109 attempts, .
22 BOUND STEQ 230/675 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 230/975 0/5 JoinFreeModules-PT-0200-UpperBounds-04 102886722 t fired, 103 attempts, .
27 BOUND FNDP 45/813 0/5 JoinFreeModules-PT-0200-UpperBounds-01 18956027 t fired, 19 attempts, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 235/970 0/5 JoinFreeModules-PT-0200-UpperBounds-08 110686503 t fired, 111 attempts, .
22 BOUND STEQ 235/670 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 235/970 0/5 JoinFreeModules-PT-0200-UpperBounds-04 104731787 t fired, 105 attempts, .
27 BOUND FNDP 50/808 0/5 JoinFreeModules-PT-0200-UpperBounds-01 21063424 t fired, 22 attempts, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 240/965 0/5 JoinFreeModules-PT-0200-UpperBounds-08 112540547 t fired, 113 attempts, .
22 BOUND STEQ 240/665 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 240/965 0/5 JoinFreeModules-PT-0200-UpperBounds-04 106575620 t fired, 107 attempts, .
27 BOUND FNDP 55/803 0/5 JoinFreeModules-PT-0200-UpperBounds-01 23173408 t fired, 24 attempts, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 245/960 0/5 JoinFreeModules-PT-0200-UpperBounds-08 114229975 t fired, 115 attempts, .
22 BOUND STEQ 245/660 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 245/960 0/5 JoinFreeModules-PT-0200-UpperBounds-04 108389406 t fired, 109 attempts, .
27 BOUND FNDP 60/798 0/5 JoinFreeModules-PT-0200-UpperBounds-01 25243697 t fired, 26 attempts, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 250/955 0/5 JoinFreeModules-PT-0200-UpperBounds-08 115055514 t fired, 116 attempts, .
22 BOUND STEQ 250/655 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 250/955 0/5 JoinFreeModules-PT-0200-UpperBounds-04 110122638 t fired, 111 attempts, .
27 BOUND FNDP 65/793 0/5 JoinFreeModules-PT-0200-UpperBounds-01 27106755 t fired, 28 attempts, .

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 255/950 0/5 JoinFreeModules-PT-0200-UpperBounds-08 115873189 t fired, 116 attempts, .
22 BOUND STEQ 255/650 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 255/950 0/5 JoinFreeModules-PT-0200-UpperBounds-04 111922099 t fired, 112 attempts, .
27 BOUND FNDP 70/788 0/5 JoinFreeModules-PT-0200-UpperBounds-01 29117682 t fired, 30 attempts, .

Time elapsed: 255 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 260/945 0/5 JoinFreeModules-PT-0200-UpperBounds-08 116699535 t fired, 117 attempts, .
22 BOUND STEQ 260/645 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 260/945 0/5 JoinFreeModules-PT-0200-UpperBounds-04 113912217 t fired, 114 attempts, .
27 BOUND FNDP 75/783 0/5 JoinFreeModules-PT-0200-UpperBounds-01 31014821 t fired, 32 attempts, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 265/940 0/5 JoinFreeModules-PT-0200-UpperBounds-08 117475345 t fired, 118 attempts, .
22 BOUND STEQ 265/640 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 265/940 0/5 JoinFreeModules-PT-0200-UpperBounds-04 115696321 t fired, 116 attempts, .
27 BOUND FNDP 80/778 0/5 JoinFreeModules-PT-0200-UpperBounds-01 33021892 t fired, 34 attempts, .

Time elapsed: 265 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 270/935 0/5 JoinFreeModules-PT-0200-UpperBounds-08 118289846 t fired, 119 attempts, .
22 BOUND STEQ 270/635 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 270/935 0/5 JoinFreeModules-PT-0200-UpperBounds-04 117434208 t fired, 118 attempts, .
27 BOUND FNDP 85/773 0/5 JoinFreeModules-PT-0200-UpperBounds-01 34900454 t fired, 35 attempts, .

Time elapsed: 270 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 275/930 0/5 JoinFreeModules-PT-0200-UpperBounds-08 119069657 t fired, 120 attempts, .
22 BOUND STEQ 275/630 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 275/930 0/5 JoinFreeModules-PT-0200-UpperBounds-04 119276260 t fired, 120 attempts, .
27 BOUND FNDP 90/768 0/5 JoinFreeModules-PT-0200-UpperBounds-01 36890460 t fired, 37 attempts, .

Time elapsed: 275 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 280/925 0/5 JoinFreeModules-PT-0200-UpperBounds-08 119898411 t fired, 120 attempts, .
22 BOUND STEQ 280/625 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 280/925 0/5 JoinFreeModules-PT-0200-UpperBounds-04 121029726 t fired, 122 attempts, .
27 BOUND FNDP 95/763 0/5 JoinFreeModules-PT-0200-UpperBounds-01 38860915 t fired, 39 attempts, .

Time elapsed: 280 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 285/920 0/5 JoinFreeModules-PT-0200-UpperBounds-08 121163617 t fired, 122 attempts, .
22 BOUND STEQ 285/620 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 285/920 0/5 JoinFreeModules-PT-0200-UpperBounds-04 122760038 t fired, 123 attempts, .
27 BOUND FNDP 100/758 0/5 JoinFreeModules-PT-0200-UpperBounds-01 40365059 t fired, 41 attempts, .

Time elapsed: 285 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 290/915 0/5 JoinFreeModules-PT-0200-UpperBounds-08 123076644 t fired, 124 attempts, .
22 BOUND STEQ 290/615 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 290/915 0/5 JoinFreeModules-PT-0200-UpperBounds-04 124409246 t fired, 125 attempts, .
27 BOUND FNDP 105/753 0/5 JoinFreeModules-PT-0200-UpperBounds-01 41278263 t fired, 42 attempts, .

Time elapsed: 290 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 295/910 0/5 JoinFreeModules-PT-0200-UpperBounds-08 124954682 t fired, 125 attempts, .
22 BOUND STEQ 295/610 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 295/910 0/5 JoinFreeModules-PT-0200-UpperBounds-04 126220394 t fired, 127 attempts, .
27 BOUND FNDP 110/748 0/5 JoinFreeModules-PT-0200-UpperBounds-01 42146997 t fired, 43 attempts, .

Time elapsed: 295 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 300/905 0/5 JoinFreeModules-PT-0200-UpperBounds-08 126792025 t fired, 127 attempts, .
22 BOUND STEQ 300/605 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 300/905 0/5 JoinFreeModules-PT-0200-UpperBounds-04 128005703 t fired, 129 attempts, .
27 BOUND FNDP 115/743 0/5 JoinFreeModules-PT-0200-UpperBounds-01 43069485 t fired, 44 attempts, .

Time elapsed: 300 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 305/900 0/5 JoinFreeModules-PT-0200-UpperBounds-08 128787097 t fired, 129 attempts, .
22 BOUND STEQ 305/600 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 305/900 0/5 JoinFreeModules-PT-0200-UpperBounds-04 129675907 t fired, 130 attempts, .
27 BOUND FNDP 120/738 0/5 JoinFreeModules-PT-0200-UpperBounds-01 43934160 t fired, 44 attempts, .

Time elapsed: 305 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 310/895 0/5 JoinFreeModules-PT-0200-UpperBounds-08 130769938 t fired, 131 attempts, .
22 BOUND STEQ 310/595 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 310/895 0/5 JoinFreeModules-PT-0200-UpperBounds-04 131311217 t fired, 132 attempts, .
27 BOUND FNDP 125/733 0/5 JoinFreeModules-PT-0200-UpperBounds-01 44845699 t fired, 45 attempts, .

Time elapsed: 310 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 315/890 0/5 JoinFreeModules-PT-0200-UpperBounds-08 132769634 t fired, 133 attempts, .
22 BOUND STEQ 315/590 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 315/890 0/5 JoinFreeModules-PT-0200-UpperBounds-04 133095008 t fired, 134 attempts, .
27 BOUND FNDP 130/728 0/5 JoinFreeModules-PT-0200-UpperBounds-01 45709328 t fired, 46 attempts, .

Time elapsed: 315 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 320/885 0/5 JoinFreeModules-PT-0200-UpperBounds-08 134731409 t fired, 135 attempts, .
22 BOUND STEQ 320/585 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 320/885 0/5 JoinFreeModules-PT-0200-UpperBounds-04 134839501 t fired, 135 attempts, .
27 BOUND FNDP 135/723 0/5 JoinFreeModules-PT-0200-UpperBounds-01 46615308 t fired, 47 attempts, .

Time elapsed: 320 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 325/880 0/5 JoinFreeModules-PT-0200-UpperBounds-08 136624701 t fired, 137 attempts, .
22 BOUND STEQ 325/580 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 325/880 0/5 JoinFreeModules-PT-0200-UpperBounds-04 136477265 t fired, 137 attempts, .
27 BOUND FNDP 140/718 0/5 JoinFreeModules-PT-0200-UpperBounds-01 47513156 t fired, 48 attempts, .

Time elapsed: 325 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 330/875 0/5 JoinFreeModules-PT-0200-UpperBounds-08 138564137 t fired, 139 attempts, .
22 BOUND STEQ 330/575 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 330/875 0/5 JoinFreeModules-PT-0200-UpperBounds-04 138197510 t fired, 139 attempts, .
27 BOUND FNDP 145/713 0/5 JoinFreeModules-PT-0200-UpperBounds-01 48379963 t fired, 49 attempts, .

Time elapsed: 330 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 335/870 0/5 JoinFreeModules-PT-0200-UpperBounds-08 140372035 t fired, 141 attempts, .
22 BOUND STEQ 335/570 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 335/870 0/5 JoinFreeModules-PT-0200-UpperBounds-04 140078186 t fired, 141 attempts, .
27 BOUND FNDP 150/708 0/5 JoinFreeModules-PT-0200-UpperBounds-01 49287262 t fired, 50 attempts, .

Time elapsed: 335 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 340/865 0/5 JoinFreeModules-PT-0200-UpperBounds-08 142244923 t fired, 143 attempts, .
22 BOUND STEQ 340/565 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 340/865 0/5 JoinFreeModules-PT-0200-UpperBounds-04 141800974 t fired, 142 attempts, .
27 BOUND FNDP 155/703 0/5 JoinFreeModules-PT-0200-UpperBounds-01 50166958 t fired, 51 attempts, .

Time elapsed: 340 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 345/860 0/5 JoinFreeModules-PT-0200-UpperBounds-08 144311761 t fired, 145 attempts, .
22 BOUND STEQ 345/560 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 345/860 0/5 JoinFreeModules-PT-0200-UpperBounds-04 143502708 t fired, 144 attempts, .
27 BOUND FNDP 160/698 0/5 JoinFreeModules-PT-0200-UpperBounds-01 51080899 t fired, 52 attempts, .

Time elapsed: 345 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 350/855 0/5 JoinFreeModules-PT-0200-UpperBounds-08 146227746 t fired, 147 attempts, .
22 BOUND STEQ 350/555 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 350/855 0/5 JoinFreeModules-PT-0200-UpperBounds-04 145164964 t fired, 146 attempts, .
27 BOUND FNDP 165/693 0/5 JoinFreeModules-PT-0200-UpperBounds-01 51955687 t fired, 52 attempts, .

Time elapsed: 350 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 355/850 0/5 JoinFreeModules-PT-0200-UpperBounds-08 148051746 t fired, 149 attempts, .
22 BOUND STEQ 355/550 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 355/850 0/5 JoinFreeModules-PT-0200-UpperBounds-04 146869248 t fired, 147 attempts, .
27 BOUND FNDP 170/688 0/5 JoinFreeModules-PT-0200-UpperBounds-01 52872219 t fired, 53 attempts, .

Time elapsed: 355 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 360/845 0/5 JoinFreeModules-PT-0200-UpperBounds-08 149963360 t fired, 150 attempts, .
22 BOUND STEQ 360/545 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 360/845 0/5 JoinFreeModules-PT-0200-UpperBounds-04 148579348 t fired, 149 attempts, .
27 BOUND FNDP 175/683 0/5 JoinFreeModules-PT-0200-UpperBounds-01 53740696 t fired, 54 attempts, .

Time elapsed: 360 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 365/840 0/5 JoinFreeModules-PT-0200-UpperBounds-08 151786002 t fired, 152 attempts, .
22 BOUND STEQ 365/540 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 365/840 0/5 JoinFreeModules-PT-0200-UpperBounds-04 150211988 t fired, 151 attempts, .
27 BOUND FNDP 180/678 0/5 JoinFreeModules-PT-0200-UpperBounds-01 54654806 t fired, 55 attempts, .

Time elapsed: 365 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 370/835 0/5 JoinFreeModules-PT-0200-UpperBounds-08 153641301 t fired, 154 attempts, .
22 BOUND STEQ 370/535 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 370/835 0/5 JoinFreeModules-PT-0200-UpperBounds-04 152074653 t fired, 153 attempts, .
27 BOUND FNDP 185/673 0/5 JoinFreeModules-PT-0200-UpperBounds-01 55513629 t fired, 56 attempts, .

Time elapsed: 370 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 375/830 0/5 JoinFreeModules-PT-0200-UpperBounds-08 155480488 t fired, 156 attempts, .
22 BOUND STEQ 375/530 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 375/830 0/5 JoinFreeModules-PT-0200-UpperBounds-04 153815822 t fired, 154 attempts, .
27 BOUND FNDP 190/668 0/5 JoinFreeModules-PT-0200-UpperBounds-01 56434688 t fired, 57 attempts, .

Time elapsed: 375 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 380/825 0/5 JoinFreeModules-PT-0200-UpperBounds-08 157372552 t fired, 158 attempts, .
22 BOUND STEQ 380/525 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 380/825 0/5 JoinFreeModules-PT-0200-UpperBounds-04 155533209 t fired, 156 attempts, .
27 BOUND FNDP 195/663 0/5 JoinFreeModules-PT-0200-UpperBounds-01 57315229 t fired, 58 attempts, .

Time elapsed: 380 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 385/820 0/5 JoinFreeModules-PT-0200-UpperBounds-08 159218111 t fired, 160 attempts, .
22 BOUND STEQ 385/520 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 385/820 0/5 JoinFreeModules-PT-0200-UpperBounds-04 157258773 t fired, 158 attempts, .
27 BOUND FNDP 200/658 0/5 JoinFreeModules-PT-0200-UpperBounds-01 58240052 t fired, 59 attempts, .

Time elapsed: 385 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 390/815 0/5 JoinFreeModules-PT-0200-UpperBounds-08 161127567 t fired, 162 attempts, .
22 BOUND STEQ 390/515 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 390/815 0/5 JoinFreeModules-PT-0200-UpperBounds-04 158930801 t fired, 159 attempts, .
27 BOUND FNDP 205/653 0/5 JoinFreeModules-PT-0200-UpperBounds-01 59111194 t fired, 60 attempts, .

Time elapsed: 390 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 395/810 0/5 JoinFreeModules-PT-0200-UpperBounds-08 162970398 t fired, 163 attempts, .
22 BOUND STEQ 395/510 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 395/810 0/5 JoinFreeModules-PT-0200-UpperBounds-04 160650323 t fired, 161 attempts, .
27 BOUND FNDP 210/648 0/5 JoinFreeModules-PT-0200-UpperBounds-01 60035076 t fired, 61 attempts, .

Time elapsed: 395 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 400/805 0/5 JoinFreeModules-PT-0200-UpperBounds-08 164854830 t fired, 165 attempts, .
22 BOUND STEQ 400/505 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 400/805 0/5 JoinFreeModules-PT-0200-UpperBounds-04 162464884 t fired, 163 attempts, .
27 BOUND FNDP 215/643 0/5 JoinFreeModules-PT-0200-UpperBounds-01 60902592 t fired, 61 attempts, .

Time elapsed: 400 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 405/800 0/5 JoinFreeModules-PT-0200-UpperBounds-08 166693478 t fired, 167 attempts, .
22 BOUND STEQ 405/500 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 405/800 0/5 JoinFreeModules-PT-0200-UpperBounds-04 164350990 t fired, 165 attempts, .
27 BOUND FNDP 220/638 0/5 JoinFreeModules-PT-0200-UpperBounds-01 61824589 t fired, 62 attempts, .

Time elapsed: 405 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 410/795 0/5 JoinFreeModules-PT-0200-UpperBounds-08 168585237 t fired, 169 attempts, .
22 BOUND STEQ 410/495 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 410/795 0/5 JoinFreeModules-PT-0200-UpperBounds-04 166086141 t fired, 167 attempts, .
27 BOUND FNDP 225/633 0/5 JoinFreeModules-PT-0200-UpperBounds-01 62875817 t fired, 63 attempts, .

Time elapsed: 410 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 415/790 0/5 JoinFreeModules-PT-0200-UpperBounds-08 170360085 t fired, 171 attempts, .
22 BOUND STEQ 415/490 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 415/790 0/5 JoinFreeModules-PT-0200-UpperBounds-04 167887548 t fired, 168 attempts, .
27 BOUND FNDP 230/628 0/5 JoinFreeModules-PT-0200-UpperBounds-01 64881343 t fired, 65 attempts, .

Time elapsed: 415 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 420/785 0/5 JoinFreeModules-PT-0200-UpperBounds-08 172242753 t fired, 173 attempts, .
22 BOUND STEQ 420/485 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 420/785 0/5 JoinFreeModules-PT-0200-UpperBounds-04 169797146 t fired, 170 attempts, .
27 BOUND FNDP 235/623 0/5 JoinFreeModules-PT-0200-UpperBounds-01 66890793 t fired, 67 attempts, .

Time elapsed: 420 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 425/780 0/5 JoinFreeModules-PT-0200-UpperBounds-08 174077848 t fired, 175 attempts, .
22 BOUND STEQ 425/480 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 425/780 0/5 JoinFreeModules-PT-0200-UpperBounds-04 171529316 t fired, 172 attempts, .
27 BOUND FNDP 240/618 0/5 JoinFreeModules-PT-0200-UpperBounds-01 67852742 t fired, 68 attempts, .

Time elapsed: 425 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 430/775 0/5 JoinFreeModules-PT-0200-UpperBounds-08 176030683 t fired, 177 attempts, .
22 BOUND STEQ 430/475 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 430/775 0/5 JoinFreeModules-PT-0200-UpperBounds-04 173394795 t fired, 174 attempts, .
27 BOUND FNDP 245/613 0/5 JoinFreeModules-PT-0200-UpperBounds-01 68703976 t fired, 69 attempts, .

Time elapsed: 430 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 435/770 0/5 JoinFreeModules-PT-0200-UpperBounds-08 177925969 t fired, 178 attempts, .
22 BOUND STEQ 435/470 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 435/770 0/5 JoinFreeModules-PT-0200-UpperBounds-04 175068763 t fired, 176 attempts, .
27 BOUND FNDP 250/608 0/5 JoinFreeModules-PT-0200-UpperBounds-01 69616419 t fired, 70 attempts, .

Time elapsed: 435 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 440/765 0/5 JoinFreeModules-PT-0200-UpperBounds-08 179744426 t fired, 180 attempts, .
22 BOUND STEQ 440/465 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 440/765 0/5 JoinFreeModules-PT-0200-UpperBounds-04 176901063 t fired, 177 attempts, .
27 BOUND FNDP 255/603 0/5 JoinFreeModules-PT-0200-UpperBounds-01 70490812 t fired, 71 attempts, .

Time elapsed: 441 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 446/759 0/5 JoinFreeModules-PT-0200-UpperBounds-08 181650172 t fired, 182 attempts, .
22 BOUND STEQ 446/459 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 446/759 0/5 JoinFreeModules-PT-0200-UpperBounds-04 178656405 t fired, 179 attempts, .
27 BOUND FNDP 261/597 0/5 JoinFreeModules-PT-0200-UpperBounds-01 71371429 t fired, 72 attempts, .

Time elapsed: 446 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 2 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 451/754 0/5 JoinFreeModules-PT-0200-UpperBounds-08 183566154 t fired, 184 attempts, .
22 BOUND STEQ 451/454 0/5 JoinFreeModules-PT-0200-UpperBounds-08 --
24 BOUND FNDP 451/754 0/5 JoinFreeModules-PT-0200-UpperBounds-04 180357473 t fired, 181 attempts, .
27 BOUND FNDP 266/592 0/5 JoinFreeModules-PT-0200-UpperBounds-01 72275579 t fired, 73 attempts, .

Time elapsed: 451 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 22 (type EQUN) for JoinFreeModules-PT-0200-UpperBounds-08 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 0 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 2 0 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 456/749 0/5 JoinFreeModules-PT-0200-UpperBounds-08 185770049 t fired, 186 attempts, .
24 BOUND FNDP 456/749 0/5 JoinFreeModules-PT-0200-UpperBounds-04 182055355 t fired, 183 attempts, .
27 BOUND FNDP 271/587 0/5 JoinFreeModules-PT-0200-UpperBounds-01 73135805 t fired, 74 attempts, .

Time elapsed: 456 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 30 (type FNDP) for 18 JoinFreeModules-PT-0200-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 22 (type EQUN) for JoinFreeModules-PT-0200-UpperBounds-08
lola: result : unknown
lola: time used : 456.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 461/744 0/5 JoinFreeModules-PT-0200-UpperBounds-08 186864832 t fired, 187 attempts, .
24 BOUND FNDP 461/744 0/5 JoinFreeModules-PT-0200-UpperBounds-04 183132364 t fired, 184 attempts, .
27 BOUND FNDP 276/867 0/5 JoinFreeModules-PT-0200-UpperBounds-01 74019072 t fired, 75 attempts, .
30 BOUND FNDP 5/786 0/5 JoinFreeModules-PT-0200-UpperBounds-14 885220 t fired, 1 attempts, .

Time elapsed: 461 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 466/739 0/5 JoinFreeModules-PT-0200-UpperBounds-08 187962987 t fired, 188 attempts, .
24 BOUND FNDP 466/739 0/5 JoinFreeModules-PT-0200-UpperBounds-04 184180387 t fired, 185 attempts, .
27 BOUND FNDP 281/862 0/5 JoinFreeModules-PT-0200-UpperBounds-01 74931530 t fired, 75 attempts, .
30 BOUND FNDP 10/781 0/5 JoinFreeModules-PT-0200-UpperBounds-14 1784620 t fired, 2 attempts, .

Time elapsed: 466 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 471/734 0/5 JoinFreeModules-PT-0200-UpperBounds-08 188998623 t fired, 189 attempts, .
24 BOUND FNDP 471/734 0/5 JoinFreeModules-PT-0200-UpperBounds-04 185235035 t fired, 186 attempts, .
27 BOUND FNDP 286/857 0/5 JoinFreeModules-PT-0200-UpperBounds-01 75828936 t fired, 76 attempts, .
30 BOUND FNDP 15/776 0/5 JoinFreeModules-PT-0200-UpperBounds-14 2695588 t fired, 3 attempts, .

Time elapsed: 471 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 476/729 0/5 JoinFreeModules-PT-0200-UpperBounds-08 190023987 t fired, 191 attempts, .
24 BOUND FNDP 476/729 0/5 JoinFreeModules-PT-0200-UpperBounds-04 186303542 t fired, 187 attempts, .
27 BOUND FNDP 291/852 0/5 JoinFreeModules-PT-0200-UpperBounds-01 76739727 t fired, 77 attempts, .
30 BOUND FNDP 20/771 0/5 JoinFreeModules-PT-0200-UpperBounds-14 3591882 t fired, 4 attempts, .

Time elapsed: 476 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 481/724 0/5 JoinFreeModules-PT-0200-UpperBounds-08 191049202 t fired, 192 attempts, .
24 BOUND FNDP 481/724 0/5 JoinFreeModules-PT-0200-UpperBounds-04 187370497 t fired, 188 attempts, .
27 BOUND FNDP 296/847 0/5 JoinFreeModules-PT-0200-UpperBounds-01 77715832 t fired, 78 attempts, .
30 BOUND FNDP 25/766 0/5 JoinFreeModules-PT-0200-UpperBounds-14 4487419 t fired, 5 attempts, .

Time elapsed: 481 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 486/719 0/5 JoinFreeModules-PT-0200-UpperBounds-08 192062403 t fired, 193 attempts, .
24 BOUND FNDP 486/719 0/5 JoinFreeModules-PT-0200-UpperBounds-04 188422845 t fired, 189 attempts, .
27 BOUND FNDP 301/842 0/5 JoinFreeModules-PT-0200-UpperBounds-01 78623586 t fired, 79 attempts, .
30 BOUND FNDP 30/761 0/5 JoinFreeModules-PT-0200-UpperBounds-14 5370461 t fired, 6 attempts, .

Time elapsed: 486 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 491/714 0/5 JoinFreeModules-PT-0200-UpperBounds-08 193095196 t fired, 194 attempts, .
24 BOUND FNDP 491/714 0/5 JoinFreeModules-PT-0200-UpperBounds-04 189501752 t fired, 190 attempts, .
27 BOUND FNDP 306/837 0/5 JoinFreeModules-PT-0200-UpperBounds-01 79538793 t fired, 80 attempts, .
30 BOUND FNDP 35/756 0/5 JoinFreeModules-PT-0200-UpperBounds-14 6266833 t fired, 7 attempts, .

Time elapsed: 491 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 496/709 0/5 JoinFreeModules-PT-0200-UpperBounds-08 193969338 t fired, 194 attempts, .
24 BOUND FNDP 496/709 0/5 JoinFreeModules-PT-0200-UpperBounds-04 190450772 t fired, 191 attempts, .
27 BOUND FNDP 311/832 0/5 JoinFreeModules-PT-0200-UpperBounds-01 80503782 t fired, 81 attempts, .
30 BOUND FNDP 40/751 0/5 JoinFreeModules-PT-0200-UpperBounds-14 7217583 t fired, 8 attempts, .

Time elapsed: 496 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 501/704 0/5 JoinFreeModules-PT-0200-UpperBounds-08 194760266 t fired, 195 attempts, .
24 BOUND FNDP 501/704 0/5 JoinFreeModules-PT-0200-UpperBounds-04 191429185 t fired, 192 attempts, .
27 BOUND FNDP 316/827 0/5 JoinFreeModules-PT-0200-UpperBounds-01 81604221 t fired, 82 attempts, .
30 BOUND FNDP 45/746 0/5 JoinFreeModules-PT-0200-UpperBounds-14 8023652 t fired, 9 attempts, .

Time elapsed: 501 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 506/699 0/5 JoinFreeModules-PT-0200-UpperBounds-08 195444242 t fired, 196 attempts, .
24 BOUND FNDP 506/699 0/5 JoinFreeModules-PT-0200-UpperBounds-04 192158900 t fired, 193 attempts, .
27 BOUND FNDP 321/822 0/5 JoinFreeModules-PT-0200-UpperBounds-01 82905913 t fired, 83 attempts, .
30 BOUND FNDP 50/741 0/5 JoinFreeModules-PT-0200-UpperBounds-14 8734357 t fired, 9 attempts, .

Time elapsed: 506 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 511/694 0/5 JoinFreeModules-PT-0200-UpperBounds-08 196171967 t fired, 197 attempts, .
24 BOUND FNDP 511/694 0/5 JoinFreeModules-PT-0200-UpperBounds-04 192926426 t fired, 193 attempts, .
27 BOUND FNDP 326/817 0/5 JoinFreeModules-PT-0200-UpperBounds-01 83996847 t fired, 84 attempts, .
30 BOUND FNDP 55/736 0/5 JoinFreeModules-PT-0200-UpperBounds-14 9622688 t fired, 10 attempts, .

Time elapsed: 511 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 516/689 0/5 JoinFreeModules-PT-0200-UpperBounds-08 197200852 t fired, 198 attempts, .
24 BOUND FNDP 516/689 0/5 JoinFreeModules-PT-0200-UpperBounds-04 193826908 t fired, 194 attempts, .
27 BOUND FNDP 331/812 0/5 JoinFreeModules-PT-0200-UpperBounds-01 84910433 t fired, 85 attempts, .
30 BOUND FNDP 60/731 0/5 JoinFreeModules-PT-0200-UpperBounds-14 10642156 t fired, 11 attempts, .

Time elapsed: 516 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 521/684 0/5 JoinFreeModules-PT-0200-UpperBounds-08 198247430 t fired, 199 attempts, .
24 BOUND FNDP 521/684 0/5 JoinFreeModules-PT-0200-UpperBounds-04 194749414 t fired, 195 attempts, .
27 BOUND FNDP 336/807 0/5 JoinFreeModules-PT-0200-UpperBounds-01 85826334 t fired, 86 attempts, .
30 BOUND FNDP 65/726 0/5 JoinFreeModules-PT-0200-UpperBounds-14 11669188 t fired, 12 attempts, .

Time elapsed: 521 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 526/679 0/5 JoinFreeModules-PT-0200-UpperBounds-08 199267665 t fired, 200 attempts, .
24 BOUND FNDP 526/679 0/5 JoinFreeModules-PT-0200-UpperBounds-04 195658917 t fired, 196 attempts, .
27 BOUND FNDP 341/802 0/5 JoinFreeModules-PT-0200-UpperBounds-01 86731943 t fired, 87 attempts, .
30 BOUND FNDP 70/721 0/5 JoinFreeModules-PT-0200-UpperBounds-14 12693553 t fired, 13 attempts, .

Time elapsed: 526 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 531/674 0/5 JoinFreeModules-PT-0200-UpperBounds-08 200330767 t fired, 201 attempts, .
24 BOUND FNDP 531/674 0/5 JoinFreeModules-PT-0200-UpperBounds-04 196565851 t fired, 197 attempts, .
27 BOUND FNDP 346/797 0/5 JoinFreeModules-PT-0200-UpperBounds-01 87646596 t fired, 88 attempts, .
30 BOUND FNDP 75/716 0/5 JoinFreeModules-PT-0200-UpperBounds-14 13714678 t fired, 14 attempts, .

Time elapsed: 531 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 536/669 0/5 JoinFreeModules-PT-0200-UpperBounds-08 201369291 t fired, 202 attempts, .
24 BOUND FNDP 536/669 0/5 JoinFreeModules-PT-0200-UpperBounds-04 197468748 t fired, 198 attempts, .
27 BOUND FNDP 351/792 0/5 JoinFreeModules-PT-0200-UpperBounds-01 88570371 t fired, 89 attempts, .
30 BOUND FNDP 80/711 0/5 JoinFreeModules-PT-0200-UpperBounds-14 14739850 t fired, 15 attempts, .

Time elapsed: 536 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 541/664 0/5 JoinFreeModules-PT-0200-UpperBounds-08 202425232 t fired, 203 attempts, .
24 BOUND FNDP 541/664 0/5 JoinFreeModules-PT-0200-UpperBounds-04 198378674 t fired, 199 attempts, .
27 BOUND FNDP 356/787 0/5 JoinFreeModules-PT-0200-UpperBounds-01 89496069 t fired, 90 attempts, .
30 BOUND FNDP 85/706 0/5 JoinFreeModules-PT-0200-UpperBounds-14 15779513 t fired, 16 attempts, .

Time elapsed: 541 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 546/659 0/5 JoinFreeModules-PT-0200-UpperBounds-08 203476329 t fired, 204 attempts, .
24 BOUND FNDP 546/659 0/5 JoinFreeModules-PT-0200-UpperBounds-04 199290231 t fired, 200 attempts, .
27 BOUND FNDP 361/782 0/5 JoinFreeModules-PT-0200-UpperBounds-01 90441541 t fired, 91 attempts, .
30 BOUND FNDP 90/701 0/5 JoinFreeModules-PT-0200-UpperBounds-14 16817096 t fired, 17 attempts, .

Time elapsed: 546 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 551/654 0/5 JoinFreeModules-PT-0200-UpperBounds-08 204523296 t fired, 205 attempts, .
24 BOUND FNDP 551/654 0/5 JoinFreeModules-PT-0200-UpperBounds-04 200204148 t fired, 201 attempts, .
27 BOUND FNDP 366/777 0/5 JoinFreeModules-PT-0200-UpperBounds-01 91368639 t fired, 92 attempts, .
30 BOUND FNDP 95/696 0/5 JoinFreeModules-PT-0200-UpperBounds-14 17855908 t fired, 18 attempts, .

Time elapsed: 551 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 556/649 0/5 JoinFreeModules-PT-0200-UpperBounds-08 205549235 t fired, 206 attempts, .
24 BOUND FNDP 556/649 0/5 JoinFreeModules-PT-0200-UpperBounds-04 201163174 t fired, 202 attempts, .
27 BOUND FNDP 371/772 0/5 JoinFreeModules-PT-0200-UpperBounds-01 92333220 t fired, 93 attempts, .
30 BOUND FNDP 100/691 0/5 JoinFreeModules-PT-0200-UpperBounds-14 18866383 t fired, 19 attempts, .

Time elapsed: 556 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 561/644 0/5 JoinFreeModules-PT-0200-UpperBounds-08 206581184 t fired, 207 attempts, .
24 BOUND FNDP 561/644 0/5 JoinFreeModules-PT-0200-UpperBounds-04 202116997 t fired, 203 attempts, .
27 BOUND FNDP 376/767 0/5 JoinFreeModules-PT-0200-UpperBounds-01 93254497 t fired, 94 attempts, .
30 BOUND FNDP 105/686 0/5 JoinFreeModules-PT-0200-UpperBounds-14 19885205 t fired, 20 attempts, .

Time elapsed: 561 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 566/639 0/5 JoinFreeModules-PT-0200-UpperBounds-08 207650355 t fired, 208 attempts, .
24 BOUND FNDP 566/639 0/5 JoinFreeModules-PT-0200-UpperBounds-04 203074855 t fired, 204 attempts, .
27 BOUND FNDP 381/762 0/5 JoinFreeModules-PT-0200-UpperBounds-01 94184330 t fired, 95 attempts, .
30 BOUND FNDP 110/681 0/5 JoinFreeModules-PT-0200-UpperBounds-14 20916902 t fired, 21 attempts, .

Time elapsed: 566 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 571/634 0/5 JoinFreeModules-PT-0200-UpperBounds-08 208676717 t fired, 209 attempts, .
24 BOUND FNDP 571/634 0/5 JoinFreeModules-PT-0200-UpperBounds-04 203980929 t fired, 204 attempts, .
27 BOUND FNDP 386/757 0/5 JoinFreeModules-PT-0200-UpperBounds-01 95160248 t fired, 96 attempts, .
30 BOUND FNDP 115/676 0/5 JoinFreeModules-PT-0200-UpperBounds-14 21920618 t fired, 22 attempts, .

Time elapsed: 571 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 576/629 0/5 JoinFreeModules-PT-0200-UpperBounds-08 209667984 t fired, 210 attempts, .
24 BOUND FNDP 576/629 0/5 JoinFreeModules-PT-0200-UpperBounds-04 204929325 t fired, 205 attempts, .
27 BOUND FNDP 391/752 0/5 JoinFreeModules-PT-0200-UpperBounds-01 96124188 t fired, 97 attempts, .
30 BOUND FNDP 120/671 0/5 JoinFreeModules-PT-0200-UpperBounds-14 22927155 t fired, 23 attempts, .

Time elapsed: 576 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 581/624 0/5 JoinFreeModules-PT-0200-UpperBounds-08 210325681 t fired, 211 attempts, .
24 BOUND FNDP 581/624 0/5 JoinFreeModules-PT-0200-UpperBounds-04 205635655 t fired, 206 attempts, .
27 BOUND FNDP 396/747 0/5 JoinFreeModules-PT-0200-UpperBounds-01 97457227 t fired, 98 attempts, .
30 BOUND FNDP 125/666 0/5 JoinFreeModules-PT-0200-UpperBounds-14 23634659 t fired, 24 attempts, .

Time elapsed: 581 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 586/619 0/5 JoinFreeModules-PT-0200-UpperBounds-08 211003111 t fired, 212 attempts, .
24 BOUND FNDP 586/619 0/5 JoinFreeModules-PT-0200-UpperBounds-04 206354282 t fired, 207 attempts, .
27 BOUND FNDP 401/742 0/5 JoinFreeModules-PT-0200-UpperBounds-01 98777118 t fired, 99 attempts, .
30 BOUND FNDP 130/661 0/5 JoinFreeModules-PT-0200-UpperBounds-14 24349635 t fired, 25 attempts, .

Time elapsed: 586 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 591/614 0/5 JoinFreeModules-PT-0200-UpperBounds-08 211694341 t fired, 212 attempts, .
24 BOUND FNDP 591/614 0/5 JoinFreeModules-PT-0200-UpperBounds-04 207076030 t fired, 208 attempts, .
27 BOUND FNDP 406/737 0/5 JoinFreeModules-PT-0200-UpperBounds-01 100077680 t fired, 101 attempts, .
30 BOUND FNDP 135/656 0/5 JoinFreeModules-PT-0200-UpperBounds-14 25064990 t fired, 26 attempts, .

Time elapsed: 591 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 596/609 0/5 JoinFreeModules-PT-0200-UpperBounds-08 212762376 t fired, 213 attempts, .
24 BOUND FNDP 596/609 0/5 JoinFreeModules-PT-0200-UpperBounds-04 208002128 t fired, 209 attempts, .
27 BOUND FNDP 411/732 0/5 JoinFreeModules-PT-0200-UpperBounds-01 101011023 t fired, 102 attempts, .
30 BOUND FNDP 140/651 0/5 JoinFreeModules-PT-0200-UpperBounds-14 26094329 t fired, 27 attempts, .

Time elapsed: 596 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 BOUND FNDP 601/604 0/5 JoinFreeModules-PT-0200-UpperBounds-08 213807877 t fired, 214 attempts, .
24 BOUND FNDP 601/604 0/5 JoinFreeModules-PT-0200-UpperBounds-04 208932029 t fired, 209 attempts, .
27 BOUND FNDP 416/727 0/5 JoinFreeModules-PT-0200-UpperBounds-01 101994859 t fired, 102 attempts, .
30 BOUND FNDP 145/646 0/5 JoinFreeModules-PT-0200-UpperBounds-14 27192672 t fired, 28 attempts, .

Time elapsed: 601 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 21 (type FNDP) for JoinFreeModules-PT-0200-UpperBounds-08 (local timeout)
lola: CANCELED task # 24 (type FNDP) for JoinFreeModules-PT-0200-UpperBounds-04 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 421/722 0/5 JoinFreeModules-PT-0200-UpperBounds-01 103223933 t fired, 104 attempts, .
30 BOUND FNDP 150/641 0/5 JoinFreeModules-PT-0200-UpperBounds-14 27962209 t fired, 28 attempts, .

Time elapsed: 606 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 33 (type FNDP) for 9 JoinFreeModules-PT-0200-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 34 (type EQUN) for 9 JoinFreeModules-PT-0200-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/377/UpperBounds-34.sara.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 426/1286 0/5 JoinFreeModules-PT-0200-UpperBounds-01 104616350 t fired, 105 attempts, .
30 BOUND FNDP 155/898 0/5 JoinFreeModules-PT-0200-UpperBounds-14 28993512 t fired, 29 attempts, .
33 BOUND FNDP 5/998 0/5 JoinFreeModules-PT-0200-UpperBounds-07 1467113 t fired, 2 attempts, .
34 BOUND STEQ 5/998 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 611 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 431/1281 0/5 JoinFreeModules-PT-0200-UpperBounds-01 106041817 t fired, 107 attempts, .
30 BOUND FNDP 160/893 0/5 JoinFreeModules-PT-0200-UpperBounds-14 30029495 t fired, 31 attempts, .
33 BOUND FNDP 10/993 0/5 JoinFreeModules-PT-0200-UpperBounds-07 2906748 t fired, 3 attempts, .
34 BOUND STEQ 10/993 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 616 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 436/1276 0/5 JoinFreeModules-PT-0200-UpperBounds-01 107466689 t fired, 108 attempts, .
30 BOUND FNDP 165/888 0/5 JoinFreeModules-PT-0200-UpperBounds-14 31061825 t fired, 32 attempts, .
33 BOUND FNDP 15/988 0/5 JoinFreeModules-PT-0200-UpperBounds-07 4126201 t fired, 5 attempts, .
34 BOUND STEQ 15/988 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 621 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 441/1271 0/5 JoinFreeModules-PT-0200-UpperBounds-01 108934719 t fired, 109 attempts, .
30 BOUND FNDP 170/883 0/5 JoinFreeModules-PT-0200-UpperBounds-14 32092837 t fired, 33 attempts, .
33 BOUND FNDP 20/983 0/5 JoinFreeModules-PT-0200-UpperBounds-07 5223725 t fired, 6 attempts, .
34 BOUND STEQ 20/983 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 626 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 446/1266 0/5 JoinFreeModules-PT-0200-UpperBounds-01 110353027 t fired, 111 attempts, .
30 BOUND FNDP 175/878 0/5 JoinFreeModules-PT-0200-UpperBounds-14 33129146 t fired, 34 attempts, .
33 BOUND FNDP 25/978 0/5 JoinFreeModules-PT-0200-UpperBounds-07 6342925 t fired, 7 attempts, .
34 BOUND STEQ 25/978 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 631 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 451/1261 0/5 JoinFreeModules-PT-0200-UpperBounds-01 111780879 t fired, 112 attempts, .
30 BOUND FNDP 180/873 0/5 JoinFreeModules-PT-0200-UpperBounds-14 34170473 t fired, 35 attempts, .
33 BOUND FNDP 30/973 0/5 JoinFreeModules-PT-0200-UpperBounds-07 7463273 t fired, 8 attempts, .
34 BOUND STEQ 30/973 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 636 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 456/1256 0/5 JoinFreeModules-PT-0200-UpperBounds-01 112959312 t fired, 113 attempts, .
30 BOUND FNDP 185/868 0/5 JoinFreeModules-PT-0200-UpperBounds-14 35511198 t fired, 36 attempts, .
33 BOUND FNDP 35/968 0/5 JoinFreeModules-PT-0200-UpperBounds-07 8803957 t fired, 9 attempts, .
34 BOUND STEQ 35/968 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 641 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 461/1251 0/5 JoinFreeModules-PT-0200-UpperBounds-01 113678132 t fired, 114 attempts, .
30 BOUND FNDP 190/863 0/5 JoinFreeModules-PT-0200-UpperBounds-14 37231791 t fired, 38 attempts, .
33 BOUND FNDP 40/963 0/5 JoinFreeModules-PT-0200-UpperBounds-07 10704763 t fired, 11 attempts, .
34 BOUND STEQ 40/963 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 646 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 466/1246 0/5 JoinFreeModules-PT-0200-UpperBounds-01 114405977 t fired, 115 attempts, .
30 BOUND FNDP 195/858 0/5 JoinFreeModules-PT-0200-UpperBounds-14 39088257 t fired, 40 attempts, .
33 BOUND FNDP 45/958 0/5 JoinFreeModules-PT-0200-UpperBounds-07 12561545 t fired, 13 attempts, .
34 BOUND STEQ 45/958 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 651 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 471/1241 0/5 JoinFreeModules-PT-0200-UpperBounds-01 115129517 t fired, 116 attempts, .
30 BOUND FNDP 200/853 0/5 JoinFreeModules-PT-0200-UpperBounds-14 40904180 t fired, 41 attempts, .
33 BOUND FNDP 50/953 0/5 JoinFreeModules-PT-0200-UpperBounds-07 14386559 t fired, 15 attempts, .
34 BOUND STEQ 50/953 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 656 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 476/1236 0/5 JoinFreeModules-PT-0200-UpperBounds-01 115858678 t fired, 116 attempts, .
30 BOUND FNDP 205/848 0/5 JoinFreeModules-PT-0200-UpperBounds-14 42755550 t fired, 43 attempts, .
33 BOUND FNDP 55/948 0/5 JoinFreeModules-PT-0200-UpperBounds-07 16180508 t fired, 17 attempts, .
34 BOUND STEQ 55/948 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 661 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 481/1231 0/5 JoinFreeModules-PT-0200-UpperBounds-01 116606048 t fired, 117 attempts, .
30 BOUND FNDP 210/843 0/5 JoinFreeModules-PT-0200-UpperBounds-14 44348461 t fired, 45 attempts, .
33 BOUND FNDP 60/943 0/5 JoinFreeModules-PT-0200-UpperBounds-07 17905295 t fired, 18 attempts, .
34 BOUND STEQ 60/943 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 666 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 486/1226 0/5 JoinFreeModules-PT-0200-UpperBounds-01 117328538 t fired, 118 attempts, .
30 BOUND FNDP 215/838 0/5 JoinFreeModules-PT-0200-UpperBounds-14 45920254 t fired, 46 attempts, .
33 BOUND FNDP 65/938 0/5 JoinFreeModules-PT-0200-UpperBounds-07 19774926 t fired, 20 attempts, .
34 BOUND STEQ 65/938 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 671 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 491/1221 0/5 JoinFreeModules-PT-0200-UpperBounds-01 118096104 t fired, 119 attempts, .
30 BOUND FNDP 220/833 0/5 JoinFreeModules-PT-0200-UpperBounds-14 47618912 t fired, 48 attempts, .
33 BOUND FNDP 70/933 0/5 JoinFreeModules-PT-0200-UpperBounds-07 21390255 t fired, 22 attempts, .
34 BOUND STEQ 70/933 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 676 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 496/1216 0/5 JoinFreeModules-PT-0200-UpperBounds-01 118775358 t fired, 119 attempts, .
30 BOUND FNDP 225/828 0/5 JoinFreeModules-PT-0200-UpperBounds-14 49294533 t fired, 50 attempts, .
33 BOUND FNDP 75/928 0/5 JoinFreeModules-PT-0200-UpperBounds-07 23620846 t fired, 24 attempts, .
34 BOUND STEQ 75/928 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 681 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 501/1211 0/5 JoinFreeModules-PT-0200-UpperBounds-01 119498951 t fired, 120 attempts, .
30 BOUND FNDP 230/823 0/5 JoinFreeModules-PT-0200-UpperBounds-14 51068797 t fired, 52 attempts, .
33 BOUND FNDP 80/923 0/5 JoinFreeModules-PT-0200-UpperBounds-07 25410382 t fired, 26 attempts, .
34 BOUND STEQ 80/923 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 686 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 506/1206 0/5 JoinFreeModules-PT-0200-UpperBounds-01 120211702 t fired, 121 attempts, .
30 BOUND FNDP 235/818 0/5 JoinFreeModules-PT-0200-UpperBounds-14 52695084 t fired, 53 attempts, .
33 BOUND FNDP 85/918 0/5 JoinFreeModules-PT-0200-UpperBounds-07 27296981 t fired, 28 attempts, .
34 BOUND STEQ 85/918 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 691 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 511/1201 0/5 JoinFreeModules-PT-0200-UpperBounds-01 120923820 t fired, 121 attempts, .
30 BOUND FNDP 240/813 0/5 JoinFreeModules-PT-0200-UpperBounds-14 54443420 t fired, 55 attempts, .
33 BOUND FNDP 90/913 0/5 JoinFreeModules-PT-0200-UpperBounds-07 29098178 t fired, 30 attempts, .
34 BOUND STEQ 90/913 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 696 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 516/1196 0/5 JoinFreeModules-PT-0200-UpperBounds-01 121626518 t fired, 122 attempts, .
30 BOUND FNDP 245/808 0/5 JoinFreeModules-PT-0200-UpperBounds-14 56212410 t fired, 57 attempts, .
33 BOUND FNDP 95/908 0/5 JoinFreeModules-PT-0200-UpperBounds-07 30877964 t fired, 31 attempts, .
34 BOUND STEQ 95/908 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 701 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 521/1191 0/5 JoinFreeModules-PT-0200-UpperBounds-01 122335305 t fired, 123 attempts, .
30 BOUND FNDP 250/803 0/5 JoinFreeModules-PT-0200-UpperBounds-14 57980061 t fired, 58 attempts, .
33 BOUND FNDP 100/903 0/5 JoinFreeModules-PT-0200-UpperBounds-07 32748144 t fired, 33 attempts, .
34 BOUND STEQ 100/903 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 706 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 526/1186 0/5 JoinFreeModules-PT-0200-UpperBounds-01 123052974 t fired, 124 attempts, .
30 BOUND FNDP 255/798 0/5 JoinFreeModules-PT-0200-UpperBounds-14 59648157 t fired, 60 attempts, .
33 BOUND FNDP 105/898 0/5 JoinFreeModules-PT-0200-UpperBounds-07 34509926 t fired, 35 attempts, .
34 BOUND STEQ 105/898 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 711 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 531/1181 0/5 JoinFreeModules-PT-0200-UpperBounds-01 123754808 t fired, 124 attempts, .
30 BOUND FNDP 260/793 0/5 JoinFreeModules-PT-0200-UpperBounds-14 61369152 t fired, 62 attempts, .
33 BOUND FNDP 110/893 0/5 JoinFreeModules-PT-0200-UpperBounds-07 36221314 t fired, 37 attempts, .
34 BOUND STEQ 110/893 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 716 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 536/1176 0/5 JoinFreeModules-PT-0200-UpperBounds-01 124457846 t fired, 125 attempts, .
30 BOUND FNDP 265/788 0/5 JoinFreeModules-PT-0200-UpperBounds-14 63115358 t fired, 64 attempts, .
33 BOUND FNDP 115/888 0/5 JoinFreeModules-PT-0200-UpperBounds-07 37866132 t fired, 38 attempts, .
34 BOUND STEQ 115/888 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 721 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 541/1171 0/5 JoinFreeModules-PT-0200-UpperBounds-01 125166511 t fired, 126 attempts, .
30 BOUND FNDP 270/783 0/5 JoinFreeModules-PT-0200-UpperBounds-14 64778103 t fired, 65 attempts, .
33 BOUND FNDP 120/883 0/5 JoinFreeModules-PT-0200-UpperBounds-07 39602540 t fired, 40 attempts, .
34 BOUND STEQ 120/883 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 726 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 546/1166 0/5 JoinFreeModules-PT-0200-UpperBounds-01 125876561 t fired, 126 attempts, .
30 BOUND FNDP 275/778 0/5 JoinFreeModules-PT-0200-UpperBounds-14 66529939 t fired, 67 attempts, .
33 BOUND FNDP 125/878 0/5 JoinFreeModules-PT-0200-UpperBounds-07 41276260 t fired, 42 attempts, .
34 BOUND STEQ 125/878 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 731 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 551/1161 0/5 JoinFreeModules-PT-0200-UpperBounds-01 126584777 t fired, 127 attempts, .
30 BOUND FNDP 280/773 0/5 JoinFreeModules-PT-0200-UpperBounds-14 68376155 t fired, 69 attempts, .
33 BOUND FNDP 130/873 0/5 JoinFreeModules-PT-0200-UpperBounds-07 42980332 t fired, 43 attempts, .
34 BOUND STEQ 130/873 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 736 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 556/1156 0/5 JoinFreeModules-PT-0200-UpperBounds-01 127290316 t fired, 128 attempts, .
30 BOUND FNDP 285/768 0/5 JoinFreeModules-PT-0200-UpperBounds-14 70246353 t fired, 71 attempts, .
33 BOUND FNDP 135/868 0/5 JoinFreeModules-PT-0200-UpperBounds-07 44757725 t fired, 45 attempts, .
34 BOUND STEQ 135/868 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 741 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 561/1151 0/5 JoinFreeModules-PT-0200-UpperBounds-01 127992875 t fired, 128 attempts, .
30 BOUND FNDP 290/763 0/5 JoinFreeModules-PT-0200-UpperBounds-14 71913749 t fired, 72 attempts, .
33 BOUND FNDP 140/863 0/5 JoinFreeModules-PT-0200-UpperBounds-07 46470265 t fired, 47 attempts, .
34 BOUND STEQ 140/863 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 746 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 566/1146 0/5 JoinFreeModules-PT-0200-UpperBounds-01 128699905 t fired, 129 attempts, .
30 BOUND FNDP 295/758 0/5 JoinFreeModules-PT-0200-UpperBounds-14 73556406 t fired, 74 attempts, .
33 BOUND FNDP 145/858 0/5 JoinFreeModules-PT-0200-UpperBounds-07 48240767 t fired, 49 attempts, .
34 BOUND STEQ 145/858 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 751 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 571/1141 0/5 JoinFreeModules-PT-0200-UpperBounds-01 129432094 t fired, 130 attempts, .
30 BOUND FNDP 300/753 0/5 JoinFreeModules-PT-0200-UpperBounds-14 75294509 t fired, 76 attempts, .
33 BOUND FNDP 150/853 0/5 JoinFreeModules-PT-0200-UpperBounds-07 50037401 t fired, 51 attempts, .
34 BOUND STEQ 150/853 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 756 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 576/1136 0/5 JoinFreeModules-PT-0200-UpperBounds-01 130338003 t fired, 131 attempts, .
30 BOUND FNDP 305/748 0/5 JoinFreeModules-PT-0200-UpperBounds-14 77098553 t fired, 78 attempts, .
33 BOUND FNDP 155/848 0/5 JoinFreeModules-PT-0200-UpperBounds-07 51745811 t fired, 52 attempts, .
34 BOUND STEQ 155/848 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 761 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 581/1131 0/5 JoinFreeModules-PT-0200-UpperBounds-01 131239014 t fired, 132 attempts, .
30 BOUND FNDP 310/743 0/5 JoinFreeModules-PT-0200-UpperBounds-14 78927864 t fired, 79 attempts, .
33 BOUND FNDP 160/843 0/5 JoinFreeModules-PT-0200-UpperBounds-07 53482050 t fired, 54 attempts, .
34 BOUND STEQ 160/843 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 766 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 586/1126 0/5 JoinFreeModules-PT-0200-UpperBounds-01 132133487 t fired, 133 attempts, .
30 BOUND FNDP 315/738 0/5 JoinFreeModules-PT-0200-UpperBounds-14 80687228 t fired, 81 attempts, .
33 BOUND FNDP 165/838 0/5 JoinFreeModules-PT-0200-UpperBounds-07 55200743 t fired, 56 attempts, .
34 BOUND STEQ 165/838 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 771 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 591/1121 0/5 JoinFreeModules-PT-0200-UpperBounds-01 133019392 t fired, 134 attempts, .
30 BOUND FNDP 320/733 0/5 JoinFreeModules-PT-0200-UpperBounds-14 82438213 t fired, 83 attempts, .
33 BOUND FNDP 170/833 0/5 JoinFreeModules-PT-0200-UpperBounds-07 56921808 t fired, 57 attempts, .
34 BOUND STEQ 170/833 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 776 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 596/1116 0/5 JoinFreeModules-PT-0200-UpperBounds-01 133905624 t fired, 134 attempts, .
30 BOUND FNDP 325/728 0/5 JoinFreeModules-PT-0200-UpperBounds-14 84183661 t fired, 85 attempts, .
33 BOUND FNDP 175/828 0/5 JoinFreeModules-PT-0200-UpperBounds-07 58689552 t fired, 59 attempts, .
34 BOUND STEQ 175/828 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 781 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 601/1111 0/5 JoinFreeModules-PT-0200-UpperBounds-01 134793756 t fired, 135 attempts, .
30 BOUND FNDP 330/723 0/5 JoinFreeModules-PT-0200-UpperBounds-14 85882581 t fired, 86 attempts, .
33 BOUND FNDP 180/823 0/5 JoinFreeModules-PT-0200-UpperBounds-07 60358022 t fired, 61 attempts, .
34 BOUND STEQ 180/823 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 786 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 606/1106 0/5 JoinFreeModules-PT-0200-UpperBounds-01 135683606 t fired, 136 attempts, .
30 BOUND FNDP 335/718 0/5 JoinFreeModules-PT-0200-UpperBounds-14 87600026 t fired, 88 attempts, .
33 BOUND FNDP 185/818 0/5 JoinFreeModules-PT-0200-UpperBounds-07 62041084 t fired, 63 attempts, .
34 BOUND STEQ 185/818 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 791 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 611/1101 0/5 JoinFreeModules-PT-0200-UpperBounds-01 136572012 t fired, 137 attempts, .
30 BOUND FNDP 340/713 0/5 JoinFreeModules-PT-0200-UpperBounds-14 89329442 t fired, 90 attempts, .
33 BOUND FNDP 190/813 0/5 JoinFreeModules-PT-0200-UpperBounds-07 63964383 t fired, 64 attempts, .
34 BOUND STEQ 190/813 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 796 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 616/1096 0/5 JoinFreeModules-PT-0200-UpperBounds-01 137463137 t fired, 138 attempts, .
30 BOUND FNDP 345/708 0/5 JoinFreeModules-PT-0200-UpperBounds-14 91141199 t fired, 92 attempts, .
33 BOUND FNDP 195/808 0/5 JoinFreeModules-PT-0200-UpperBounds-07 65694938 t fired, 66 attempts, .
34 BOUND STEQ 195/808 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 801 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 621/1091 0/5 JoinFreeModules-PT-0200-UpperBounds-01 138352046 t fired, 139 attempts, .
30 BOUND FNDP 350/703 0/5 JoinFreeModules-PT-0200-UpperBounds-14 93068235 t fired, 94 attempts, .
33 BOUND FNDP 200/803 0/5 JoinFreeModules-PT-0200-UpperBounds-07 67396434 t fired, 68 attempts, .
34 BOUND STEQ 200/803 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 806 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 626/1086 0/5 JoinFreeModules-PT-0200-UpperBounds-01 139239682 t fired, 140 attempts, .
30 BOUND FNDP 355/698 0/5 JoinFreeModules-PT-0200-UpperBounds-14 94822025 t fired, 95 attempts, .
33 BOUND FNDP 205/798 0/5 JoinFreeModules-PT-0200-UpperBounds-07 69284444 t fired, 70 attempts, .
34 BOUND STEQ 205/798 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 811 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 631/1081 0/5 JoinFreeModules-PT-0200-UpperBounds-01 140299795 t fired, 141 attempts, .
30 BOUND FNDP 360/693 0/5 JoinFreeModules-PT-0200-UpperBounds-14 96344278 t fired, 97 attempts, .
33 BOUND FNDP 210/793 0/5 JoinFreeModules-PT-0200-UpperBounds-07 70876394 t fired, 71 attempts, .
34 BOUND STEQ 210/793 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 816 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 636/1076 0/5 JoinFreeModules-PT-0200-UpperBounds-01 142092987 t fired, 143 attempts, .
30 BOUND FNDP 365/688 0/5 JoinFreeModules-PT-0200-UpperBounds-14 97324805 t fired, 98 attempts, .
33 BOUND FNDP 215/788 0/5 JoinFreeModules-PT-0200-UpperBounds-07 71981304 t fired, 72 attempts, .
34 BOUND STEQ 215/788 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 821 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 641/1071 0/5 JoinFreeModules-PT-0200-UpperBounds-01 143924992 t fired, 144 attempts, .
30 BOUND FNDP 370/683 0/5 JoinFreeModules-PT-0200-UpperBounds-14 98304573 t fired, 99 attempts, .
33 BOUND FNDP 220/783 0/5 JoinFreeModules-PT-0200-UpperBounds-07 73061635 t fired, 74 attempts, .
34 BOUND STEQ 220/783 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 826 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 646/1066 0/5 JoinFreeModules-PT-0200-UpperBounds-01 145747587 t fired, 146 attempts, .
30 BOUND FNDP 375/678 0/5 JoinFreeModules-PT-0200-UpperBounds-14 99278372 t fired, 100 attempts, .
33 BOUND FNDP 225/778 0/5 JoinFreeModules-PT-0200-UpperBounds-07 74153173 t fired, 75 attempts, .
34 BOUND STEQ 225/778 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 831 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 651/1061 0/5 JoinFreeModules-PT-0200-UpperBounds-01 147561344 t fired, 148 attempts, .
30 BOUND FNDP 380/673 0/5 JoinFreeModules-PT-0200-UpperBounds-14 100274987 t fired, 101 attempts, .
33 BOUND FNDP 230/773 0/5 JoinFreeModules-PT-0200-UpperBounds-07 75241393 t fired, 76 attempts, .
34 BOUND STEQ 230/773 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 836 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 656/1056 0/5 JoinFreeModules-PT-0200-UpperBounds-01 149376611 t fired, 150 attempts, .
30 BOUND FNDP 385/668 0/5 JoinFreeModules-PT-0200-UpperBounds-14 101274774 t fired, 102 attempts, .
33 BOUND FNDP 235/768 0/5 JoinFreeModules-PT-0200-UpperBounds-07 76317350 t fired, 77 attempts, .
34 BOUND STEQ 235/768 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 841 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 661/1051 0/5 JoinFreeModules-PT-0200-UpperBounds-01 151187190 t fired, 152 attempts, .
30 BOUND FNDP 390/663 0/5 JoinFreeModules-PT-0200-UpperBounds-14 102280276 t fired, 103 attempts, .
33 BOUND FNDP 240/763 0/5 JoinFreeModules-PT-0200-UpperBounds-07 77386071 t fired, 78 attempts, .
34 BOUND STEQ 240/763 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 846 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 666/1046 0/5 JoinFreeModules-PT-0200-UpperBounds-01 152911693 t fired, 153 attempts, .
30 BOUND FNDP 395/658 0/5 JoinFreeModules-PT-0200-UpperBounds-14 103368536 t fired, 104 attempts, .
33 BOUND FNDP 245/758 0/5 JoinFreeModules-PT-0200-UpperBounds-07 78532761 t fired, 79 attempts, .
34 BOUND STEQ 245/758 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 851 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 671/1041 0/5 JoinFreeModules-PT-0200-UpperBounds-01 154722161 t fired, 155 attempts, .
30 BOUND FNDP 400/653 0/5 JoinFreeModules-PT-0200-UpperBounds-14 104371071 t fired, 105 attempts, .
33 BOUND FNDP 250/753 0/5 JoinFreeModules-PT-0200-UpperBounds-07 79610535 t fired, 80 attempts, .
34 BOUND STEQ 250/753 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 856 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 676/1036 0/5 JoinFreeModules-PT-0200-UpperBounds-01 156537481 t fired, 157 attempts, .
30 BOUND FNDP 405/648 0/5 JoinFreeModules-PT-0200-UpperBounds-14 105369439 t fired, 106 attempts, .
33 BOUND FNDP 255/748 0/5 JoinFreeModules-PT-0200-UpperBounds-07 80686151 t fired, 81 attempts, .
34 BOUND STEQ 255/748 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 861 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 681/1031 0/5 JoinFreeModules-PT-0200-UpperBounds-01 158351002 t fired, 159 attempts, .
30 BOUND FNDP 410/643 0/5 JoinFreeModules-PT-0200-UpperBounds-14 106366424 t fired, 107 attempts, .
33 BOUND FNDP 260/743 0/5 JoinFreeModules-PT-0200-UpperBounds-07 81748066 t fired, 82 attempts, .
34 BOUND STEQ 260/743 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 866 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 686/1026 0/5 JoinFreeModules-PT-0200-UpperBounds-01 160169280 t fired, 161 attempts, .
30 BOUND FNDP 415/638 0/5 JoinFreeModules-PT-0200-UpperBounds-14 107372609 t fired, 108 attempts, .
33 BOUND FNDP 265/738 0/5 JoinFreeModules-PT-0200-UpperBounds-07 82811546 t fired, 83 attempts, .
34 BOUND STEQ 265/738 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 871 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 691/1021 0/5 JoinFreeModules-PT-0200-UpperBounds-01 161979875 t fired, 162 attempts, .
30 BOUND FNDP 420/633 0/5 JoinFreeModules-PT-0200-UpperBounds-14 108383007 t fired, 109 attempts, .
33 BOUND FNDP 270/733 0/5 JoinFreeModules-PT-0200-UpperBounds-07 83874431 t fired, 84 attempts, .
34 BOUND STEQ 270/733 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 876 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 696/1016 0/5 JoinFreeModules-PT-0200-UpperBounds-01 163791361 t fired, 164 attempts, .
30 BOUND FNDP 425/628 0/5 JoinFreeModules-PT-0200-UpperBounds-14 109382453 t fired, 110 attempts, .
33 BOUND FNDP 275/728 0/5 JoinFreeModules-PT-0200-UpperBounds-07 84942169 t fired, 85 attempts, .
34 BOUND STEQ 275/728 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 881 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 701/1011 0/5 JoinFreeModules-PT-0200-UpperBounds-01 165604138 t fired, 166 attempts, .
30 BOUND FNDP 430/623 0/5 JoinFreeModules-PT-0200-UpperBounds-14 110383173 t fired, 111 attempts, .
33 BOUND FNDP 280/723 0/5 JoinFreeModules-PT-0200-UpperBounds-07 86015670 t fired, 87 attempts, .
34 BOUND STEQ 280/723 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 886 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 706/1006 0/5 JoinFreeModules-PT-0200-UpperBounds-01 167417369 t fired, 168 attempts, .
30 BOUND FNDP 435/618 0/5 JoinFreeModules-PT-0200-UpperBounds-14 111383462 t fired, 112 attempts, .
33 BOUND FNDP 285/718 0/5 JoinFreeModules-PT-0200-UpperBounds-07 87081178 t fired, 88 attempts, .
34 BOUND STEQ 285/718 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 891 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 711/1001 0/5 JoinFreeModules-PT-0200-UpperBounds-01 169245003 t fired, 170 attempts, .
30 BOUND FNDP 440/613 0/5 JoinFreeModules-PT-0200-UpperBounds-14 112396438 t fired, 113 attempts, .
33 BOUND FNDP 290/713 0/5 JoinFreeModules-PT-0200-UpperBounds-07 88136343 t fired, 89 attempts, .
34 BOUND STEQ 290/713 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 896 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 716/996 0/5 JoinFreeModules-PT-0200-UpperBounds-01 170930424 t fired, 171 attempts, .
30 BOUND FNDP 445/608 0/5 JoinFreeModules-PT-0200-UpperBounds-14 113428429 t fired, 114 attempts, .
33 BOUND FNDP 295/708 0/5 JoinFreeModules-PT-0200-UpperBounds-07 89230065 t fired, 90 attempts, .
34 BOUND STEQ 295/708 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 901 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 721/991 0/5 JoinFreeModules-PT-0200-UpperBounds-01 172330364 t fired, 173 attempts, .
30 BOUND FNDP 450/603 0/5 JoinFreeModules-PT-0200-UpperBounds-14 114536167 t fired, 115 attempts, .
33 BOUND FNDP 300/703 0/5 JoinFreeModules-PT-0200-UpperBounds-07 90385377 t fired, 91 attempts, .
34 BOUND STEQ 300/703 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 906 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 726/986 0/5 JoinFreeModules-PT-0200-UpperBounds-01 173716202 t fired, 174 attempts, .
30 BOUND FNDP 455/598 0/5 JoinFreeModules-PT-0200-UpperBounds-14 115660088 t fired, 116 attempts, .
33 BOUND FNDP 305/698 0/5 JoinFreeModules-PT-0200-UpperBounds-07 91550995 t fired, 92 attempts, .
34 BOUND STEQ 305/698 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 911 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 731/981 0/5 JoinFreeModules-PT-0200-UpperBounds-01 175085168 t fired, 176 attempts, .
30 BOUND FNDP 460/593 0/5 JoinFreeModules-PT-0200-UpperBounds-14 116750574 t fired, 117 attempts, .
33 BOUND FNDP 310/693 0/5 JoinFreeModules-PT-0200-UpperBounds-07 92676602 t fired, 93 attempts, .
34 BOUND STEQ 310/693 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 916 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 736/976 0/5 JoinFreeModules-PT-0200-UpperBounds-01 176474684 t fired, 177 attempts, .
30 BOUND FNDP 465/588 0/5 JoinFreeModules-PT-0200-UpperBounds-14 117838486 t fired, 118 attempts, .
33 BOUND FNDP 315/688 0/5 JoinFreeModules-PT-0200-UpperBounds-07 93818246 t fired, 94 attempts, .
34 BOUND STEQ 315/688 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 921 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 741/971 0/5 JoinFreeModules-PT-0200-UpperBounds-01 177875789 t fired, 178 attempts, .
30 BOUND FNDP 470/583 0/5 JoinFreeModules-PT-0200-UpperBounds-14 118886958 t fired, 119 attempts, .
33 BOUND FNDP 320/683 0/5 JoinFreeModules-PT-0200-UpperBounds-07 94917830 t fired, 95 attempts, .
34 BOUND STEQ 320/683 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 926 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 746/966 0/5 JoinFreeModules-PT-0200-UpperBounds-01 179269751 t fired, 180 attempts, .
30 BOUND FNDP 475/578 0/5 JoinFreeModules-PT-0200-UpperBounds-14 119943812 t fired, 120 attempts, .
33 BOUND FNDP 325/678 0/5 JoinFreeModules-PT-0200-UpperBounds-07 96028639 t fired, 97 attempts, .
34 BOUND STEQ 325/678 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 931 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 751/961 0/5 JoinFreeModules-PT-0200-UpperBounds-01 180395932 t fired, 181 attempts, .
30 BOUND FNDP 480/573 0/5 JoinFreeModules-PT-0200-UpperBounds-14 121250974 t fired, 122 attempts, .
33 BOUND FNDP 330/673 0/5 JoinFreeModules-PT-0200-UpperBounds-07 97371050 t fired, 98 attempts, .
34 BOUND STEQ 330/673 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 936 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 756/956 0/5 JoinFreeModules-PT-0200-UpperBounds-01 181815856 t fired, 182 attempts, .
30 BOUND FNDP 485/568 0/5 JoinFreeModules-PT-0200-UpperBounds-14 122302478 t fired, 123 attempts, .
33 BOUND FNDP 335/668 0/5 JoinFreeModules-PT-0200-UpperBounds-07 98484366 t fired, 99 attempts, .
34 BOUND STEQ 335/668 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 941 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 761/951 0/5 JoinFreeModules-PT-0200-UpperBounds-01 183189618 t fired, 184 attempts, .
30 BOUND FNDP 490/563 0/5 JoinFreeModules-PT-0200-UpperBounds-14 123374232 t fired, 124 attempts, .
33 BOUND FNDP 340/663 0/5 JoinFreeModules-PT-0200-UpperBounds-07 99610623 t fired, 100 attempts, .
34 BOUND STEQ 340/663 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 946 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 766/946 0/5 JoinFreeModules-PT-0200-UpperBounds-01 184537416 t fired, 185 attempts, .
30 BOUND FNDP 495/558 0/5 JoinFreeModules-PT-0200-UpperBounds-14 124472577 t fired, 125 attempts, .
33 BOUND FNDP 345/658 0/5 JoinFreeModules-PT-0200-UpperBounds-07 100768263 t fired, 101 attempts, .
34 BOUND STEQ 345/658 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 951 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 771/941 0/5 JoinFreeModules-PT-0200-UpperBounds-01 185976546 t fired, 186 attempts, .
30 BOUND FNDP 500/553 0/5 JoinFreeModules-PT-0200-UpperBounds-14 125506481 t fired, 126 attempts, .
33 BOUND FNDP 350/653 0/5 JoinFreeModules-PT-0200-UpperBounds-07 101862616 t fired, 102 attempts, .
34 BOUND STEQ 350/653 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 956 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 776/936 0/5 JoinFreeModules-PT-0200-UpperBounds-01 187407746 t fired, 188 attempts, .
30 BOUND FNDP 505/548 0/5 JoinFreeModules-PT-0200-UpperBounds-14 126555277 t fired, 127 attempts, .
33 BOUND FNDP 355/648 0/5 JoinFreeModules-PT-0200-UpperBounds-07 102963055 t fired, 103 attempts, .
34 BOUND STEQ 355/648 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 961 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 781/931 0/5 JoinFreeModules-PT-0200-UpperBounds-01 188890271 t fired, 189 attempts, .
30 BOUND FNDP 510/543 0/5 JoinFreeModules-PT-0200-UpperBounds-14 127580344 t fired, 128 attempts, .
33 BOUND FNDP 360/643 0/5 JoinFreeModules-PT-0200-UpperBounds-07 104047057 t fired, 105 attempts, .
34 BOUND STEQ 360/643 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 966 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 786/926 0/5 JoinFreeModules-PT-0200-UpperBounds-01 190369304 t fired, 191 attempts, .
30 BOUND FNDP 515/538 0/5 JoinFreeModules-PT-0200-UpperBounds-14 128603399 t fired, 129 attempts, .
33 BOUND FNDP 365/638 0/5 JoinFreeModules-PT-0200-UpperBounds-07 105128397 t fired, 106 attempts, .
34 BOUND STEQ 365/638 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 971 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 791/921 0/5 JoinFreeModules-PT-0200-UpperBounds-01 191777970 t fired, 192 attempts, .
30 BOUND FNDP 520/533 0/5 JoinFreeModules-PT-0200-UpperBounds-14 129667322 t fired, 130 attempts, .
33 BOUND FNDP 370/633 0/5 JoinFreeModules-PT-0200-UpperBounds-07 106239473 t fired, 107 attempts, .
34 BOUND STEQ 370/633 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 976 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 1 0 0 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 796/916 0/5 JoinFreeModules-PT-0200-UpperBounds-01 193178856 t fired, 194 attempts, .
30 BOUND FNDP 525/528 0/5 JoinFreeModules-PT-0200-UpperBounds-14 130727673 t fired, 131 attempts, .
33 BOUND FNDP 375/628 0/5 JoinFreeModules-PT-0200-UpperBounds-07 107346756 t fired, 108 attempts, .
34 BOUND STEQ 375/628 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 981 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 30 (type FNDP) for JoinFreeModules-PT-0200-UpperBounds-14 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 2 0 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 801/911 0/5 JoinFreeModules-PT-0200-UpperBounds-01 194568399 t fired, 195 attempts, .
33 BOUND FNDP 380/623 0/5 JoinFreeModules-PT-0200-UpperBounds-07 108474970 t fired, 109 attempts, .
34 BOUND STEQ 380/623 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --

Time elapsed: 986 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 36 (type FNDP) for 15 JoinFreeModules-PT-0200-UpperBounds-11
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 806/906 0/5 JoinFreeModules-PT-0200-UpperBounds-01 195927565 t fired, 196 attempts, .
33 BOUND FNDP 385/1117 0/5 JoinFreeModules-PT-0200-UpperBounds-07 109572699 t fired, 110 attempts, .
34 BOUND STEQ 385/618 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 5/871 0/5 JoinFreeModules-PT-0200-UpperBounds-11 1494133 t fired, 2 attempts, .

Time elapsed: 991 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 811/901 0/5 JoinFreeModules-PT-0200-UpperBounds-01 197338942 t fired, 198 attempts, .
33 BOUND FNDP 390/1112 0/5 JoinFreeModules-PT-0200-UpperBounds-07 110640957 t fired, 111 attempts, .
34 BOUND STEQ 390/613 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 10/866 0/5 JoinFreeModules-PT-0200-UpperBounds-11 2872969 t fired, 3 attempts, .

Time elapsed: 996 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 816/896 0/5 JoinFreeModules-PT-0200-UpperBounds-01 198713212 t fired, 199 attempts, .
33 BOUND FNDP 395/1107 0/5 JoinFreeModules-PT-0200-UpperBounds-07 111731096 t fired, 112 attempts, .
34 BOUND STEQ 395/608 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 15/861 0/5 JoinFreeModules-PT-0200-UpperBounds-11 4043308 t fired, 5 attempts, .

Time elapsed: 1001 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 821/891 0/5 JoinFreeModules-PT-0200-UpperBounds-01 200092252 t fired, 201 attempts, .
33 BOUND FNDP 400/1102 0/5 JoinFreeModules-PT-0200-UpperBounds-07 112828009 t fired, 113 attempts, .
34 BOUND STEQ 400/603 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 20/856 0/5 JoinFreeModules-PT-0200-UpperBounds-11 5167827 t fired, 6 attempts, .

Time elapsed: 1006 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 826/886 0/5 JoinFreeModules-PT-0200-UpperBounds-01 201517634 t fired, 202 attempts, .
33 BOUND FNDP 405/1097 0/5 JoinFreeModules-PT-0200-UpperBounds-07 113903605 t fired, 114 attempts, .
34 BOUND STEQ 405/598 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 25/851 0/5 JoinFreeModules-PT-0200-UpperBounds-11 6271010 t fired, 7 attempts, .

Time elapsed: 1011 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 831/881 0/5 JoinFreeModules-PT-0200-UpperBounds-01 202955485 t fired, 203 attempts, .
33 BOUND FNDP 410/1092 0/5 JoinFreeModules-PT-0200-UpperBounds-07 114953289 t fired, 115 attempts, .
34 BOUND STEQ 410/593 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 30/846 0/5 JoinFreeModules-PT-0200-UpperBounds-11 7351093 t fired, 8 attempts, .

Time elapsed: 1016 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 836/876 0/5 JoinFreeModules-PT-0200-UpperBounds-01 204381748 t fired, 205 attempts, .
33 BOUND FNDP 415/1087 0/5 JoinFreeModules-PT-0200-UpperBounds-07 116016861 t fired, 117 attempts, .
34 BOUND STEQ 415/588 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 35/841 0/5 JoinFreeModules-PT-0200-UpperBounds-11 8435529 t fired, 9 attempts, .

Time elapsed: 1021 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 841/871 0/5 JoinFreeModules-PT-0200-UpperBounds-01 205790009 t fired, 206 attempts, .
33 BOUND FNDP 420/1082 0/5 JoinFreeModules-PT-0200-UpperBounds-07 117082230 t fired, 118 attempts, .
34 BOUND STEQ 420/583 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 40/836 0/5 JoinFreeModules-PT-0200-UpperBounds-11 9526873 t fired, 10 attempts, .

Time elapsed: 1026 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 846/866 0/5 JoinFreeModules-PT-0200-UpperBounds-01 207200301 t fired, 208 attempts, .
33 BOUND FNDP 425/1077 0/5 JoinFreeModules-PT-0200-UpperBounds-07 118147531 t fired, 119 attempts, .
34 BOUND STEQ 425/578 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 45/831 0/5 JoinFreeModules-PT-0200-UpperBounds-11 10619671 t fired, 11 attempts, .

Time elapsed: 1031 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 851/861 0/5 JoinFreeModules-PT-0200-UpperBounds-01 208596363 t fired, 209 attempts, .
33 BOUND FNDP 430/1072 0/5 JoinFreeModules-PT-0200-UpperBounds-07 119227453 t fired, 120 attempts, .
34 BOUND STEQ 430/573 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 50/826 0/5 JoinFreeModules-PT-0200-UpperBounds-11 11731483 t fired, 12 attempts, .

Time elapsed: 1036 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
27 BOUND FNDP 856/856 0/5 JoinFreeModules-PT-0200-UpperBounds-01 209987622 t fired, 210 attempts, .
33 BOUND FNDP 435/1067 0/5 JoinFreeModules-PT-0200-UpperBounds-07 120304513 t fired, 121 attempts, .
34 BOUND STEQ 435/568 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 55/821 0/5 JoinFreeModules-PT-0200-UpperBounds-11 12839176 t fired, 13 attempts, .

Time elapsed: 1041 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 27 (type FNDP) for JoinFreeModules-PT-0200-UpperBounds-01 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 2 0 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 440/1062 0/5 JoinFreeModules-PT-0200-UpperBounds-07 121370487 t fired, 122 attempts, .
34 BOUND STEQ 440/563 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 60/816 0/5 JoinFreeModules-PT-0200-UpperBounds-11 13938404 t fired, 14 attempts, .

Time elapsed: 1046 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 39 (type FNDP) for 0 JoinFreeModules-PT-0200-UpperBounds-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 445/1057 0/5 JoinFreeModules-PT-0200-UpperBounds-07 122506275 t fired, 123 attempts, .
34 BOUND STEQ 445/1057 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 65/1247 0/5 JoinFreeModules-PT-0200-UpperBounds-11 15090244 t fired, 16 attempts, .
39 BOUND FNDP 5/851 0/5 JoinFreeModules-PT-0200-UpperBounds-00 1580689 t fired, 2 attempts, .

Time elapsed: 1051 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 450/1052 0/5 JoinFreeModules-PT-0200-UpperBounds-07 123638972 t fired, 124 attempts, .
34 BOUND STEQ 450/1052 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 70/1242 0/5 JoinFreeModules-PT-0200-UpperBounds-11 16242183 t fired, 17 attempts, .
39 BOUND FNDP 10/846 0/5 JoinFreeModules-PT-0200-UpperBounds-00 3107869 t fired, 4 attempts, .

Time elapsed: 1056 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 455/1047 0/5 JoinFreeModules-PT-0200-UpperBounds-07 124757604 t fired, 125 attempts, .
34 BOUND STEQ 455/1047 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 75/1237 0/5 JoinFreeModules-PT-0200-UpperBounds-11 17380111 t fired, 18 attempts, .
39 BOUND FNDP 15/841 0/5 JoinFreeModules-PT-0200-UpperBounds-00 4542148 t fired, 5 attempts, .

Time elapsed: 1061 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 460/1042 0/5 JoinFreeModules-PT-0200-UpperBounds-07 125884027 t fired, 126 attempts, .
34 BOUND STEQ 460/1042 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 80/1232 0/5 JoinFreeModules-PT-0200-UpperBounds-11 18497368 t fired, 19 attempts, .
39 BOUND FNDP 20/836 0/5 JoinFreeModules-PT-0200-UpperBounds-00 5956777 t fired, 6 attempts, .

Time elapsed: 1066 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 465/1037 0/5 JoinFreeModules-PT-0200-UpperBounds-07 127039111 t fired, 128 attempts, .
34 BOUND STEQ 465/1037 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 85/1227 0/5 JoinFreeModules-PT-0200-UpperBounds-11 19644868 t fired, 20 attempts, .
39 BOUND FNDP 25/831 0/5 JoinFreeModules-PT-0200-UpperBounds-00 7354646 t fired, 8 attempts, .

Time elapsed: 1071 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 470/1032 0/5 JoinFreeModules-PT-0200-UpperBounds-07 128239124 t fired, 129 attempts, .
34 BOUND STEQ 470/1032 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 90/1222 0/5 JoinFreeModules-PT-0200-UpperBounds-11 20851234 t fired, 21 attempts, .
39 BOUND FNDP 30/826 0/5 JoinFreeModules-PT-0200-UpperBounds-00 8740198 t fired, 9 attempts, .

Time elapsed: 1076 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 475/1027 0/5 JoinFreeModules-PT-0200-UpperBounds-07 129428708 t fired, 130 attempts, .
34 BOUND STEQ 475/1027 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 95/1217 0/5 JoinFreeModules-PT-0200-UpperBounds-11 22047059 t fired, 23 attempts, .
39 BOUND FNDP 35/821 0/5 JoinFreeModules-PT-0200-UpperBounds-00 10119963 t fired, 11 attempts, .

Time elapsed: 1081 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 480/1022 0/5 JoinFreeModules-PT-0200-UpperBounds-07 130578619 t fired, 131 attempts, .
34 BOUND STEQ 480/1022 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 100/1212 0/5 JoinFreeModules-PT-0200-UpperBounds-11 23195371 t fired, 24 attempts, .
39 BOUND FNDP 40/816 0/5 JoinFreeModules-PT-0200-UpperBounds-00 11488381 t fired, 12 attempts, .

Time elapsed: 1086 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 485/1017 0/5 JoinFreeModules-PT-0200-UpperBounds-07 131724299 t fired, 132 attempts, .
34 BOUND STEQ 485/1017 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 105/1207 0/5 JoinFreeModules-PT-0200-UpperBounds-11 24350458 t fired, 25 attempts, .
39 BOUND FNDP 45/811 0/5 JoinFreeModules-PT-0200-UpperBounds-00 12851760 t fired, 13 attempts, .

Time elapsed: 1091 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 490/1012 0/5 JoinFreeModules-PT-0200-UpperBounds-07 132874494 t fired, 133 attempts, .
34 BOUND STEQ 490/1012 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 110/1202 0/5 JoinFreeModules-PT-0200-UpperBounds-11 25507707 t fired, 26 attempts, .
39 BOUND FNDP 50/806 0/5 JoinFreeModules-PT-0200-UpperBounds-00 14211268 t fired, 15 attempts, .

Time elapsed: 1096 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 495/1007 0/5 JoinFreeModules-PT-0200-UpperBounds-07 134019505 t fired, 135 attempts, .
34 BOUND STEQ 495/1007 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 115/1197 0/5 JoinFreeModules-PT-0200-UpperBounds-11 26659593 t fired, 27 attempts, .
39 BOUND FNDP 55/801 0/5 JoinFreeModules-PT-0200-UpperBounds-00 15576482 t fired, 16 attempts, .

Time elapsed: 1101 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 500/1002 0/5 JoinFreeModules-PT-0200-UpperBounds-07 135163239 t fired, 136 attempts, .
34 BOUND STEQ 500/1002 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 120/1192 0/5 JoinFreeModules-PT-0200-UpperBounds-11 27802292 t fired, 28 attempts, .
39 BOUND FNDP 60/796 0/5 JoinFreeModules-PT-0200-UpperBounds-00 16945289 t fired, 17 attempts, .

Time elapsed: 1106 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 505/997 0/5 JoinFreeModules-PT-0200-UpperBounds-07 136289269 t fired, 137 attempts, .
34 BOUND STEQ 505/997 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 125/1187 0/5 JoinFreeModules-PT-0200-UpperBounds-11 28944088 t fired, 29 attempts, .
39 BOUND FNDP 65/791 0/5 JoinFreeModules-PT-0200-UpperBounds-00 18312164 t fired, 19 attempts, .

Time elapsed: 1111 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 510/992 0/5 JoinFreeModules-PT-0200-UpperBounds-07 137413207 t fired, 138 attempts, .
34 BOUND STEQ 510/992 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 130/1182 0/5 JoinFreeModules-PT-0200-UpperBounds-11 30079979 t fired, 31 attempts, .
39 BOUND FNDP 70/786 0/5 JoinFreeModules-PT-0200-UpperBounds-00 19697618 t fired, 20 attempts, .

Time elapsed: 1116 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 515/987 0/5 JoinFreeModules-PT-0200-UpperBounds-07 138560047 t fired, 139 attempts, .
34 BOUND STEQ 515/987 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 135/1177 0/5 JoinFreeModules-PT-0200-UpperBounds-11 31210495 t fired, 32 attempts, .
39 BOUND FNDP 75/781 0/5 JoinFreeModules-PT-0200-UpperBounds-00 21081583 t fired, 22 attempts, .

Time elapsed: 1121 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 520/982 0/5 JoinFreeModules-PT-0200-UpperBounds-07 139851808 t fired, 140 attempts, .
34 BOUND STEQ 520/982 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 140/1172 0/5 JoinFreeModules-PT-0200-UpperBounds-11 32614372 t fired, 33 attempts, .
39 BOUND FNDP 80/776 0/5 JoinFreeModules-PT-0200-UpperBounds-00 23154825 t fired, 24 attempts, .

Time elapsed: 1126 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 525/977 0/5 JoinFreeModules-PT-0200-UpperBounds-07 141957348 t fired, 142 attempts, .
34 BOUND STEQ 525/977 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 145/1167 0/5 JoinFreeModules-PT-0200-UpperBounds-11 33825236 t fired, 34 attempts, .
39 BOUND FNDP 85/771 0/5 JoinFreeModules-PT-0200-UpperBounds-00 24916953 t fired, 25 attempts, .

Time elapsed: 1131 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 530/972 0/5 JoinFreeModules-PT-0200-UpperBounds-07 143687847 t fired, 144 attempts, .
34 BOUND STEQ 530/972 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 150/1162 0/5 JoinFreeModules-PT-0200-UpperBounds-11 35060295 t fired, 36 attempts, .
39 BOUND FNDP 90/766 0/5 JoinFreeModules-PT-0200-UpperBounds-00 26887071 t fired, 27 attempts, .

Time elapsed: 1136 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 535/967 0/5 JoinFreeModules-PT-0200-UpperBounds-07 145164511 t fired, 146 attempts, .
34 BOUND STEQ 535/967 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 155/1157 0/5 JoinFreeModules-PT-0200-UpperBounds-11 36908595 t fired, 37 attempts, .
39 BOUND FNDP 95/761 0/5 JoinFreeModules-PT-0200-UpperBounds-00 28496940 t fired, 29 attempts, .

Time elapsed: 1141 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 540/962 0/5 JoinFreeModules-PT-0200-UpperBounds-07 147543275 t fired, 148 attempts, .
34 BOUND STEQ 540/962 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 160/1152 0/5 JoinFreeModules-PT-0200-UpperBounds-11 38267386 t fired, 39 attempts, .
39 BOUND FNDP 100/756 0/5 JoinFreeModules-PT-0200-UpperBounds-00 29813114 t fired, 30 attempts, .

Time elapsed: 1146 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 545/957 0/5 JoinFreeModules-PT-0200-UpperBounds-07 149292314 t fired, 150 attempts, .
34 BOUND STEQ 545/957 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 165/1147 0/5 JoinFreeModules-PT-0200-UpperBounds-11 39505591 t fired, 40 attempts, .
39 BOUND FNDP 105/751 0/5 JoinFreeModules-PT-0200-UpperBounds-00 31795946 t fired, 32 attempts, .

Time elapsed: 1151 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 550/952 0/5 JoinFreeModules-PT-0200-UpperBounds-07 151072583 t fired, 152 attempts, .
34 BOUND STEQ 550/952 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 170/1142 0/5 JoinFreeModules-PT-0200-UpperBounds-11 41111345 t fired, 42 attempts, .
39 BOUND FNDP 110/746 0/5 JoinFreeModules-PT-0200-UpperBounds-00 33546600 t fired, 34 attempts, .

Time elapsed: 1156 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 555/947 0/5 JoinFreeModules-PT-0200-UpperBounds-07 152935430 t fired, 153 attempts, .
34 BOUND STEQ 555/947 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 175/1137 0/5 JoinFreeModules-PT-0200-UpperBounds-11 42394394 t fired, 43 attempts, .
39 BOUND FNDP 115/741 0/5 JoinFreeModules-PT-0200-UpperBounds-00 35320628 t fired, 36 attempts, .

Time elapsed: 1161 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 560/942 0/5 JoinFreeModules-PT-0200-UpperBounds-07 154506184 t fired, 155 attempts, .
34 BOUND STEQ 560/942 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 180/1132 0/5 JoinFreeModules-PT-0200-UpperBounds-11 43710180 t fired, 44 attempts, .
39 BOUND FNDP 120/736 0/5 JoinFreeModules-PT-0200-UpperBounds-00 37381444 t fired, 38 attempts, .

Time elapsed: 1166 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 565/937 0/5 JoinFreeModules-PT-0200-UpperBounds-07 156850372 t fired, 157 attempts, .
34 BOUND STEQ 565/937 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 185/1127 0/5 JoinFreeModules-PT-0200-UpperBounds-11 45129002 t fired, 46 attempts, .
39 BOUND FNDP 125/731 0/5 JoinFreeModules-PT-0200-UpperBounds-00 38593091 t fired, 39 attempts, .

Time elapsed: 1171 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 570/932 0/5 JoinFreeModules-PT-0200-UpperBounds-07 158115724 t fired, 159 attempts, .
34 BOUND STEQ 570/932 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 190/1122 0/5 JoinFreeModules-PT-0200-UpperBounds-11 47581086 t fired, 48 attempts, .
39 BOUND FNDP 130/726 0/5 JoinFreeModules-PT-0200-UpperBounds-00 39821078 t fired, 40 attempts, .

Time elapsed: 1176 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 575/927 0/5 JoinFreeModules-PT-0200-UpperBounds-07 159795325 t fired, 160 attempts, .
34 BOUND STEQ 575/927 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 195/1117 0/5 JoinFreeModules-PT-0200-UpperBounds-11 49232368 t fired, 50 attempts, .
39 BOUND FNDP 135/721 0/5 JoinFreeModules-PT-0200-UpperBounds-00 41395748 t fired, 42 attempts, .

Time elapsed: 1181 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 580/922 0/5 JoinFreeModules-PT-0200-UpperBounds-07 161166351 t fired, 162 attempts, .
34 BOUND STEQ 580/922 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 200/1112 0/5 JoinFreeModules-PT-0200-UpperBounds-11 50592095 t fired, 51 attempts, .
39 BOUND FNDP 140/716 0/5 JoinFreeModules-PT-0200-UpperBounds-00 43620944 t fired, 44 attempts, .

Time elapsed: 1186 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 585/917 0/5 JoinFreeModules-PT-0200-UpperBounds-07 162715429 t fired, 163 attempts, .
34 BOUND STEQ 585/917 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 205/1107 0/5 JoinFreeModules-PT-0200-UpperBounds-11 51929341 t fired, 52 attempts, .
39 BOUND FNDP 145/711 0/5 JoinFreeModules-PT-0200-UpperBounds-00 45733749 t fired, 46 attempts, .

Time elapsed: 1191 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 590/912 0/5 JoinFreeModules-PT-0200-UpperBounds-07 164326129 t fired, 165 attempts, .
34 BOUND STEQ 590/912 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 210/1102 0/5 JoinFreeModules-PT-0200-UpperBounds-11 53832081 t fired, 54 attempts, .
39 BOUND FNDP 150/706 0/5 JoinFreeModules-PT-0200-UpperBounds-00 47271558 t fired, 48 attempts, .

Time elapsed: 1196 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 595/907 0/5 JoinFreeModules-PT-0200-UpperBounds-07 166188123 t fired, 167 attempts, .
34 BOUND STEQ 595/907 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 215/1097 0/5 JoinFreeModules-PT-0200-UpperBounds-11 55540117 t fired, 56 attempts, .
39 BOUND FNDP 155/701 0/5 JoinFreeModules-PT-0200-UpperBounds-00 48803509 t fired, 49 attempts, .

Time elapsed: 1201 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 600/902 0/5 JoinFreeModules-PT-0200-UpperBounds-07 168102202 t fired, 169 attempts, .
34 BOUND STEQ 600/902 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 220/1092 0/5 JoinFreeModules-PT-0200-UpperBounds-11 56799379 t fired, 57 attempts, .
39 BOUND FNDP 160/696 0/5 JoinFreeModules-PT-0200-UpperBounds-00 50622396 t fired, 51 attempts, .

Time elapsed: 1206 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 605/897 0/5 JoinFreeModules-PT-0200-UpperBounds-07 169488567 t fired, 170 attempts, .
34 BOUND STEQ 605/897 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 225/1087 0/5 JoinFreeModules-PT-0200-UpperBounds-11 58101027 t fired, 59 attempts, .
39 BOUND FNDP 165/691 0/5 JoinFreeModules-PT-0200-UpperBounds-00 51905557 t fired, 52 attempts, .

Time elapsed: 1211 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 610/892 0/5 JoinFreeModules-PT-0200-UpperBounds-07 170949043 t fired, 171 attempts, .
34 BOUND STEQ 610/892 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 230/1082 0/5 JoinFreeModules-PT-0200-UpperBounds-11 59192746 t fired, 60 attempts, .
39 BOUND FNDP 170/686 0/5 JoinFreeModules-PT-0200-UpperBounds-00 52917070 t fired, 53 attempts, .

Time elapsed: 1216 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 615/887 0/5 JoinFreeModules-PT-0200-UpperBounds-07 172394313 t fired, 173 attempts, .
34 BOUND STEQ 615/887 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 235/1077 0/5 JoinFreeModules-PT-0200-UpperBounds-11 60294259 t fired, 61 attempts, .
39 BOUND FNDP 175/681 0/5 JoinFreeModules-PT-0200-UpperBounds-00 53933288 t fired, 54 attempts, .

Time elapsed: 1221 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 620/882 0/5 JoinFreeModules-PT-0200-UpperBounds-07 173674079 t fired, 174 attempts, .
34 BOUND STEQ 620/882 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 240/1072 0/5 JoinFreeModules-PT-0200-UpperBounds-11 61726103 t fired, 62 attempts, .
39 BOUND FNDP 180/676 0/5 JoinFreeModules-PT-0200-UpperBounds-00 54922139 t fired, 55 attempts, .

Time elapsed: 1226 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 625/877 0/5 JoinFreeModules-PT-0200-UpperBounds-07 175070485 t fired, 176 attempts, .
34 BOUND STEQ 625/877 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 245/1067 0/5 JoinFreeModules-PT-0200-UpperBounds-11 62881799 t fired, 63 attempts, .
39 BOUND FNDP 185/671 0/5 JoinFreeModules-PT-0200-UpperBounds-00 55930271 t fired, 56 attempts, .

Time elapsed: 1231 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 630/872 0/5 JoinFreeModules-PT-0200-UpperBounds-07 176360850 t fired, 177 attempts, .
34 BOUND STEQ 630/872 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 250/1062 0/5 JoinFreeModules-PT-0200-UpperBounds-11 64230174 t fired, 65 attempts, .
39 BOUND FNDP 190/666 0/5 JoinFreeModules-PT-0200-UpperBounds-00 56953370 t fired, 57 attempts, .

Time elapsed: 1236 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 635/867 0/5 JoinFreeModules-PT-0200-UpperBounds-07 177795872 t fired, 178 attempts, .
34 BOUND STEQ 635/867 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 255/1057 0/5 JoinFreeModules-PT-0200-UpperBounds-11 65321174 t fired, 66 attempts, .
39 BOUND FNDP 195/661 0/5 JoinFreeModules-PT-0200-UpperBounds-00 57979716 t fired, 58 attempts, .

Time elapsed: 1241 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 640/862 0/5 JoinFreeModules-PT-0200-UpperBounds-07 179212116 t fired, 180 attempts, .
34 BOUND STEQ 640/862 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 260/1052 0/5 JoinFreeModules-PT-0200-UpperBounds-11 66419575 t fired, 67 attempts, .
39 BOUND FNDP 200/656 0/5 JoinFreeModules-PT-0200-UpperBounds-00 59029640 t fired, 60 attempts, .

Time elapsed: 1246 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 645/857 0/5 JoinFreeModules-PT-0200-UpperBounds-07 180614540 t fired, 181 attempts, .
34 BOUND STEQ 645/857 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 265/1047 0/5 JoinFreeModules-PT-0200-UpperBounds-11 67526215 t fired, 68 attempts, .
39 BOUND FNDP 205/651 0/5 JoinFreeModules-PT-0200-UpperBounds-00 60082935 t fired, 61 attempts, .

Time elapsed: 1251 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 650/852 0/5 JoinFreeModules-PT-0200-UpperBounds-07 182014379 t fired, 183 attempts, .
34 BOUND STEQ 650/852 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 270/1042 0/5 JoinFreeModules-PT-0200-UpperBounds-11 68638334 t fired, 69 attempts, .
39 BOUND FNDP 210/646 0/5 JoinFreeModules-PT-0200-UpperBounds-00 61138759 t fired, 62 attempts, .

Time elapsed: 1256 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 655/847 0/5 JoinFreeModules-PT-0200-UpperBounds-07 183395531 t fired, 184 attempts, .
34 BOUND STEQ 655/847 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 275/1037 0/5 JoinFreeModules-PT-0200-UpperBounds-11 69765776 t fired, 70 attempts, .
39 BOUND FNDP 215/641 0/5 JoinFreeModules-PT-0200-UpperBounds-00 62202750 t fired, 63 attempts, .

Time elapsed: 1261 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 660/842 0/5 JoinFreeModules-PT-0200-UpperBounds-07 184790777 t fired, 185 attempts, .
34 BOUND STEQ 660/842 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 280/1032 0/5 JoinFreeModules-PT-0200-UpperBounds-11 70884888 t fired, 71 attempts, .
39 BOUND FNDP 220/636 0/5 JoinFreeModules-PT-0200-UpperBounds-00 63264265 t fired, 64 attempts, .

Time elapsed: 1266 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 665/837 0/5 JoinFreeModules-PT-0200-UpperBounds-07 186168175 t fired, 187 attempts, .
34 BOUND STEQ 665/837 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 285/1027 0/5 JoinFreeModules-PT-0200-UpperBounds-11 72082067 t fired, 73 attempts, .
39 BOUND FNDP 225/631 0/5 JoinFreeModules-PT-0200-UpperBounds-00 64366904 t fired, 65 attempts, .

Time elapsed: 1271 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 670/832 0/5 JoinFreeModules-PT-0200-UpperBounds-07 187548938 t fired, 188 attempts, .
34 BOUND STEQ 670/832 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 290/1022 0/5 JoinFreeModules-PT-0200-UpperBounds-11 73459712 t fired, 74 attempts, .
39 BOUND FNDP 230/626 0/5 JoinFreeModules-PT-0200-UpperBounds-00 65500169 t fired, 66 attempts, .

Time elapsed: 1276 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 675/827 0/5 JoinFreeModules-PT-0200-UpperBounds-07 188943879 t fired, 189 attempts, .
34 BOUND STEQ 675/827 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 295/1017 0/5 JoinFreeModules-PT-0200-UpperBounds-11 74568051 t fired, 75 attempts, .
39 BOUND FNDP 235/621 0/5 JoinFreeModules-PT-0200-UpperBounds-00 66557536 t fired, 67 attempts, .

Time elapsed: 1281 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 680/822 0/5 JoinFreeModules-PT-0200-UpperBounds-07 190361926 t fired, 191 attempts, .
34 BOUND STEQ 680/822 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 300/1012 0/5 JoinFreeModules-PT-0200-UpperBounds-11 75665580 t fired, 76 attempts, .
39 BOUND FNDP 240/616 0/5 JoinFreeModules-PT-0200-UpperBounds-00 67612936 t fired, 68 attempts, .

Time elapsed: 1286 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 685/817 0/5 JoinFreeModules-PT-0200-UpperBounds-07 191815857 t fired, 192 attempts, .
34 BOUND STEQ 685/817 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 305/1007 0/5 JoinFreeModules-PT-0200-UpperBounds-11 76758114 t fired, 77 attempts, .
39 BOUND FNDP 245/611 0/5 JoinFreeModules-PT-0200-UpperBounds-00 68667770 t fired, 69 attempts, .

Time elapsed: 1291 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 690/812 0/5 JoinFreeModules-PT-0200-UpperBounds-07 193655726 t fired, 194 attempts, .
34 BOUND STEQ 690/812 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 310/1002 0/5 JoinFreeModules-PT-0200-UpperBounds-11 77821959 t fired, 78 attempts, .
39 BOUND FNDP 250/606 0/5 JoinFreeModules-PT-0200-UpperBounds-00 69694024 t fired, 70 attempts, .

Time elapsed: 1296 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 695/807 0/5 JoinFreeModules-PT-0200-UpperBounds-07 195497104 t fired, 196 attempts, .
34 BOUND STEQ 695/807 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 315/997 0/5 JoinFreeModules-PT-0200-UpperBounds-11 78882613 t fired, 79 attempts, .
39 BOUND FNDP 255/601 0/5 JoinFreeModules-PT-0200-UpperBounds-00 70724058 t fired, 71 attempts, .

Time elapsed: 1301 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 700/802 0/5 JoinFreeModules-PT-0200-UpperBounds-07 197446775 t fired, 198 attempts, .
34 BOUND STEQ 700/802 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 320/992 0/5 JoinFreeModules-PT-0200-UpperBounds-11 79889047 t fired, 80 attempts, .
39 BOUND FNDP 260/596 0/5 JoinFreeModules-PT-0200-UpperBounds-00 71703561 t fired, 72 attempts, .

Time elapsed: 1306 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 705/797 0/5 JoinFreeModules-PT-0200-UpperBounds-07 199450950 t fired, 200 attempts, .
34 BOUND STEQ 705/797 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 325/987 0/5 JoinFreeModules-PT-0200-UpperBounds-11 80863652 t fired, 81 attempts, .
39 BOUND FNDP 265/591 0/5 JoinFreeModules-PT-0200-UpperBounds-00 72655725 t fired, 73 attempts, .

Time elapsed: 1311 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 710/792 0/5 JoinFreeModules-PT-0200-UpperBounds-07 201197500 t fired, 202 attempts, .
34 BOUND STEQ 710/792 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 330/982 0/5 JoinFreeModules-PT-0200-UpperBounds-11 82309302 t fired, 83 attempts, .
39 BOUND FNDP 270/586 0/5 JoinFreeModules-PT-0200-UpperBounds-00 73701381 t fired, 74 attempts, .

Time elapsed: 1316 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 715/787 0/5 JoinFreeModules-PT-0200-UpperBounds-07 202683008 t fired, 203 attempts, .
34 BOUND STEQ 715/787 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 335/977 0/5 JoinFreeModules-PT-0200-UpperBounds-11 84005248 t fired, 85 attempts, .
39 BOUND FNDP 275/581 0/5 JoinFreeModules-PT-0200-UpperBounds-00 75409603 t fired, 76 attempts, .

Time elapsed: 1321 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 720/782 0/5 JoinFreeModules-PT-0200-UpperBounds-07 203970012 t fired, 204 attempts, .
34 BOUND STEQ 720/782 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 340/972 0/5 JoinFreeModules-PT-0200-UpperBounds-11 85251281 t fired, 86 attempts, .
39 BOUND FNDP 280/576 0/5 JoinFreeModules-PT-0200-UpperBounds-00 77733420 t fired, 78 attempts, .

Time elapsed: 1326 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 725/777 0/5 JoinFreeModules-PT-0200-UpperBounds-07 205617480 t fired, 206 attempts, .
34 BOUND STEQ 725/777 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 345/967 0/5 JoinFreeModules-PT-0200-UpperBounds-11 86776445 t fired, 87 attempts, .
39 BOUND FNDP 285/571 0/5 JoinFreeModules-PT-0200-UpperBounds-00 78942209 t fired, 79 attempts, .

Time elapsed: 1331 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 730/772 0/5 JoinFreeModules-PT-0200-UpperBounds-07 207600177 t fired, 208 attempts, .
34 BOUND STEQ 730/772 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 350/962 0/5 JoinFreeModules-PT-0200-UpperBounds-11 87758959 t fired, 88 attempts, .
39 BOUND FNDP 290/566 0/5 JoinFreeModules-PT-0200-UpperBounds-00 79900237 t fired, 80 attempts, .

Time elapsed: 1336 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 735/767 0/5 JoinFreeModules-PT-0200-UpperBounds-07 209564039 t fired, 210 attempts, .
34 BOUND STEQ 735/767 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 355/957 0/5 JoinFreeModules-PT-0200-UpperBounds-11 88753716 t fired, 89 attempts, .
39 BOUND FNDP 295/561 0/5 JoinFreeModules-PT-0200-UpperBounds-00 80856508 t fired, 81 attempts, .

Time elapsed: 1341 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 740/762 0/5 JoinFreeModules-PT-0200-UpperBounds-07 211532285 t fired, 212 attempts, .
34 BOUND STEQ 740/762 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 360/952 0/5 JoinFreeModules-PT-0200-UpperBounds-11 89741131 t fired, 90 attempts, .
39 BOUND FNDP 300/556 0/5 JoinFreeModules-PT-0200-UpperBounds-00 81803166 t fired, 82 attempts, .

Time elapsed: 1346 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 745/757 0/5 JoinFreeModules-PT-0200-UpperBounds-07 213492197 t fired, 214 attempts, .
34 BOUND STEQ 745/757 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 365/947 0/5 JoinFreeModules-PT-0200-UpperBounds-11 90718911 t fired, 91 attempts, .
39 BOUND FNDP 305/551 0/5 JoinFreeModules-PT-0200-UpperBounds-00 82752332 t fired, 83 attempts, .

Time elapsed: 1351 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 2 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
33 BOUND FNDP 750/752 0/5 JoinFreeModules-PT-0200-UpperBounds-07 215449239 t fired, 216 attempts, .
34 BOUND STEQ 750/752 0/5 JoinFreeModules-PT-0200-UpperBounds-07 --
36 BOUND FNDP 370/942 0/5 JoinFreeModules-PT-0200-UpperBounds-11 91689529 t fired, 92 attempts, .
39 BOUND FNDP 310/546 0/5 JoinFreeModules-PT-0200-UpperBounds-00 83696715 t fired, 84 attempts, .

Time elapsed: 1356 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: CANCELED task # 33 (type FNDP) for JoinFreeModules-PT-0200-UpperBounds-07 (local timeout)
lola: CANCELED task # 34 (type EQUN) for JoinFreeModules-PT-0200-UpperBounds-07 (local timeout)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 1 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 1 2 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
36 BOUND FNDP 375/937 0/5 JoinFreeModules-PT-0200-UpperBounds-11 92662970 t fired, 93 attempts, .
39 BOUND FNDP 315/541 0/5 JoinFreeModules-PT-0200-UpperBounds-00 84639018 t fired, 85 attempts, .

Time elapsed: 1361 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
lola: LAUNCH task # 25 (type EQUN) for 6 JoinFreeModules-PT-0200-UpperBounds-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type EQUN) for 3 JoinFreeModules-PT-0200-UpperBounds-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 34 (type EQUN) for JoinFreeModules-PT-0200-UpperBounds-07
lola: result : unknown
lola: time used : 755.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/377/UpperBounds-25.sara.
sara: try reading problem file /home/mcc/execution/377/UpperBounds-28.sara.
sara: warning, failure of lp_solve (at job 5)
sara: warning, failure of lp_solve (at job 5)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 5/1119 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 5/1119 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 380/2239 0/5 JoinFreeModules-PT-0200-UpperBounds-11 95143730 t fired, 96 attempts, .
39 BOUND FNDP 320/962 0/5 JoinFreeModules-PT-0200-UpperBounds-00 86828459 t fired, 87 attempts, .

Time elapsed: 1366 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 10/1114 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 10/1114 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 385/2234 0/5 JoinFreeModules-PT-0200-UpperBounds-11 97685804 t fired, 98 attempts, .
39 BOUND FNDP 325/957 0/5 JoinFreeModules-PT-0200-UpperBounds-00 89066335 t fired, 90 attempts, .

Time elapsed: 1371 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 15/1109 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 15/1109 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 390/2229 0/5 JoinFreeModules-PT-0200-UpperBounds-11 100227817 t fired, 101 attempts, .
39 BOUND FNDP 330/952 0/5 JoinFreeModules-PT-0200-UpperBounds-00 91337659 t fired, 92 attempts, .

Time elapsed: 1376 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 20/1104 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 20/1104 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 395/2224 0/5 JoinFreeModules-PT-0200-UpperBounds-11 102783464 t fired, 103 attempts, .
39 BOUND FNDP 335/947 0/5 JoinFreeModules-PT-0200-UpperBounds-00 93591843 t fired, 94 attempts, .

Time elapsed: 1381 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 25/1099 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 25/1099 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 400/2219 0/5 JoinFreeModules-PT-0200-UpperBounds-11 105310867 t fired, 106 attempts, .
39 BOUND FNDP 340/942 0/5 JoinFreeModules-PT-0200-UpperBounds-00 95834495 t fired, 96 attempts, .

Time elapsed: 1386 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 30/1094 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 30/1094 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 405/2214 0/5 JoinFreeModules-PT-0200-UpperBounds-11 107833144 t fired, 108 attempts, .
39 BOUND FNDP 345/937 0/5 JoinFreeModules-PT-0200-UpperBounds-00 98068119 t fired, 99 attempts, .

Time elapsed: 1391 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 35/1089 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 35/1089 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 410/2209 0/5 JoinFreeModules-PT-0200-UpperBounds-11 110346227 t fired, 111 attempts, .
39 BOUND FNDP 350/932 0/5 JoinFreeModules-PT-0200-UpperBounds-00 100278095 t fired, 101 attempts, .

Time elapsed: 1396 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 40/1084 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 40/1084 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 415/2204 0/5 JoinFreeModules-PT-0200-UpperBounds-11 112855692 t fired, 113 attempts, .
39 BOUND FNDP 355/927 0/5 JoinFreeModules-PT-0200-UpperBounds-00 102484964 t fired, 103 attempts, .

Time elapsed: 1401 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 45/1079 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 45/1079 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 420/2199 0/5 JoinFreeModules-PT-0200-UpperBounds-11 115351744 t fired, 116 attempts, .
39 BOUND FNDP 360/922 0/5 JoinFreeModules-PT-0200-UpperBounds-00 104696198 t fired, 105 attempts, .

Time elapsed: 1406 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 50/1074 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 50/1074 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 425/2194 0/5 JoinFreeModules-PT-0200-UpperBounds-11 117836561 t fired, 118 attempts, .
39 BOUND FNDP 365/917 0/5 JoinFreeModules-PT-0200-UpperBounds-00 106912169 t fired, 107 attempts, .

Time elapsed: 1411 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 55/1069 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 55/1069 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 430/2189 0/5 JoinFreeModules-PT-0200-UpperBounds-11 120336239 t fired, 121 attempts, .
39 BOUND FNDP 370/912 0/5 JoinFreeModules-PT-0200-UpperBounds-00 109125100 t fired, 110 attempts, .

Time elapsed: 1416 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 60/1064 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 60/1064 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 435/2184 0/5 JoinFreeModules-PT-0200-UpperBounds-11 122839239 t fired, 123 attempts, .
39 BOUND FNDP 375/907 0/5 JoinFreeModules-PT-0200-UpperBounds-00 111329815 t fired, 112 attempts, .

Time elapsed: 1421 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 65/1059 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 65/1059 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 440/2179 0/5 JoinFreeModules-PT-0200-UpperBounds-11 125317383 t fired, 126 attempts, .
39 BOUND FNDP 380/902 0/5 JoinFreeModules-PT-0200-UpperBounds-00 113527806 t fired, 114 attempts, .

Time elapsed: 1426 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 70/1054 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 70/1054 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 445/2174 0/5 JoinFreeModules-PT-0200-UpperBounds-11 127802910 t fired, 128 attempts, .
39 BOUND FNDP 385/897 0/5 JoinFreeModules-PT-0200-UpperBounds-00 115700002 t fired, 116 attempts, .

Time elapsed: 1431 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 75/1049 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 75/1049 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 450/2169 0/5 JoinFreeModules-PT-0200-UpperBounds-11 130285071 t fired, 131 attempts, .
39 BOUND FNDP 390/892 0/5 JoinFreeModules-PT-0200-UpperBounds-00 117923662 t fired, 118 attempts, .

Time elapsed: 1436 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 80/1044 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 80/1044 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 455/2164 0/5 JoinFreeModules-PT-0200-UpperBounds-11 132743526 t fired, 133 attempts, .
39 BOUND FNDP 395/887 0/5 JoinFreeModules-PT-0200-UpperBounds-00 120142091 t fired, 121 attempts, .

Time elapsed: 1441 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 85/1039 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 85/1039 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 460/2159 0/5 JoinFreeModules-PT-0200-UpperBounds-11 135226953 t fired, 136 attempts, .
39 BOUND FNDP 400/882 0/5 JoinFreeModules-PT-0200-UpperBounds-00 122383355 t fired, 123 attempts, .

Time elapsed: 1446 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 90/1034 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 90/1034 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 465/2154 0/5 JoinFreeModules-PT-0200-UpperBounds-11 137671529 t fired, 138 attempts, .
39 BOUND FNDP 405/877 0/5 JoinFreeModules-PT-0200-UpperBounds-00 124614900 t fired, 125 attempts, .

Time elapsed: 1451 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 95/1029 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 95/1029 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 470/2149 0/5 JoinFreeModules-PT-0200-UpperBounds-11 140127180 t fired, 141 attempts, .
39 BOUND FNDP 410/872 0/5 JoinFreeModules-PT-0200-UpperBounds-00 126863705 t fired, 127 attempts, .

Time elapsed: 1456 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 100/1024 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 100/1024 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 475/2144 0/5 JoinFreeModules-PT-0200-UpperBounds-11 142589898 t fired, 143 attempts, .
39 BOUND FNDP 415/867 0/5 JoinFreeModules-PT-0200-UpperBounds-00 129088963 t fired, 130 attempts, .

Time elapsed: 1461 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 105/1019 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 105/1019 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 480/2139 0/5 JoinFreeModules-PT-0200-UpperBounds-11 145030837 t fired, 146 attempts, .
39 BOUND FNDP 420/862 0/5 JoinFreeModules-PT-0200-UpperBounds-00 131294187 t fired, 132 attempts, .

Time elapsed: 1466 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 110/1014 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 110/1014 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 485/2134 0/5 JoinFreeModules-PT-0200-UpperBounds-11 147490569 t fired, 148 attempts, .
39 BOUND FNDP 425/857 0/5 JoinFreeModules-PT-0200-UpperBounds-00 133525357 t fired, 134 attempts, .

Time elapsed: 1471 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 115/1009 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 115/1009 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 490/2129 0/5 JoinFreeModules-PT-0200-UpperBounds-11 149910196 t fired, 150 attempts, .
39 BOUND FNDP 430/852 0/5 JoinFreeModules-PT-0200-UpperBounds-00 135729080 t fired, 136 attempts, .

Time elapsed: 1476 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 120/1004 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 120/1004 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 495/2124 0/5 JoinFreeModules-PT-0200-UpperBounds-11 152316280 t fired, 153 attempts, .
39 BOUND FNDP 435/847 0/5 JoinFreeModules-PT-0200-UpperBounds-00 137907267 t fired, 138 attempts, .

Time elapsed: 1481 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 125/999 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 125/999 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 500/2119 0/5 JoinFreeModules-PT-0200-UpperBounds-11 154742207 t fired, 155 attempts, .
39 BOUND FNDP 440/842 0/5 JoinFreeModules-PT-0200-UpperBounds-00 140117389 t fired, 141 attempts, .

Time elapsed: 1486 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 130/994 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 130/994 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 505/2114 0/5 JoinFreeModules-PT-0200-UpperBounds-11 157184661 t fired, 158 attempts, .
39 BOUND FNDP 445/837 0/5 JoinFreeModules-PT-0200-UpperBounds-00 142338759 t fired, 143 attempts, .

Time elapsed: 1491 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 135/989 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 135/989 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 510/2109 0/5 JoinFreeModules-PT-0200-UpperBounds-11 159578389 t fired, 160 attempts, .
39 BOUND FNDP 450/832 0/5 JoinFreeModules-PT-0200-UpperBounds-00 144524639 t fired, 145 attempts, .

Time elapsed: 1496 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 140/984 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 140/984 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 515/2104 0/5 JoinFreeModules-PT-0200-UpperBounds-11 161981943 t fired, 162 attempts, .
39 BOUND FNDP 455/827 0/5 JoinFreeModules-PT-0200-UpperBounds-00 146714613 t fired, 147 attempts, .

Time elapsed: 1501 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 145/979 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 145/979 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 520/2099 0/5 JoinFreeModules-PT-0200-UpperBounds-11 164400052 t fired, 165 attempts, .
39 BOUND FNDP 460/822 0/5 JoinFreeModules-PT-0200-UpperBounds-00 148909933 t fired, 149 attempts, .

Time elapsed: 1506 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 150/974 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 150/974 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 525/2094 0/5 JoinFreeModules-PT-0200-UpperBounds-11 166807722 t fired, 167 attempts, .
39 BOUND FNDP 465/817 0/5 JoinFreeModules-PT-0200-UpperBounds-00 151098318 t fired, 152 attempts, .

Time elapsed: 1511 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 155/969 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 155/969 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 530/2089 0/5 JoinFreeModules-PT-0200-UpperBounds-11 169232063 t fired, 170 attempts, .
39 BOUND FNDP 470/812 0/5 JoinFreeModules-PT-0200-UpperBounds-00 153304047 t fired, 154 attempts, .

Time elapsed: 1516 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 160/964 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 160/964 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 535/2084 0/5 JoinFreeModules-PT-0200-UpperBounds-11 171694643 t fired, 172 attempts, .
39 BOUND FNDP 475/807 0/5 JoinFreeModules-PT-0200-UpperBounds-00 155547088 t fired, 156 attempts, .

Time elapsed: 1521 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 165/959 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 165/959 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 540/2079 0/5 JoinFreeModules-PT-0200-UpperBounds-11 174144230 t fired, 175 attempts, .
39 BOUND FNDP 480/802 0/5 JoinFreeModules-PT-0200-UpperBounds-00 157783823 t fired, 158 attempts, .

Time elapsed: 1526 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 170/954 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 170/954 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 545/2074 0/5 JoinFreeModules-PT-0200-UpperBounds-11 176542064 t fired, 177 attempts, .
39 BOUND FNDP 485/797 0/5 JoinFreeModules-PT-0200-UpperBounds-00 159997385 t fired, 160 attempts, .

Time elapsed: 1531 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 175/949 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 175/949 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 550/2069 0/5 JoinFreeModules-PT-0200-UpperBounds-11 178931543 t fired, 179 attempts, .
39 BOUND FNDP 490/792 0/5 JoinFreeModules-PT-0200-UpperBounds-00 162197798 t fired, 163 attempts, .

Time elapsed: 1536 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 180/944 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 180/944 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 555/2064 0/5 JoinFreeModules-PT-0200-UpperBounds-11 181312136 t fired, 182 attempts, .
39 BOUND FNDP 495/787 0/5 JoinFreeModules-PT-0200-UpperBounds-00 164403348 t fired, 165 attempts, .

Time elapsed: 1541 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 185/939 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 185/939 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 560/2059 0/5 JoinFreeModules-PT-0200-UpperBounds-11 183728954 t fired, 184 attempts, .
39 BOUND FNDP 500/782 0/5 JoinFreeModules-PT-0200-UpperBounds-00 166619389 t fired, 167 attempts, .

Time elapsed: 1546 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 190/934 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --
28 BOUND STEQ 190/934 0/5 JoinFreeModules-PT-0200-UpperBounds-01 --
36 BOUND FNDP 565/2054 0/5 JoinFreeModules-PT-0200-UpperBounds-11 186144451 t fired, 187 attempts, .
39 BOUND FNDP 505/777 0/5 JoinFreeModules-PT-0200-UpperBounds-00 168841078 t fired, 169 attempts, .

Time elapsed: 1551 secs. Pages in use: 32
# running tasks: 4 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-0200-UpperBounds-00: BOUND 0 1 1 0 1 0 1 0
JoinFreeModules-PT-0200-UpperBounds-01: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-04: BOUND 0 0 1 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-07: BOUND 0 0 0 0 2 1 1 0
JoinFreeModules-PT-0200-UpperBounds-08: BOUND 0 0 0 0 1 1 1 0
JoinFreeModules-PT-0200-UpperBounds-11: BOUND 0 1 1 0 0 0 1 0
JoinFreeModules-PT-0200-UpperBounds-14: BOUND 0 1 0 0 0 1 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
25 BOUND STEQ 195/929 0/5 JoinFreeModules-PT-0200-UpperBounds-04 --

========== file over 1MB has been truncated ======
retrieve it from the run archives if needed

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-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is JoinFreeModules-PT-0200, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r231-tall-167856415700197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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