Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300072.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BugTracking-PT-q8m016, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300072
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 16M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748552076354

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 20:54:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-29 20:54:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:54:40] [INFO ] Load time of PNML (sax parser for PT used): 1593 ms
[2025-05-29 20:54:40] [INFO ] Transformed 754 places.
[2025-05-29 20:54:40] [INFO ] Transformed 27370 transitions.
[2025-05-29 20:54:40] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1968 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Deduced a syphon composed of 474 places in 170 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 20:54:41] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2025-05-29 20:54:41] [INFO ] Computed 10 invariants in 91 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
RANDOM walk for 10000 steps (32 resets) in 207 ms. (48 steps per ms)
BEST_FIRST walk for 80007 steps (46 resets) in 400 ms. (199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-05-29 20:54:42] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2025-05-29 20:54:42] [INFO ] Invariant cache hit.
[2025-05-29 20:54:42] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2025-05-29 20:54:43] [INFO ] [Real]Absence check using state equation in 1449 ms returned sat
[2025-05-29 20:54:44] [INFO ] State equation strengthened by 303 read => feed constraints.
[2025-05-29 20:54:44] [INFO ] [Real]Added 303 Read/Feed constraints in 343 ms returned sat
[2025-05-29 20:54:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:54:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 30 ms returned sat
[2025-05-29 20:54:46] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2025-05-29 20:54:46] [INFO ] [Nat]Added 303 Read/Feed constraints in 466 ms returned sat
[2025-05-29 20:54:47] [INFO ] Deduced a trap composed of 33 places in 1158 ms of which 61 ms to minimize.
[2025-05-29 20:54:49] [INFO ] Deduced a trap composed of 33 places in 1249 ms of which 5 ms to minimize.
[2025-05-29 20:54:50] [INFO ] Deduced a trap composed of 31 places in 884 ms of which 4 ms to minimize.
[2025-05-29 20:54:50] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:54:50] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2025-05-29 20:54:51] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2025-05-29 20:54:51] [INFO ] [Real]Added 303 Read/Feed constraints in 124 ms returned sat
[2025-05-29 20:54:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:54:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:54:53] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2025-05-29 20:54:53] [INFO ] [Nat]Added 303 Read/Feed constraints in 228 ms returned sat
[2025-05-29 20:54:53] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 569 ms.
[2025-05-29 20:54:54] [INFO ] Added : 6 causal constraints over 2 iterations in 1517 ms. Result :sat
Minimization took 1316 ms.
[2025-05-29 20:54:56] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:54:57] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2025-05-29 20:54:57] [INFO ] [Real]Added 303 Read/Feed constraints in 103 ms returned sat
[2025-05-29 20:54:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:54:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:54:58] [INFO ] [Nat]Absence check using state equation in 1200 ms returned sat
[2025-05-29 20:54:59] [INFO ] [Nat]Added 303 Read/Feed constraints in 350 ms returned sat
[2025-05-29 20:55:00] [INFO ] Deduced a trap composed of 12 places in 884 ms of which 5 ms to minimize.
[2025-05-29 20:55:01] [INFO ] Deduced a trap composed of 61 places in 854 ms of which 5 ms to minimize.
[2025-05-29 20:55:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2181 ms
[2025-05-29 20:55:01] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 554 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-29 20:55:02] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:55:03] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2025-05-29 20:55:03] [INFO ] [Real]Added 303 Read/Feed constraints in 95 ms returned sat
[2025-05-29 20:55:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2025-05-29 20:55:04] [INFO ] [Nat]Absence check using state equation in 1060 ms returned sat
[2025-05-29 20:55:05] [INFO ] [Nat]Added 303 Read/Feed constraints in 94 ms returned sat
[2025-05-29 20:55:05] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 457 ms.
[2025-05-29 20:55:07] [INFO ] Deduced a trap composed of 7 places in 589 ms of which 8 ms to minimize.
[2025-05-29 20:55:08] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 2 ms to minimize.
[2025-05-29 20:55:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1630 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-29 20:55:08] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:55:10] [INFO ] [Real]Absence check using state equation in 1276 ms returned sat
[2025-05-29 20:55:10] [INFO ] [Real]Added 303 Read/Feed constraints in 140 ms returned sat
[2025-05-29 20:55:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:55:11] [INFO ] [Nat]Absence check using state equation in 1087 ms returned sat
[2025-05-29 20:55:11] [INFO ] [Nat]Added 303 Read/Feed constraints in 175 ms returned sat
[2025-05-29 20:55:12] [INFO ] Deduced a trap composed of 26 places in 853 ms of which 15 ms to minimize.
[2025-05-29 20:55:14] [INFO ] Deduced a trap composed of 58 places in 1100 ms of which 4 ms to minimize.
[2025-05-29 20:55:15] [INFO ] Deduced a trap composed of 94 places in 1050 ms of which 4 ms to minimize.
[2025-05-29 20:55:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:55:15] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2025-05-29 20:55:16] [INFO ] [Real]Absence check using state equation in 974 ms returned sat
[2025-05-29 20:55:16] [INFO ] [Real]Added 303 Read/Feed constraints in 131 ms returned sat
[2025-05-29 20:55:17] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:55:18] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2025-05-29 20:55:18] [INFO ] [Nat]Added 303 Read/Feed constraints in 193 ms returned sat
[2025-05-29 20:55:19] [INFO ] Deduced a trap composed of 96 places in 878 ms of which 4 ms to minimize.
[2025-05-29 20:55:20] [INFO ] Deduced a trap composed of 65 places in 966 ms of which 3 ms to minimize.
[2025-05-29 20:55:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2187 ms
[2025-05-29 20:55:21] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 316 ms.
[2025-05-29 20:55:22] [INFO ] Deduced a trap composed of 19 places in 759 ms of which 3 ms to minimize.
[2025-05-29 20:55:22] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-05-29 20:55:22] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2025-05-29 20:55:23] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2025-05-29 20:55:23] [INFO ] [Real]Added 303 Read/Feed constraints in 111 ms returned sat
[2025-05-29 20:55:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2025-05-29 20:55:24] [INFO ] [Nat]Absence check using state equation in 1078 ms returned sat
[2025-05-29 20:55:24] [INFO ] [Nat]Added 303 Read/Feed constraints in 91 ms returned sat
[2025-05-29 20:55:25] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 367 ms.
[2025-05-29 20:55:25] [INFO ] Added : 2 causal constraints over 1 iterations in 817 ms. Result :sat
Minimization took 1550 ms.
[2025-05-29 20:55:27] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:55:28] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2025-05-29 20:55:28] [INFO ] [Real]Added 303 Read/Feed constraints in 128 ms returned sat
[2025-05-29 20:55:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:55:28] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2025-05-29 20:55:29] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2025-05-29 20:55:30] [INFO ] [Nat]Added 303 Read/Feed constraints in 500 ms returned sat
[2025-05-29 20:55:31] [INFO ] Deduced a trap composed of 71 places in 654 ms of which 4 ms to minimize.
[2025-05-29 20:55:32] [INFO ] Deduced a trap composed of 15 places in 783 ms of which 3 ms to minimize.
[2025-05-29 20:55:32] [INFO ] Deduced a trap composed of 57 places in 545 ms of which 3 ms to minimize.
[2025-05-29 20:55:33] [INFO ] Deduced a trap composed of 33 places in 544 ms of which 3 ms to minimize.
[2025-05-29 20:55:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3229 ms
[2025-05-29 20:55:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 724 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 755 ms. Remains : 269/280 places, 3871/3904 transitions.
[2025-05-29 20:55:34] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Found an invariant !
This invariant on transitions {2=1, 44=1, 3014=1, 3635=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 3014=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-05-29 20:55:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2025-05-29 20:55:36] [INFO ] Computed 8 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000014 steps (2 resets) in 4952 ms. (201 steps per ms)
BEST_FIRST walk for 8000007 steps (16 resets) in 19525 ms. (409 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-05-29 20:56:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:56:01] [INFO ] Invariant cache hit.
[2025-05-29 20:56:01] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:56:02] [INFO ] [Real]Absence check using state equation in 1086 ms returned sat
[2025-05-29 20:56:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:56:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:56:03] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2025-05-29 20:56:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 20:56:03] [INFO ] [Nat]Added 283 Read/Feed constraints in 262 ms returned sat
[2025-05-29 20:56:05] [INFO ] Deduced a trap composed of 52 places in 1176 ms of which 4 ms to minimize.
[2025-05-29 20:56:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1474 ms
[2025-05-29 20:56:05] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 380 ms.
[2025-05-29 20:56:06] [INFO ] Deduced a trap composed of 46 places in 544 ms of which 3 ms to minimize.
[2025-05-29 20:56:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 893 ms
[2025-05-29 20:56:07] [INFO ] Added : 4 causal constraints over 2 iterations in 2140 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:56:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:56:13] [INFO ] [Real]Absence check using state equation in 1074 ms returned sat
[2025-05-29 20:56:13] [INFO ] [Real]Added 283 Read/Feed constraints in 102 ms returned sat
[2025-05-29 20:56:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:56:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 20:56:14] [INFO ] [Nat]Absence check using state equation in 1038 ms returned sat
[2025-05-29 20:56:14] [INFO ] [Nat]Added 283 Read/Feed constraints in 298 ms returned sat
[2025-05-29 20:56:15] [INFO ] Deduced a trap composed of 16 places in 747 ms of which 3 ms to minimize.
[2025-05-29 20:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1223 ms
[2025-05-29 20:56:16] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 433 ms.
[2025-05-29 20:56:16] [INFO ] Added : 4 causal constraints over 1 iterations in 996 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:56:21] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:56:22] [INFO ] [Real]Absence check using state equation in 1134 ms returned sat
[2025-05-29 20:56:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:56:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:56:23] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2025-05-29 20:56:23] [INFO ] [Nat]Added 283 Read/Feed constraints in 228 ms returned sat
[2025-05-29 20:56:25] [INFO ] Deduced a trap composed of 92 places in 1497 ms of which 5 ms to minimize.
[2025-05-29 20:56:27] [INFO ] Deduced a trap composed of 92 places in 1487 ms of which 5 ms to minimize.
[2025-05-29 20:56:28] [INFO ] Deduced a trap composed of 14 places in 1536 ms of which 5 ms to minimize.
[2025-05-29 20:56:30] [INFO ] Deduced a trap composed of 56 places in 1460 ms of which 5 ms to minimize.
[2025-05-29 20:56:32] [INFO ] Deduced a trap composed of 8 places in 1475 ms of which 5 ms to minimize.
[2025-05-29 20:56:33] [INFO ] Deduced a trap composed of 59 places in 1450 ms of which 4 ms to minimize.
[2025-05-29 20:56:34] [INFO ] Deduced a trap composed of 31 places in 607 ms of which 3 ms to minimize.
[2025-05-29 20:56:34] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 10603 ms
[2025-05-29 20:56:35] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 509 ms.
[2025-05-29 20:56:35] [INFO ] Added : 4 causal constraints over 1 iterations in 1004 ms. Result :sat
Minimization took 4502 ms.
[2025-05-29 20:56:40] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:56:41] [INFO ] [Real]Absence check using state equation in 1201 ms returned sat
[2025-05-29 20:56:41] [INFO ] [Real]Added 283 Read/Feed constraints in 103 ms returned sat
[2025-05-29 20:56:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:56:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:56:42] [INFO ] [Nat]Absence check using state equation in 1075 ms returned sat
[2025-05-29 20:56:43] [INFO ] [Nat]Added 283 Read/Feed constraints in 348 ms returned sat
[2025-05-29 20:56:44] [INFO ] Deduced a trap composed of 17 places in 955 ms of which 3 ms to minimize.
[2025-05-29 20:56:45] [INFO ] Deduced a trap composed of 22 places in 881 ms of which 4 ms to minimize.
[2025-05-29 20:56:46] [INFO ] Deduced a trap composed of 63 places in 755 ms of which 3 ms to minimize.
[2025-05-29 20:56:47] [INFO ] Deduced a trap composed of 52 places in 737 ms of which 3 ms to minimize.
[2025-05-29 20:56:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4059 ms
[2025-05-29 20:56:47] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 520 ms.
[2025-05-29 20:56:49] [INFO ] Added : 6 causal constraints over 2 iterations in 1714 ms. Result :sat
Minimization took 4575 ms.
[2025-05-29 20:56:53] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:56:54] [INFO ] [Real]Absence check using state equation in 1114 ms returned sat
[2025-05-29 20:56:54] [INFO ] [Real]Added 283 Read/Feed constraints in 87 ms returned sat
[2025-05-29 20:56:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:56:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 20:56:56] [INFO ] [Nat]Absence check using state equation in 1103 ms returned sat
[2025-05-29 20:56:56] [INFO ] [Nat]Added 283 Read/Feed constraints in 381 ms returned sat
[2025-05-29 20:56:57] [INFO ] Deduced a trap composed of 54 places in 761 ms of which 3 ms to minimize.
[2025-05-29 20:56:58] [INFO ] Deduced a trap composed of 10 places in 672 ms of which 3 ms to minimize.
[2025-05-29 20:56:59] [INFO ] Deduced a trap composed of 14 places in 722 ms of which 2 ms to minimize.
[2025-05-29 20:56:59] [INFO ] Deduced a trap composed of 43 places in 662 ms of which 4 ms to minimize.
[2025-05-29 20:57:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3376 ms
[2025-05-29 20:57:00] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 511 ms.
[2025-05-29 20:57:01] [INFO ] Added : 3 causal constraints over 1 iterations in 1102 ms. Result :sat
Minimization took 4523 ms.
[2025-05-29 20:57:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:57:06] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2025-05-29 20:57:06] [INFO ] [Real]Added 283 Read/Feed constraints in 99 ms returned sat
[2025-05-29 20:57:06] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:57:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2025-05-29 20:57:08] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2025-05-29 20:57:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 524 ms returned sat
[2025-05-29 20:57:09] [INFO ] Deduced a trap composed of 26 places in 359 ms of which 2 ms to minimize.
[2025-05-29 20:57:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 590 ms
[2025-05-29 20:57:09] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 402 ms.
[2025-05-29 20:57:12] [INFO ] Deduced a trap composed of 10 places in 832 ms of which 3 ms to minimize.
[2025-05-29 20:57:12] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 8 ms to minimize.
[2025-05-29 20:57:13] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2025-05-29 20:57:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2309 ms
[2025-05-29 20:57:13] [INFO ] Added : 10 causal constraints over 4 iterations in 4338 ms. Result :sat
Minimization took 4530 ms.
[2025-05-29 20:57:18] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:57:19] [INFO ] [Real]Absence check using state equation in 995 ms returned sat
[2025-05-29 20:57:19] [INFO ] [Real]Added 283 Read/Feed constraints in 95 ms returned sat
[2025-05-29 20:57:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:57:19] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:57:20] [INFO ] [Nat]Absence check using state equation in 1090 ms returned sat
[2025-05-29 20:57:20] [INFO ] [Nat]Added 283 Read/Feed constraints in 234 ms returned sat
[2025-05-29 20:57:21] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 522 ms.
[2025-05-29 20:57:22] [INFO ] Added : 2 causal constraints over 1 iterations in 1101 ms. Result :sat
Minimization took 4289 ms.
[2025-05-29 20:57:26] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 20:57:27] [INFO ] [Real]Absence check using state equation in 1052 ms returned sat
[2025-05-29 20:57:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:57:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 20:57:28] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2025-05-29 20:57:29] [INFO ] [Nat]Added 283 Read/Feed constraints in 405 ms returned sat
[2025-05-29 20:57:30] [INFO ] Deduced a trap composed of 36 places in 800 ms of which 6 ms to minimize.
[2025-05-29 20:57:31] [INFO ] Deduced a trap composed of 23 places in 801 ms of which 3 ms to minimize.
[2025-05-29 20:57:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1922 ms
[2025-05-29 20:57:31] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 336 ms.
[2025-05-29 20:57:32] [INFO ] Added : 2 causal constraints over 1 iterations in 816 ms. Result :sat
Minimization took 4346 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
Support contains 8 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 138 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2025-05-29 20:57:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:57:36] [INFO ] Invariant cache hit.
[2025-05-29 20:57:37] [INFO ] Implicit Places using invariants in 831 ms returned []
[2025-05-29 20:57:37] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:57:37] [INFO ] Invariant cache hit.
[2025-05-29 20:57:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2025-05-29 20:57:41] [INFO ] Implicit Places using invariants and state equation in 3512 ms returned []
Implicit Place search using SMT with State Equation took 4350 ms to find 0 implicit places.
[2025-05-29 20:57:41] [INFO ] Redundant transitions in 627 ms returned []
Running 3870 sub problems to find dead transitions.
[2025-05-29 20:57:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2025-05-29 20:57:42] [INFO ] Invariant cache hit.
[2025-05-29 20:57:42] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30226 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/2667 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
[2025-05-29 20:59:30] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 2 ms to minimize.
[2025-05-29 20:59:30] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 2 ms to minimize.
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
[2025-05-29 20:59:33] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 1 ms to minimize.
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
[2025-05-29 20:59:34] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 1 ms to minimize.
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
[2025-05-29 20:59:34] [INFO ] Deduced a trap composed of 8 places in 319 ms of which 2 ms to minimize.
[2025-05-29 20:59:35] [INFO ] Deduced a trap composed of 17 places in 311 ms of which 2 ms to minimize.
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 14 constraints, problems are : Problem set: 468 solved, 3402 unsolved in 30120 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2667 constraints, Known Traps: 6/6 constraints]
After SMT, in 114243ms problems are : Problem set: 468 solved, 3402 unsolved
Search for dead transitions found 468 dead transitions in 114339ms
Found 468 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 468 transitions
Dead transitions reduction (with SMT) removed 468 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3403/3871 transitions.
Reduce places removed 13 places and 425 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 256 transition count 2978
Reduce places removed 9 places and 233 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 247 transition count 2745
Reduce places removed 9 places and 290 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 31 place count 238 transition count 2455
Reduce places removed 7 places and 167 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 38 place count 231 transition count 2288
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 50 place count 219 transition count 2264
Deduced a syphon composed of 1 places in 7 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 62 place count 219 transition count 2264
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 74 place count 207 transition count 2156
Deduced a syphon composed of 1 places in 6 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 86 place count 207 transition count 2156
Deduced a syphon composed of 1 places in 6 ms
Applied a total of 86 rules in 197 ms. Remains 207 /269 variables (removed 62) and now considering 2156/3403 (removed 1247) transitions.
[2025-05-29 20:59:36] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
// Phase 1: matrix 2007 rows 207 cols
[2025-05-29 20:59:36] [INFO ] Computed 9 invariants in 15 ms
[2025-05-29 20:59:37] [INFO ] Implicit Places using invariants in 456 ms returned []
[2025-05-29 20:59:37] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
[2025-05-29 20:59:37] [INFO ] Invariant cache hit.
[2025-05-29 20:59:37] [INFO ] State equation strengthened by 183 read => feed constraints.
[2025-05-29 20:59:39] [INFO ] Implicit Places using invariants and state equation in 2036 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 207/269 places, 2156/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 122164 ms. Remains : 207/269 places, 2156/3871 transitions.
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 20:59:39] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
Found an invariant !
This invariant on transitions {3=1, 1551=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 1551=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :[0, 0, 0, 0, 1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 1, 2, 0, 0] Max Struct:[+inf, 1, +inf, 1, 1, +inf, +inf, +inf]
[2025-05-29 20:59:40] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
// Phase 1: matrix 2007 rows 206 cols
[2025-05-29 20:59:40] [INFO ] Computed 8 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, 1, +inf, +inf, +inf]
FORMULA BugTracking-PT-q8m016-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000008 steps (2 resets) in 2825 ms. (353 steps per ms)
BEST_FIRST walk for 6000005 steps (12 resets) in 11748 ms. (510 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 20:59:54] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
[2025-05-29 20:59:54] [INFO ] Invariant cache hit.
[2025-05-29 20:59:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2025-05-29 20:59:55] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2025-05-29 20:59:55] [INFO ] State equation strengthened by 183 read => feed constraints.
[2025-05-29 20:59:55] [INFO ] [Real]Added 183 Read/Feed constraints in 87 ms returned sat
[2025-05-29 20:59:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 20:59:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 20:59:56] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2025-05-29 20:59:56] [INFO ] [Nat]Added 183 Read/Feed constraints in 123 ms returned sat
[2025-05-29 20:59:57] [INFO ] Deduced a trap composed of 26 places in 579 ms of which 4 ms to minimize.
[2025-05-29 20:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 711 ms
[2025-05-29 20:59:57] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 227 ms.
[2025-05-29 20:59:57] [INFO ] Added : 3 causal constraints over 1 iterations in 528 ms. Result :sat
Minimization took 1573 ms.
[2025-05-29 20:59:59] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:00:00] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2025-05-29 21:00:00] [INFO ] [Real]Added 183 Read/Feed constraints in 37 ms returned sat
[2025-05-29 21:00:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:00:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:00:00] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2025-05-29 21:00:00] [INFO ] [Nat]Added 183 Read/Feed constraints in 71 ms returned sat
[2025-05-29 21:00:01] [INFO ] Deduced a trap composed of 42 places in 491 ms of which 3 ms to minimize.
[2025-05-29 21:00:02] [INFO ] Deduced a trap composed of 45 places in 687 ms of which 4 ms to minimize.
[2025-05-29 21:00:02] [INFO ] Deduced a trap composed of 32 places in 439 ms of which 3 ms to minimize.
[2025-05-29 21:00:03] [INFO ] Deduced a trap composed of 63 places in 722 ms of which 3 ms to minimize.
[2025-05-29 21:00:04] [INFO ] Deduced a trap composed of 10 places in 566 ms of which 2 ms to minimize.
[2025-05-29 21:00:05] [INFO ] Deduced a trap composed of 20 places in 680 ms of which 2 ms to minimize.
[2025-05-29 21:00:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4213 ms
[2025-05-29 21:00:05] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 161 ms.
[2025-05-29 21:00:05] [INFO ] Added : 3 causal constraints over 1 iterations in 364 ms. Result :sat
Minimization took 1718 ms.
[2025-05-29 21:00:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:00:08] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2025-05-29 21:00:08] [INFO ] [Real]Added 183 Read/Feed constraints in 55 ms returned sat
[2025-05-29 21:00:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:00:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:00:09] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2025-05-29 21:00:09] [INFO ] [Nat]Added 183 Read/Feed constraints in 101 ms returned sat
[2025-05-29 21:00:09] [INFO ] Deduced a trap composed of 7 places in 730 ms of which 3 ms to minimize.
[2025-05-29 21:00:10] [INFO ] Deduced a trap composed of 33 places in 833 ms of which 4 ms to minimize.
[2025-05-29 21:00:11] [INFO ] Deduced a trap composed of 25 places in 799 ms of which 5 ms to minimize.
[2025-05-29 21:00:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2625 ms
[2025-05-29 21:00:11] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 249 ms.
[2025-05-29 21:00:12] [INFO ] Added : 3 causal constraints over 1 iterations in 510 ms. Result :sat
Minimization took 1772 ms.
[2025-05-29 21:00:14] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2025-05-29 21:00:14] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2025-05-29 21:00:14] [INFO ] [Real]Added 183 Read/Feed constraints in 74 ms returned sat
[2025-05-29 21:00:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:00:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:00:15] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2025-05-29 21:00:15] [INFO ] [Nat]Added 183 Read/Feed constraints in 138 ms returned sat
[2025-05-29 21:00:16] [INFO ] Deduced a trap composed of 12 places in 400 ms of which 3 ms to minimize.
[2025-05-29 21:00:16] [INFO ] Deduced a trap composed of 29 places in 437 ms of which 3 ms to minimize.
[2025-05-29 21:00:17] [INFO ] Deduced a trap composed of 43 places in 425 ms of which 3 ms to minimize.
[2025-05-29 21:00:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1592 ms
[2025-05-29 21:00:17] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 264 ms.
[2025-05-29 21:00:17] [INFO ] Added : 3 causal constraints over 1 iterations in 598 ms. Result :sat
Minimization took 1699 ms.
[2025-05-29 21:00:19] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:00:20] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2025-05-29 21:00:20] [INFO ] [Real]Added 183 Read/Feed constraints in 64 ms returned sat
[2025-05-29 21:00:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:00:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2025-05-29 21:00:21] [INFO ] [Nat]Absence check using state equation in 724 ms returned sat
[2025-05-29 21:00:21] [INFO ] [Nat]Added 183 Read/Feed constraints in 99 ms returned sat
[2025-05-29 21:00:21] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 272 ms.
[2025-05-29 21:00:22] [INFO ] Added : 2 causal constraints over 1 iterations in 614 ms. Result :sat
Minimization took 1713 ms.
[2025-05-29 21:00:24] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:00:24] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2025-05-29 21:00:24] [INFO ] [Real]Added 183 Read/Feed constraints in 59 ms returned sat
[2025-05-29 21:00:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:00:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:00:25] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2025-05-29 21:00:25] [INFO ] [Nat]Added 183 Read/Feed constraints in 202 ms returned sat
[2025-05-29 21:00:26] [INFO ] Deduced a trap composed of 53 places in 685 ms of which 5 ms to minimize.
[2025-05-29 21:00:27] [INFO ] Deduced a trap composed of 21 places in 659 ms of which 4 ms to minimize.
[2025-05-29 21:00:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1592 ms
[2025-05-29 21:00:27] [INFO ] Computed and/alt/rep : 452/1676/452 causal constraints (skipped 1554 transitions) in 272 ms.
[2025-05-29 21:00:27] [INFO ] Added : 2 causal constraints over 1 iterations in 613 ms. Result :sat
Minimization took 1706 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2156/2156 transitions.
Applied a total of 0 rules in 35 ms. Remains 206 /206 variables (removed 0) and now considering 2156/2156 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 206/206 places, 2156/2156 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 2156/2156 transitions.
Applied a total of 0 rules in 33 ms. Remains 206 /206 variables (removed 0) and now considering 2156/2156 (removed 0) transitions.
[2025-05-29 21:00:30] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
[2025-05-29 21:00:30] [INFO ] Invariant cache hit.
[2025-05-29 21:00:30] [INFO ] Implicit Places using invariants in 619 ms returned []
[2025-05-29 21:00:30] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
[2025-05-29 21:00:30] [INFO ] Invariant cache hit.
[2025-05-29 21:00:31] [INFO ] State equation strengthened by 183 read => feed constraints.
[2025-05-29 21:00:32] [INFO ] Implicit Places using invariants and state equation in 1999 ms returned []
Implicit Place search using SMT with State Equation took 2642 ms to find 0 implicit places.
[2025-05-29 21:00:33] [INFO ] Redundant transitions in 242 ms returned []
Running 2155 sub problems to find dead transitions.
[2025-05-29 21:00:33] [INFO ] Flow matrix only has 2007 transitions (discarded 149 similar events)
[2025-05-29 21:00:33] [INFO ] Invariant cache hit.
[2025-05-29 21:00:33] [INFO ] State equation strengthened by 183 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2155 unsolved
[2025-05-29 21:01:15] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2025-05-29 21:01:16] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1031 is UNSAT
[2025-05-29 21:01:17] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
[2025-05-29 21:01:19] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 2 ms to minimize.
Problem TDEAD1494 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1508 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1523 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1525 is UNSAT
Problem TDEAD1526 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1528 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1530 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1532 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1534 is UNSAT
Problem TDEAD1535 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1537 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1543 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
[2025-05-29 21:01:20] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 2 ms to minimize.
Problem TDEAD1608 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/2213 variables, and 13 constraints, problems are : Problem set: 289 solved, 1866 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 2155/2155 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 289 solved, 1866 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 7/7 constraints. Problems are: Problem set: 289 solved, 1866 unsolved
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/12 constraints. Problems are: Problem set: 297 solved, 1858 unsolved
[2025-05-29 21:01:39] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2148 is UNSAT
Problem TDEAD2149 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 1/13 constraints. Problems are: Problem set: 305 solved, 1850 unsolved
(s156 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/2213 variables, and 13 constraints, problems are : Problem set: 305 solved, 1850 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/206 constraints, ReadFeed: 0/183 constraints, PredecessorRefiner: 0/2155 constraints, Known Traps: 6/6 constraints]
After SMT, in 79556ms problems are : Problem set: 305 solved, 1850 unsolved
Search for dead transitions found 305 dead transitions in 79605ms
Found 305 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 305 transitions
Dead transitions reduction (with SMT) removed 305 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 206/206 places, 1851/2156 transitions.
Graph (complete) has 2354 edges and 206 vertex of which 196 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 348 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 182 transition count 1503
Reduce places removed 11 places and 182 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 26 place count 171 transition count 1321
Reduce places removed 7 places and 87 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 164 transition count 1234
Reduce places removed 4 places and 29 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 37 place count 160 transition count 1205
Reduce places removed 2 places and 50 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 158 transition count 1155
Reduce places removed 0 places and 18 transitions.
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 47 place count 150 transition count 1027
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 1 places and 9 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 56 place count 149 transition count 1018
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 56 rules in 53 ms. Remains 149 /206 variables (removed 57) and now considering 1018/1851 (removed 833) transitions.
[2025-05-29 21:01:52] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
// Phase 1: matrix 904 rows 149 cols
[2025-05-29 21:01:52] [INFO ] Computed 8 invariants in 4 ms
[2025-05-29 21:01:53] [INFO ] Implicit Places using invariants in 403 ms returned []
[2025-05-29 21:01:53] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
[2025-05-29 21:01:53] [INFO ] Invariant cache hit.
[2025-05-29 21:01:53] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-29 21:01:53] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1238 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/206 places, 1018/2156 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83843 ms. Remains : 149/206 places, 1018/2156 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:01:53] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
Found an invariant !
This invariant on transitions {0=1, 720=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {1=1, 720=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:01:54] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
// Phase 1: matrix 904 rows 148 cols
[2025-05-29 21:01:54] [INFO ] Computed 7 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1506 ms. (663 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 6093 ms. (820 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:02:02] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
[2025-05-29 21:02:02] [INFO ] Invariant cache hit.
[2025-05-29 21:02:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:02:02] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-29 21:02:02] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-29 21:02:02] [INFO ] [Real]Added 105 Read/Feed constraints in 26 ms returned sat
[2025-05-29 21:02:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:02:02] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-05-29 21:02:02] [INFO ] [Nat]Added 105 Read/Feed constraints in 53 ms returned sat
[2025-05-29 21:02:03] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 3 ms to minimize.
[2025-05-29 21:02:03] [INFO ] Deduced a trap composed of 62 places in 329 ms of which 3 ms to minimize.
[2025-05-29 21:02:03] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 7 ms to minimize.
[2025-05-29 21:02:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 835 ms
[2025-05-29 21:02:03] [INFO ] Computed and/alt/rep : 365/1413/364 causal constraints (skipped 539 transitions) in 69 ms.
[2025-05-29 21:02:04] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 2 ms to minimize.
[2025-05-29 21:02:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-05-29 21:02:04] [INFO ] Added : 7 causal constraints over 2 iterations in 438 ms. Result :sat
Minimization took 391 ms.
[2025-05-29 21:02:04] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:02:04] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2025-05-29 21:02:04] [INFO ] [Real]Added 105 Read/Feed constraints in 27 ms returned sat
[2025-05-29 21:02:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:02:05] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2025-05-29 21:02:05] [INFO ] [Nat]Added 105 Read/Feed constraints in 37 ms returned sat
[2025-05-29 21:02:05] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 2 ms to minimize.
[2025-05-29 21:02:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2025-05-29 21:02:05] [INFO ] Computed and/alt/rep : 365/1413/364 causal constraints (skipped 539 transitions) in 110 ms.
[2025-05-29 21:02:06] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 2 ms to minimize.
[2025-05-29 21:02:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2025-05-29 21:02:06] [INFO ] Added : 13 causal constraints over 3 iterations in 564 ms. Result :sat
Minimization took 391 ms.
[2025-05-29 21:02:06] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:02:07] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-05-29 21:02:07] [INFO ] [Real]Added 105 Read/Feed constraints in 37 ms returned sat
[2025-05-29 21:02:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned sat
[2025-05-29 21:02:07] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2025-05-29 21:02:07] [INFO ] [Nat]Added 105 Read/Feed constraints in 54 ms returned sat
[2025-05-29 21:02:07] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 2 ms to minimize.
[2025-05-29 21:02:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2025-05-29 21:02:07] [INFO ] Computed and/alt/rep : 365/1413/364 causal constraints (skipped 539 transitions) in 115 ms.
[2025-05-29 21:02:08] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 2 ms to minimize.
[2025-05-29 21:02:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 352 ms
[2025-05-29 21:02:08] [INFO ] Added : 15 causal constraints over 5 iterations in 908 ms. Result :sat
Minimization took 560 ms.
[2025-05-29 21:02:09] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:02:09] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2025-05-29 21:02:09] [INFO ] [Real]Added 105 Read/Feed constraints in 37 ms returned sat
[2025-05-29 21:02:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:02:10] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2025-05-29 21:02:10] [INFO ] [Nat]Added 105 Read/Feed constraints in 80 ms returned sat
[2025-05-29 21:02:10] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 2 ms to minimize.
[2025-05-29 21:02:10] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 2 ms to minimize.
[2025-05-29 21:02:11] [INFO ] Deduced a trap composed of 20 places in 293 ms of which 3 ms to minimize.
[2025-05-29 21:02:11] [INFO ] Deduced a trap composed of 38 places in 353 ms of which 3 ms to minimize.
[2025-05-29 21:02:11] [INFO ] Deduced a trap composed of 13 places in 228 ms of which 2 ms to minimize.
[2025-05-29 21:02:12] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 2 ms to minimize.
[2025-05-29 21:02:12] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 2 ms to minimize.
[2025-05-29 21:02:12] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 2 ms to minimize.
[2025-05-29 21:02:12] [INFO ] Deduced a trap composed of 6 places in 177 ms of which 2 ms to minimize.
[2025-05-29 21:02:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2653 ms
[2025-05-29 21:02:13] [INFO ] Computed and/alt/rep : 365/1413/364 causal constraints (skipped 539 transitions) in 122 ms.
[2025-05-29 21:02:13] [INFO ] Added : 13 causal constraints over 4 iterations in 469 ms. Result :sat
Minimization took 569 ms.
[2025-05-29 21:02:14] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:02:14] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-29 21:02:14] [INFO ] [Real]Added 105 Read/Feed constraints in 23 ms returned sat
[2025-05-29 21:02:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:02:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-05-29 21:02:14] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2025-05-29 21:02:14] [INFO ] [Nat]Added 105 Read/Feed constraints in 48 ms returned sat
[2025-05-29 21:02:15] [INFO ] Deduced a trap composed of 64 places in 303 ms of which 2 ms to minimize.
[2025-05-29 21:02:15] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 2 ms to minimize.
[2025-05-29 21:02:15] [INFO ] Deduced a trap composed of 77 places in 341 ms of which 3 ms to minimize.
[2025-05-29 21:02:16] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 2 ms to minimize.
[2025-05-29 21:02:16] [INFO ] Deduced a trap composed of 51 places in 329 ms of which 3 ms to minimize.
[2025-05-29 21:02:16] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 3 ms to minimize.
[2025-05-29 21:02:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2193 ms
[2025-05-29 21:02:17] [INFO ] Computed and/alt/rep : 365/1413/364 causal constraints (skipped 539 transitions) in 123 ms.
[2025-05-29 21:02:17] [INFO ] Added : 2 causal constraints over 1 iterations in 283 ms. Result :sat
Minimization took 567 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 5 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1018/1018 transitions.
Applied a total of 0 rules in 24 ms. Remains 148 /148 variables (removed 0) and now considering 1018/1018 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 148/148 places, 1018/1018 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1018/1018 transitions.
Applied a total of 0 rules in 24 ms. Remains 148 /148 variables (removed 0) and now considering 1018/1018 (removed 0) transitions.
[2025-05-29 21:02:18] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
[2025-05-29 21:02:18] [INFO ] Invariant cache hit.
[2025-05-29 21:02:18] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-05-29 21:02:18] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
[2025-05-29 21:02:18] [INFO ] Invariant cache hit.
[2025-05-29 21:02:19] [INFO ] State equation strengthened by 105 read => feed constraints.
[2025-05-29 21:02:19] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2025-05-29 21:02:20] [INFO ] Redundant transitions in 19 ms returned []
Running 1017 sub problems to find dead transitions.
[2025-05-29 21:02:20] [INFO ] Flow matrix only has 904 transitions (discarded 114 similar events)
[2025-05-29 21:02:20] [INFO ] Invariant cache hit.
[2025-05-29 21:02:20] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1017 unsolved
[2025-05-29 21:02:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2025-05-29 21:02:31] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 2/9 constraints. Problems are: Problem set: 4 solved, 1013 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 4 solved, 1013 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 904/1051 variables, 147/156 constraints. Problems are: Problem set: 4 solved, 1013 unsolved
SMT process timed out in 33743ms, After SMT, problems are : Problem set: 4 solved, 1013 unsolved
Search for dead transitions found 4 dead transitions in 33769ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 148/148 places, 1014/1018 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 146 transition count 1000
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 146 transition count 1000
Applied a total of 4 rules in 30 ms. Remains 146 /148 variables (removed 2) and now considering 1000/1014 (removed 14) transitions.
[2025-05-29 21:02:53] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
// Phase 1: matrix 889 rows 146 cols
[2025-05-29 21:02:53] [INFO ] Computed 7 invariants in 6 ms
[2025-05-29 21:02:54] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-05-29 21:02:54] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:02:54] [INFO ] Invariant cache hit.
[2025-05-29 21:02:54] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 21:02:55] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1743 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 146/148 places, 1000/1018 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37348 ms. Remains : 146/148 places, 1000/1018 transitions.
[2025-05-29 21:02:55] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
Found an invariant !
This invariant on transitions {1=1, 708=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {3=1, 708=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:02:56] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:02:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000002 steps (2 resets) in 1638 ms. (610 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 5919 ms. (844 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:03:03] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:03:03] [INFO ] Invariant cache hit.
[2025-05-29 21:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:03:04] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2025-05-29 21:03:04] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 21:03:04] [INFO ] [Real]Added 104 Read/Feed constraints in 39 ms returned sat
[2025-05-29 21:03:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:03:04] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2025-05-29 21:03:04] [INFO ] [Nat]Added 104 Read/Feed constraints in 54 ms returned sat
[2025-05-29 21:03:05] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 4 ms to minimize.
[2025-05-29 21:03:05] [INFO ] Deduced a trap composed of 62 places in 274 ms of which 3 ms to minimize.
[2025-05-29 21:03:05] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 2 ms to minimize.
[2025-05-29 21:03:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 983 ms
[2025-05-29 21:03:05] [INFO ] Computed and/alt/rep : 359/1440/358 causal constraints (skipped 530 transitions) in 115 ms.
[2025-05-29 21:03:06] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 2 ms to minimize.
[2025-05-29 21:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 299 ms
[2025-05-29 21:03:06] [INFO ] Added : 7 causal constraints over 3 iterations in 728 ms. Result :sat
Minimization took 617 ms.
[2025-05-29 21:03:07] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:03:07] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2025-05-29 21:03:07] [INFO ] [Real]Added 104 Read/Feed constraints in 24 ms returned sat
[2025-05-29 21:03:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:03:07] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2025-05-29 21:03:07] [INFO ] [Nat]Added 104 Read/Feed constraints in 60 ms returned sat
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 2 ms to minimize.
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 2 ms to minimize.
[2025-05-29 21:03:08] [INFO ] Deduced a trap composed of 20 places in 278 ms of which 2 ms to minimize.
[2025-05-29 21:03:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 913 ms
[2025-05-29 21:03:08] [INFO ] Computed and/alt/rep : 359/1440/358 causal constraints (skipped 530 transitions) in 108 ms.
[2025-05-29 21:03:09] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2025-05-29 21:03:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2025-05-29 21:03:09] [INFO ] Added : 12 causal constraints over 4 iterations in 730 ms. Result :sat
Minimization took 653 ms.
[2025-05-29 21:03:10] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2025-05-29 21:03:10] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2025-05-29 21:03:10] [INFO ] [Real]Added 104 Read/Feed constraints in 31 ms returned sat
[2025-05-29 21:03:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:03:11] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2025-05-29 21:03:11] [INFO ] [Nat]Added 104 Read/Feed constraints in 47 ms returned sat
[2025-05-29 21:03:11] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 1 ms to minimize.
[2025-05-29 21:03:11] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 8 ms to minimize.
[2025-05-29 21:03:12] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 2 ms to minimize.
[2025-05-29 21:03:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 900 ms
[2025-05-29 21:03:12] [INFO ] Computed and/alt/rep : 359/1440/358 causal constraints (skipped 530 transitions) in 116 ms.
[2025-05-29 21:03:12] [INFO ] Deduced a trap composed of 11 places in 272 ms of which 2 ms to minimize.
[2025-05-29 21:03:13] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 1 ms to minimize.
[2025-05-29 21:03:13] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 1 ms to minimize.
[2025-05-29 21:03:13] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 2 ms to minimize.
[2025-05-29 21:03:13] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 2 ms to minimize.
[2025-05-29 21:03:14] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 2 ms to minimize.
[2025-05-29 21:03:14] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 1 ms to minimize.
[2025-05-29 21:03:14] [INFO ] Deduced a trap composed of 23 places in 228 ms of which 1 ms to minimize.
[2025-05-29 21:03:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2272 ms
[2025-05-29 21:03:14] [INFO ] Added : 16 causal constraints over 4 iterations in 2795 ms. Result :sat
Minimization took 456 ms.
[2025-05-29 21:03:15] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:03:15] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-05-29 21:03:15] [INFO ] [Real]Added 104 Read/Feed constraints in 35 ms returned sat
[2025-05-29 21:03:15] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:03:16] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2025-05-29 21:03:16] [INFO ] [Nat]Added 104 Read/Feed constraints in 64 ms returned sat
[2025-05-29 21:03:16] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 2 ms to minimize.
[2025-05-29 21:03:16] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 2 ms to minimize.
[2025-05-29 21:03:16] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 1 ms to minimize.
[2025-05-29 21:03:17] [INFO ] Deduced a trap composed of 35 places in 249 ms of which 2 ms to minimize.
[2025-05-29 21:03:17] [INFO ] Deduced a trap composed of 57 places in 247 ms of which 2 ms to minimize.
[2025-05-29 21:03:17] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 2 ms to minimize.
[2025-05-29 21:03:18] [INFO ] Deduced a trap composed of 16 places in 181 ms of which 2 ms to minimize.
[2025-05-29 21:03:18] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2025-05-29 21:03:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2110 ms
[2025-05-29 21:03:18] [INFO ] Computed and/alt/rep : 359/1440/358 causal constraints (skipped 530 transitions) in 88 ms.
[2025-05-29 21:03:18] [INFO ] Added : 25 causal constraints over 5 iterations in 441 ms. Result :sat
Minimization took 596 ms.
[2025-05-29 21:03:19] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 21:03:19] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2025-05-29 21:03:19] [INFO ] [Real]Added 104 Read/Feed constraints in 20 ms returned sat
[2025-05-29 21:03:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:03:19] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-05-29 21:03:20] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2025-05-29 21:03:20] [INFO ] [Nat]Added 104 Read/Feed constraints in 65 ms returned sat
[2025-05-29 21:03:20] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 5 ms to minimize.
[2025-05-29 21:03:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2025-05-29 21:03:20] [INFO ] Computed and/alt/rep : 359/1440/358 causal constraints (skipped 530 transitions) in 86 ms.
[2025-05-29 21:03:20] [INFO ] Added : 2 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 521 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 5 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 146 /146 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 146/146 places, 1000/1000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 146 /146 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2025-05-29 21:03:21] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:03:21] [INFO ] Invariant cache hit.
[2025-05-29 21:03:21] [INFO ] Implicit Places using invariants in 402 ms returned []
[2025-05-29 21:03:21] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:03:21] [INFO ] Invariant cache hit.
[2025-05-29 21:03:22] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-05-29 21:03:22] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1377 ms to find 0 implicit places.
[2025-05-29 21:03:22] [INFO ] Redundant transitions in 18 ms returned []
Running 999 sub problems to find dead transitions.
[2025-05-29 21:03:22] [INFO ] Flow matrix only has 889 transitions (discarded 111 similar events)
[2025-05-29 21:03:22] [INFO ] Invariant cache hit.
[2025-05-29 21:03:22] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 889/1034 variables, 145/152 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1034/1035 variables, and 256 constraints, problems are : Problem set: 0 solved, 999 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/146 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 999/999 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 999 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 2 (OVERLAPS) 889/1034 variables, 145/152 constraints. Problems are: Problem set: 0 solved, 999 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1034 variables, 104/256 constraints. Problems are: Problem set: 0 solved, 999 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/1034 variables, 768/1024 constraints. Problems are: Problem set: 103 solved, 896 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/1035 variables, and 1024 constraints, problems are : Problem set: 103 solved, 896 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 145/146 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 768/999 constraints, Known Traps: 0/0 constraints]
After SMT, in 63219ms problems are : Problem set: 103 solved, 896 unsolved
Search for dead transitions found 103 dead transitions in 63239ms
Found 103 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 103 transitions
Dead transitions reduction (with SMT) removed 103 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 146/146 places, 897/1000 transitions.
Reduce places removed 11 places and 168 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 135 transition count 729
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 134 transition count 722
Reduce places removed 0 places and 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 133 transition count 706
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 133 transition count 706
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 14 rules in 26 ms. Remains 133 /146 variables (removed 13) and now considering 706/897 (removed 191) transitions.
[2025-05-29 21:04:26] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
// Phase 1: matrix 656 rows 133 cols
[2025-05-29 21:04:26] [INFO ] Computed 11 invariants in 2 ms
[2025-05-29 21:04:26] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-05-29 21:04:26] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
[2025-05-29 21:04:26] [INFO ] Invariant cache hit.
[2025-05-29 21:04:26] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 21:04:27] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 133/146 places, 706/1000 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65864 ms. Remains : 133/146 places, 706/1000 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-05-29 21:04:27] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
Found an invariant !
This invariant on transitions {0=1, 477=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 477=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :[0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:04:27] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
// Phase 1: matrix 656 rows 130 cols
[2025-05-29 21:04:27] [INFO ] Computed 8 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2319 ms. (431 steps per ms)
BEST_FIRST walk for 2000001 steps (4 resets) in 2122 ms. (942 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
[2025-05-29 21:04:32] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
[2025-05-29 21:04:32] [INFO ] Invariant cache hit.
[2025-05-29 21:04:32] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2025-05-29 21:04:32] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2025-05-29 21:04:32] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 21:04:32] [INFO ] [Real]Added 90 Read/Feed constraints in 17 ms returned sat
[2025-05-29 21:04:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:04:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2025-05-29 21:04:32] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2025-05-29 21:04:32] [INFO ] [Nat]Added 90 Read/Feed constraints in 41 ms returned sat
[2025-05-29 21:04:32] [INFO ] Computed and/alt/rep : 245/935/245 causal constraints (skipped 410 transitions) in 86 ms.
[2025-05-29 21:04:33] [INFO ] Added : 7 causal constraints over 2 iterations in 250 ms. Result :sat
Minimization took 326 ms.
[2025-05-29 21:04:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:04:33] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2025-05-29 21:04:33] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 21:04:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2025-05-29 21:04:34] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-05-29 21:04:34] [INFO ] [Nat]Added 90 Read/Feed constraints in 45 ms returned sat
[2025-05-29 21:04:34] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 2 ms to minimize.
[2025-05-29 21:04:34] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 4 ms to minimize.
[2025-05-29 21:04:34] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2025-05-29 21:04:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 701 ms
[2025-05-29 21:04:35] [INFO ] Computed and/alt/rep : 245/935/245 causal constraints (skipped 410 transitions) in 83 ms.
[2025-05-29 21:04:35] [INFO ] Added : 15 causal constraints over 3 iterations in 312 ms. Result :sat
Minimization took 326 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 2, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, +inf, +inf]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 706/706 transitions.
Applied a total of 0 rules in 15 ms. Remains 130 /130 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 130/130 places, 706/706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 706/706 transitions.
Applied a total of 0 rules in 12 ms. Remains 130 /130 variables (removed 0) and now considering 706/706 (removed 0) transitions.
[2025-05-29 21:04:35] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
[2025-05-29 21:04:35] [INFO ] Invariant cache hit.
[2025-05-29 21:04:36] [INFO ] Implicit Places using invariants in 350 ms returned []
[2025-05-29 21:04:36] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
[2025-05-29 21:04:36] [INFO ] Invariant cache hit.
[2025-05-29 21:04:36] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 21:04:36] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
[2025-05-29 21:04:36] [INFO ] Redundant transitions in 5 ms returned []
Running 705 sub problems to find dead transitions.
[2025-05-29 21:04:36] [INFO ] Flow matrix only has 656 transitions (discarded 50 similar events)
[2025-05-29 21:04:36] [INFO ] Invariant cache hit.
[2025-05-29 21:04:36] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 705 unsolved
[2025-05-29 21:04:44] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD503 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 697 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 697 unsolved
Problem TDEAD346 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
At refinement iteration 3 (OVERLAPS) 656/786 variables, 130/139 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/786 variables, 90/229 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 0/229 constraints. Problems are: Problem set: 14 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 786/786 variables, and 229 constraints, problems are : Problem set: 14 solved, 691 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 705/705 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 14 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 7/7 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/8 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/8 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/9 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/9 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 5 (OVERLAPS) 656/786 variables, 130/139 constraints. Problems are: Problem set: 14 solved, 691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 90/229 constraints. Problems are: Problem set: 14 solved, 691 unsolved
Problem TDEAD328 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD700 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 691/920 constraints. Problems are: Problem set: 60 solved, 645 unsolved
[2025-05-29 21:05:33] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2025-05-29 21:05:33] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2025-05-29 21:05:36] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2025-05-29 21:05:36] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 924 constraints, problems are : Problem set: 125 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 130/130 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 691/705 constraints, Known Traps: 5/5 constraints]
After SMT, in 62044ms problems are : Problem set: 125 solved, 580 unsolved
Search for dead transitions found 125 dead transitions in 62052ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 130/130 places, 581/706 transitions.
Graph (complete) has 871 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 146 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 112 transition count 435
Reduce places removed 6 places and 55 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 21 place count 106 transition count 380
Reduce places removed 2 places and 22 transitions.
Graph (complete) has 584 edges and 104 vertex of which 2 are kept as prefixes of interest. Removing 102 places using SCC suffix rule.0 ms
Discarding 102 places :
Also discarding 358 output transitions
Drop transitions (Output transitions of discarded places.) removed 358 transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 24 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 24 rules in 6 ms. Remains 2 /130 variables (removed 128) and now considering 0/581 (removed 581) transitions.
[2025-05-29 21:05:38] [INFO ] Computed 0 invariants in 1 ms
[2025-05-29 21:05:38] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-05-29 21:05:38] [INFO ] Invariant cache hit.
[2025-05-29 21:05:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2/130 places, 0/706 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 63255 ms. Remains : 2/130 places, 0/706 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m016-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m016-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 660294 ms.

BK_STOP 1748552739153

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BugTracking-PT-q8m016"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BugTracking-PT-q8m016, 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 r027-smll-174853774300072"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m016.tgz
mv BugTracking-PT-q8m016 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.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 ;