Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399500445.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BugTracking-PT-q8m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333477619

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:17:58] [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]
[2024-05-21 23:17:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:17:59] [INFO ] Load time of PNML (sax parser for PT used): 856 ms
[2024-05-21 23:18:00] [INFO ] Transformed 754 places.
[2024-05-21 23:18:00] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:18:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1175 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Deduced a syphon composed of 474 places in 108 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +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, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 23:18:00] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 280 cols
[2024-05-21 23:18:00] [INFO ] Computed 10 invariants in 54 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf, 256]
RANDOM walk for 10000 steps (2 resets) in 146 ms. (68 steps per ms)
FORMULA BugTracking-PT-q8m256-UpperBounds-14 256 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (16 resets) in 272 ms. (293 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:18:01] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:18:01] [INFO ] Invariant cache hit.
[2024-05-21 23:18:01] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 23:18:02] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2024-05-21 23:18:02] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 23:18:02] [INFO ] [Real]Added 303 Read/Feed constraints in 73 ms returned sat
[2024-05-21 23:18:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 23:18:03] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2024-05-21 23:18:03] [INFO ] [Nat]Added 303 Read/Feed constraints in 107 ms returned sat
[2024-05-21 23:18:04] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 358 ms.
[2024-05-21 23:18:04] [INFO ] Added : 2 causal constraints over 1 iterations in 722 ms. Result :sat
Minimization took 1258 ms.
[2024-05-21 23:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:18:06] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2024-05-21 23:18:06] [INFO ] [Real]Added 303 Read/Feed constraints in 92 ms returned sat
[2024-05-21 23:18:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:07] [INFO ] [Nat]Absence check using state equation in 737 ms returned sat
[2024-05-21 23:18:07] [INFO ] [Nat]Added 303 Read/Feed constraints in 121 ms returned sat
[2024-05-21 23:18:08] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 565 ms.
[2024-05-21 23:18:09] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 10 ms to minimize.
[2024-05-21 23:18:09] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 15 ms to minimize.
[2024-05-21 23:18:10] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 2 ms to minimize.
[2024-05-21 23:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1647 ms
[2024-05-21 23:18:11] [INFO ] Added : 11 causal constraints over 3 iterations in 3401 ms. Result :sat
Minimization took 534 ms.
[2024-05-21 23:18:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:18:12] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-21 23:18:12] [INFO ] [Real]Added 303 Read/Feed constraints in 97 ms returned sat
[2024-05-21 23:18:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 23:18:13] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2024-05-21 23:18:13] [INFO ] [Nat]Added 303 Read/Feed constraints in 140 ms returned sat
[2024-05-21 23:18:14] [INFO ] Deduced a trap composed of 35 places in 524 ms of which 2 ms to minimize.
[2024-05-21 23:18:15] [INFO ] Deduced a trap composed of 47 places in 492 ms of which 2 ms to minimize.
[2024-05-21 23:18:15] [INFO ] Deduced a trap composed of 26 places in 471 ms of which 1 ms to minimize.
[2024-05-21 23:18:16] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 2 ms to minimize.
[2024-05-21 23:18:17] [INFO ] Deduced a trap composed of 25 places in 467 ms of which 4 ms to minimize.
[2024-05-21 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3302 ms
[2024-05-21 23:18:17] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 353 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 23:18:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:18] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2024-05-21 23:18:18] [INFO ] [Real]Added 303 Read/Feed constraints in 95 ms returned sat
[2024-05-21 23:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:19] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2024-05-21 23:18:19] [INFO ] [Nat]Added 303 Read/Feed constraints in 137 ms returned sat
[2024-05-21 23:18:20] [INFO ] Deduced a trap composed of 58 places in 658 ms of which 3 ms to minimize.
[2024-05-21 23:18:21] [INFO ] Deduced a trap composed of 60 places in 637 ms of which 2 ms to minimize.
[2024-05-21 23:18:22] [INFO ] Deduced a trap composed of 43 places in 720 ms of which 2 ms to minimize.
[2024-05-21 23:18:22] [INFO ] Deduced a trap composed of 17 places in 536 ms of which 2 ms to minimize.
[2024-05-21 23:18:23] [INFO ] Deduced a trap composed of 17 places in 435 ms of which 2 ms to minimize.
[2024-05-21 23:18:24] [INFO ] Deduced a trap composed of 17 places in 394 ms of which 1 ms to minimize.
[2024-05-21 23:18:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
[2024-05-21 23:18:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:18:24] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2024-05-21 23:18:25] [INFO ] [Real]Added 303 Read/Feed constraints in 111 ms returned sat
[2024-05-21 23:18:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:26] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2024-05-21 23:18:26] [INFO ] [Nat]Added 303 Read/Feed constraints in 233 ms returned sat
[2024-05-21 23:18:26] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 1 ms to minimize.
[2024-05-21 23:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 679 ms
[2024-05-21 23:18:27] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 344 ms.
[2024-05-21 23:18:27] [INFO ] Added : 8 causal constraints over 2 iterations in 856 ms. Result :sat
Minimization took 1297 ms.
[2024-05-21 23:18:29] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:29] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2024-05-21 23:18:30] [INFO ] [Real]Added 303 Read/Feed constraints in 86 ms returned sat
[2024-05-21 23:18:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 23:18:30] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2024-05-21 23:18:31] [INFO ] [Nat]Added 303 Read/Feed constraints in 185 ms returned sat
[2024-05-21 23:18:32] [INFO ] Deduced a trap composed of 63 places in 874 ms of which 2 ms to minimize.
[2024-05-21 23:18:32] [INFO ] Deduced a trap composed of 86 places in 782 ms of which 2 ms to minimize.
[2024-05-21 23:18:33] [INFO ] Deduced a trap composed of 27 places in 560 ms of which 3 ms to minimize.
[2024-05-21 23:18:34] [INFO ] Deduced a trap composed of 95 places in 609 ms of which 3 ms to minimize.
[2024-05-21 23:18:34] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 2 ms to minimize.
[2024-05-21 23:18:35] [INFO ] Deduced a trap composed of 15 places in 703 ms of which 2 ms to minimize.
[2024-05-21 23:18:35] [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.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)
[2024-05-21 23:18:35] [INFO ] [Real]Absence check using 10 positive place invariants in 24 ms returned sat
[2024-05-21 23:18:36] [INFO ] [Real]Absence check using state equation in 1007 ms returned sat
[2024-05-21 23:18:37] [INFO ] [Real]Added 303 Read/Feed constraints in 131 ms returned sat
[2024-05-21 23:18:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:37] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2024-05-21 23:18:38] [INFO ] [Nat]Added 303 Read/Feed constraints in 236 ms returned sat
[2024-05-21 23:18:38] [INFO ] Deduced a trap composed of 71 places in 559 ms of which 4 ms to minimize.
[2024-05-21 23:18:39] [INFO ] Deduced a trap composed of 15 places in 464 ms of which 2 ms to minimize.
[2024-05-21 23:18:40] [INFO ] Deduced a trap composed of 57 places in 510 ms of which 2 ms to minimize.
[2024-05-21 23:18:40] [INFO ] Deduced a trap composed of 33 places in 383 ms of which 1 ms to minimize.
[2024-05-21 23:18:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2537 ms
[2024-05-21 23:18:41] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 350 ms.
[2024-05-21 23:18:41] [INFO ] Added : 7 causal constraints over 2 iterations in 993 ms. Result :sat
Minimization took 535 ms.
[2024-05-21 23:18:42] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:18:43] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2024-05-21 23:18:43] [INFO ] [Real]Added 303 Read/Feed constraints in 111 ms returned sat
[2024-05-21 23:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:18:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 23:18:44] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2024-05-21 23:18:44] [INFO ] [Nat]Added 303 Read/Feed constraints in 202 ms returned sat
[2024-05-21 23:18:44] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-21 23:18:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2024-05-21 23:18:45] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 337 ms.
[2024-05-21 23:18:46] [INFO ] Deduced a trap composed of 18 places in 602 ms of which 2 ms to minimize.
[2024-05-21 23:18:47] [INFO ] Deduced a trap composed of 38 places in 338 ms of which 1 ms to minimize.
[2024-05-21 23:18:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1380 ms
[2024-05-21 23:18:47] [INFO ] Added : 12 causal constraints over 4 iterations in 2928 ms. Result :sat
Minimization took 784 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +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.17 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 6 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 506 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 528 ms. Remains : 269/280 places, 3871/3904 transitions.
[2024-05-21 23:18:49] [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 0 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 258 ms. (steps per millisecond=38 ) properties (out of 8) seen :[0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:18:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2024-05-21 23:18:50] [INFO ] Computed 8 invariants in 88 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000189 steps (2 resets) in 647 ms. (1543 steps per ms)
BEST_FIRST walk for 8000005 steps (16 resets) in 15709 ms. (509 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:19:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:19:07] [INFO ] Invariant cache hit.
[2024-05-21 23:19:07] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:19:07] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2024-05-21 23:19:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:19:08] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-21 23:19:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:19:08] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2024-05-21 23:19:09] [INFO ] Deduced a trap composed of 23 places in 683 ms of which 3 ms to minimize.
[2024-05-21 23:19:10] [INFO ] Deduced a trap composed of 61 places in 695 ms of which 2 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 81 places in 557 ms of which 3 ms to minimize.
[2024-05-21 23:19:11] [INFO ] Deduced a trap composed of 61 places in 514 ms of which 2 ms to minimize.
[2024-05-21 23:19:12] [INFO ] Deduced a trap composed of 121 places in 504 ms of which 2 ms to minimize.
[2024-05-21 23:19:12] [INFO ] Deduced a trap composed of 114 places in 459 ms of which 2 ms to minimize.
[2024-05-21 23:19:13] [INFO ] Deduced a trap composed of 40 places in 518 ms of which 3 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 55 places in 476 ms of which 2 ms to minimize.
[2024-05-21 23:19:14] [INFO ] Deduced a trap composed of 54 places in 509 ms of which 2 ms to minimize.
[2024-05-21 23:19:15] [INFO ] Deduced a trap composed of 44 places in 577 ms of which 2 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 2 ms to minimize.
[2024-05-21 23:19:16] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 2 ms to minimize.
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 95 places in 503 ms of which 2 ms to minimize.
[2024-05-21 23:19:17] [INFO ] Deduced a trap composed of 79 places in 519 ms of which 2 ms to minimize.
[2024-05-21 23:19:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 9079 ms
[2024-05-21 23:19:18] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 268 ms.
[2024-05-21 23:19:18] [INFO ] Added : 3 causal constraints over 1 iterations in 715 ms. Result :sat
Minimization took 4070 ms.
[2024-05-21 23:19:23] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 23:19:23] [INFO ] [Real]Absence check using state equation in 649 ms returned sat
[2024-05-21 23:19:23] [INFO ] [Real]Added 283 Read/Feed constraints in 78 ms returned sat
[2024-05-21 23:19:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:24] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-21 23:19:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 83 ms returned sat
[2024-05-21 23:19:25] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 302 ms.
[2024-05-21 23:19:25] [INFO ] Added : 2 causal constraints over 1 iterations in 773 ms. Result :sat
Minimization took 4859 ms.
[2024-05-21 23:19:30] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 23:19:31] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2024-05-21 23:19:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:19:31] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2024-05-21 23:19:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 198 ms returned sat
[2024-05-21 23:19:32] [INFO ] Deduced a trap composed of 114 places in 676 ms of which 2 ms to minimize.
[2024-05-21 23:19:33] [INFO ] Deduced a trap composed of 13 places in 588 ms of which 2 ms to minimize.
[2024-05-21 23:19:34] [INFO ] Deduced a trap composed of 61 places in 557 ms of which 2 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 117 places in 599 ms of which 2 ms to minimize.
[2024-05-21 23:19:35] [INFO ] Deduced a trap composed of 127 places in 467 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 37 places in 495 ms of which 2 ms to minimize.
[2024-05-21 23:19:36] [INFO ] Deduced a trap composed of 83 places in 516 ms of which 2 ms to minimize.
[2024-05-21 23:19:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5019 ms
[2024-05-21 23:19:37] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 355 ms.
[2024-05-21 23:19:37] [INFO ] Added : 5 causal constraints over 1 iterations in 824 ms. Result :sat
Minimization took 4875 ms.
[2024-05-21 23:19:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 23:19:43] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2024-05-21 23:19:43] [INFO ] [Real]Added 283 Read/Feed constraints in 68 ms returned sat
[2024-05-21 23:19:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:44] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2024-05-21 23:19:44] [INFO ] [Nat]Added 283 Read/Feed constraints in 118 ms returned sat
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 88 places in 504 ms of which 2 ms to minimize.
[2024-05-21 23:19:45] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 2 ms to minimize.
[2024-05-21 23:19:46] [INFO ] Deduced a trap composed of 108 places in 547 ms of which 3 ms to minimize.
[2024-05-21 23:19:47] [INFO ] Deduced a trap composed of 62 places in 503 ms of which 2 ms to minimize.
[2024-05-21 23:19:47] [INFO ] Deduced a trap composed of 43 places in 439 ms of which 2 ms to minimize.
[2024-05-21 23:19:48] [INFO ] Deduced a trap composed of 125 places in 555 ms of which 3 ms to minimize.
[2024-05-21 23:19:49] [INFO ] Deduced a trap composed of 98 places in 524 ms of which 4 ms to minimize.
[2024-05-21 23:19:49] [INFO ] Deduced a trap composed of 122 places in 565 ms of which 7 ms to minimize.
[2024-05-21 23:19:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5680 ms
[2024-05-21 23:19:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 316 ms.
[2024-05-21 23:19:50] [INFO ] Added : 6 causal constraints over 2 iterations in 865 ms. Result :sat
Minimization took 4687 ms.
[2024-05-21 23:19:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:19:56] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2024-05-21 23:19:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:19:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-05-21 23:19:57] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2024-05-21 23:19:57] [INFO ] [Nat]Added 283 Read/Feed constraints in 234 ms returned sat
[2024-05-21 23:19:57] [INFO ] Deduced a trap composed of 10 places in 490 ms of which 2 ms to minimize.
[2024-05-21 23:19:58] [INFO ] Deduced a trap composed of 30 places in 472 ms of which 2 ms to minimize.
[2024-05-21 23:19:58] [INFO ] Deduced a trap composed of 19 places in 448 ms of which 1 ms to minimize.
[2024-05-21 23:19:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1735 ms
[2024-05-21 23:19:59] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 231 ms.
[2024-05-21 23:20:00] [INFO ] Deduced a trap composed of 51 places in 320 ms of which 1 ms to minimize.
[2024-05-21 23:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 533 ms
[2024-05-21 23:20:00] [INFO ] Added : 9 causal constraints over 3 iterations in 1718 ms. Result :sat
Minimization took 4136 ms.
[2024-05-21 23:20:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:20:05] [INFO ] [Real]Absence check using state equation in 462 ms returned sat
[2024-05-21 23:20:05] [INFO ] [Real]Added 283 Read/Feed constraints in 51 ms returned sat
[2024-05-21 23:20:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:20:06] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2024-05-21 23:20:06] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 100 places in 503 ms of which 2 ms to minimize.
[2024-05-21 23:20:07] [INFO ] Deduced a trap composed of 26 places in 546 ms of which 2 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 5 places in 278 ms of which 2 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Deduced a trap composed of 10 places in 226 ms of which 1 ms to minimize.
[2024-05-21 23:20:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1984 ms
[2024-05-21 23:20:08] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 295 ms.
[2024-05-21 23:20:09] [INFO ] Added : 4 causal constraints over 1 iterations in 696 ms. Result :sat
Minimization took 4139 ms.
[2024-05-21 23:20:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:20:14] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2024-05-21 23:20:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-21 23:20:15] [INFO ] [Nat]Absence check using state equation in 1273 ms returned sat
[2024-05-21 23:20:15] [INFO ] [Nat]Added 283 Read/Feed constraints in 306 ms returned sat
[2024-05-21 23:20:16] [INFO ] Deduced a trap composed of 36 places in 533 ms of which 3 ms to minimize.
[2024-05-21 23:20:17] [INFO ] Deduced a trap composed of 23 places in 508 ms of which 3 ms to minimize.
[2024-05-21 23:20:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1428 ms
[2024-05-21 23:20:17] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 338 ms.
[2024-05-21 23:20:18] [INFO ] Added : 2 causal constraints over 1 iterations in 729 ms. Result :sat
Minimization took 4338 ms.
[2024-05-21 23:20:22] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:20:23] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2024-05-21 23:20:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:20:23] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2024-05-21 23:20:24] [INFO ] [Nat]Added 283 Read/Feed constraints in 159 ms returned sat
[2024-05-21 23:20:24] [INFO ] Deduced a trap composed of 10 places in 611 ms of which 2 ms to minimize.
[2024-05-21 23:20:25] [INFO ] Deduced a trap composed of 15 places in 554 ms of which 2 ms to minimize.
[2024-05-21 23:20:25] [INFO ] Deduced a trap composed of 51 places in 441 ms of which 2 ms to minimize.
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 19 places in 435 ms of which 2 ms to minimize.
[2024-05-21 23:20:26] [INFO ] Deduced a trap composed of 57 places in 328 ms of which 2 ms to minimize.
[2024-05-21 23:20:27] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2024-05-21 23:20:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3365 ms
[2024-05-21 23:20:27] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 319 ms.
[2024-05-21 23:20:28] [INFO ] Added : 2 causal constraints over 1 iterations in 773 ms. Result :sat
Minimization took 4593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +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 75 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 75 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 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 23:20:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:20:33] [INFO ] Invariant cache hit.
[2024-05-21 23:20:33] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-05-21 23:20:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:20:33] [INFO ] Invariant cache hit.
[2024-05-21 23:20:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 23:20:35] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2497 ms to find 0 implicit places.
[2024-05-21 23:20:36] [INFO ] Redundant transitions in 395 ms returned []
Running 3870 sub problems to find dead transitions.
[2024-05-21 23:20:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2024-05-21 23:20:36] [INFO ] Invariant cache hit.
[2024-05-21 23:20:36] [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
[2024-05-21 23:21:54] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 9 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30064 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: 1/1 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
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 3862 unsolved
[2024-05-21 23:22:14] [INFO ] Deduced a trap composed of 8 places in 105 ms of which 1 ms to minimize.
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
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
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
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 1 ms to minimize.
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
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 0 ms to minimize.
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 8 places in 92 ms of which 0 ms to minimize.
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
[2024-05-21 23:22:15] [INFO ] Deduced a trap composed of 19 places in 120 ms of which 1 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
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
[2024-05-21 23:22:19] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 0 ms to minimize.
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3120 is UNSAT
Problem TDEAD3121 is UNSAT
Problem TDEAD3122 is UNSAT
Problem TDEAD3123 is UNSAT
Problem TDEAD3129 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3131 is UNSAT
Problem TDEAD3132 is UNSAT
Problem TDEAD3133 is UNSAT
Problem TDEAD3134 is UNSAT
Problem TDEAD3135 is UNSAT
Problem TDEAD3136 is UNSAT
Problem TDEAD3137 is UNSAT
Problem TDEAD3138 is UNSAT
Problem TDEAD3139 is UNSAT
[2024-05-21 23:22:25] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
Problem TDEAD3830 is UNSAT
Problem TDEAD3831 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3843 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3868 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 7/16 constraints. Problems are: Problem set: 629 solved, 3241 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 269/3968 variables, and 16 constraints, problems are : Problem set: 629 solved, 3241 unsolved in 30111 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: 8/8 constraints]
After SMT, in 109971ms problems are : Problem set: 629 solved, 3241 unsolved
Search for dead transitions found 629 dead transitions in 110042ms
Found 629 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 629 transitions
Dead transitions reduction (with SMT) removed 629 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 3242/3871 transitions.
Graph (complete) has 3852 edges and 269 vertex of which 254 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.2 ms
Discarding 15 places :
Also discarding 0 output transitions
Reduce places removed 33 places and 960 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 221 transition count 2282
Reduce places removed 20 places and 405 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 54 place count 201 transition count 1877
Reduce places removed 11 places and 195 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 65 place count 190 transition count 1682
Reduce places removed 7 places and 81 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 72 place count 183 transition count 1601
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 74 place count 181 transition count 1549
Reduce places removed 1 places and 19 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 75 place count 180 transition count 1530
Reduce places removed 1 places and 23 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 76 place count 179 transition count 1507
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 85 place count 170 transition count 1383
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 7 with 9 rules applied. Total rules applied 94 place count 170 transition count 1383
Deduced a syphon composed of 2 places in 1 ms
Applied a total of 94 rules in 78 ms. Remains 170 /269 variables (removed 99) and now considering 1383/3242 (removed 1859) transitions.
[2024-05-21 23:22:26] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
// Phase 1: matrix 1284 rows 170 cols
[2024-05-21 23:22:26] [INFO ] Computed 9 invariants in 7 ms
[2024-05-21 23:22:26] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-21 23:22:26] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-05-21 23:22:26] [INFO ] Invariant cache hit.
[2024-05-21 23:22:26] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-21 23:22:27] [INFO ] Implicit Places using invariants and state equation in 891 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 170/269 places, 1383/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 114197 ms. Remains : 170/269 places, 1383/3871 transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:22:27] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
Found an invariant !
This invariant on transitions {4=1, 51=1, 1080=1, 1234=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 1080=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:22:28] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
// Phase 1: matrix 1284 rows 168 cols
[2024-05-21 23:22:28] [INFO ] Computed 7 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000104 steps (2 resets) in 525 ms. (1901 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 5283 ms. (1135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:22:33] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-05-21 23:22:33] [INFO ] Invariant cache hit.
[2024-05-21 23:22:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 23:22:34] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-05-21 23:22:34] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-21 23:22:34] [INFO ] [Real]Added 140 Read/Feed constraints in 33 ms returned sat
[2024-05-21 23:22:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-21 23:22:34] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-21 23:22:34] [INFO ] [Nat]Added 140 Read/Feed constraints in 51 ms returned sat
[2024-05-21 23:22:34] [INFO ] Deduced a trap composed of 39 places in 286 ms of which 2 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 1 ms to minimize.
[2024-05-21 23:22:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 615 ms
[2024-05-21 23:22:35] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 95 ms.
[2024-05-21 23:22:35] [INFO ] Added : 5 causal constraints over 2 iterations in 267 ms. Result :sat
Minimization took 556 ms.
[2024-05-21 23:22:36] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Real]Added 140 Read/Feed constraints in 19 ms returned sat
[2024-05-21 23:22:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-21 23:22:36] [INFO ] [Nat]Added 140 Read/Feed constraints in 32 ms returned sat
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 24 places in 188 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 63 places in 189 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 2 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 35 places in 182 ms of which 1 ms to minimize.
[2024-05-21 23:22:37] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 16 places in 197 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 1 ms to minimize.
[2024-05-21 23:22:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1640 ms
[2024-05-21 23:22:38] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 113 ms.
[2024-05-21 23:22:38] [INFO ] Added : 11 causal constraints over 3 iterations in 338 ms. Result :sat
Minimization took 678 ms.
[2024-05-21 23:22:39] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:22:39] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-21 23:22:39] [INFO ] [Real]Added 140 Read/Feed constraints in 22 ms returned sat
[2024-05-21 23:22:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 23:22:40] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2024-05-21 23:22:40] [INFO ] [Nat]Added 140 Read/Feed constraints in 70 ms returned sat
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 2 ms to minimize.
[2024-05-21 23:22:40] [INFO ] Deduced a trap composed of 34 places in 274 ms of which 2 ms to minimize.
[2024-05-21 23:22:41] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 2 ms to minimize.
[2024-05-21 23:22:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 924 ms
[2024-05-21 23:22:41] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 117 ms.
[2024-05-21 23:22:41] [INFO ] Added : 14 causal constraints over 5 iterations in 574 ms. Result :sat
Minimization took 670 ms.
[2024-05-21 23:22:42] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:22:42] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2024-05-21 23:22:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 23:22:43] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-21 23:22:43] [INFO ] [Nat]Added 140 Read/Feed constraints in 87 ms returned sat
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 20 places in 241 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2024-05-21 23:22:43] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 32 places in 165 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 1 ms to minimize.
[2024-05-21 23:22:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1345 ms
[2024-05-21 23:22:44] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 92 ms.
[2024-05-21 23:22:44] [INFO ] Added : 14 causal constraints over 3 iterations in 340 ms. Result :sat
Minimization took 613 ms.
[2024-05-21 23:22:45] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:22:45] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2024-05-21 23:22:45] [INFO ] [Real]Added 140 Read/Feed constraints in 23 ms returned sat
[2024-05-21 23:22:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:45] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:22:46] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-21 23:22:46] [INFO ] [Nat]Added 140 Read/Feed constraints in 74 ms returned sat
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 1 ms to minimize.
[2024-05-21 23:22:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 785 ms
[2024-05-21 23:22:47] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 122 ms.
[2024-05-21 23:22:47] [INFO ] Added : 12 causal constraints over 3 iterations in 477 ms. Result :sat
Minimization took 621 ms.
[2024-05-21 23:22:48] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2024-05-21 23:22:48] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2024-05-21 23:22:48] [INFO ] [Real]Added 140 Read/Feed constraints in 23 ms returned sat
[2024-05-21 23:22:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:22:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:22:48] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-21 23:22:48] [INFO ] [Nat]Added 140 Read/Feed constraints in 29 ms returned sat
[2024-05-21 23:22:49] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 2 ms to minimize.
[2024-05-21 23:22:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2024-05-21 23:22:49] [INFO ] Computed and/alt/rep : 439/1893/438 causal constraints (skipped 845 transitions) in 94 ms.
[2024-05-21 23:22:49] [INFO ] Added : 1 causal constraints over 1 iterations in 265 ms. Result :sat
Minimization took 672 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 1383/1383 transitions.
Applied a total of 0 rules in 32 ms. Remains 168 /168 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 168/168 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 1383/1383 transitions.
Applied a total of 0 rules in 23 ms. Remains 168 /168 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2024-05-21 23:22:50] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-05-21 23:22:50] [INFO ] Invariant cache hit.
[2024-05-21 23:22:51] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-21 23:22:51] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-05-21 23:22:51] [INFO ] Invariant cache hit.
[2024-05-21 23:22:51] [INFO ] State equation strengthened by 140 read => feed constraints.
[2024-05-21 23:22:51] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2024-05-21 23:22:51] [INFO ] Redundant transitions in 60 ms returned []
Running 1382 sub problems to find dead transitions.
[2024-05-21 23:22:51] [INFO ] Flow matrix only has 1284 transitions (discarded 99 similar events)
[2024-05-21 23:22:51] [INFO ] Invariant cache hit.
[2024-05-21 23:22:51] [INFO ] State equation strengthened by 140 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-05-21 23:23:03] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-21 23:23:05] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD642 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD677 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1381 is UNSAT
Problem TDEAD1382 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1284/1452 variables, 168/177 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 140/317 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
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 Real declared 1452/1452 variables, and 317 constraints, problems are : Problem set: 228 solved, 1154 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 1382/1382 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 228 solved, 1154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/168 variables, 7/7 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/168 variables, 2/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 3 (OVERLAPS) 1284/1452 variables, 168/177 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1452 variables, 140/317 constraints. Problems are: Problem set: 228 solved, 1154 unsolved
Problem TDEAD83 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 TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD473 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 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 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 TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/1452 variables, 1154/1471 constraints. Problems are: Problem set: 381 solved, 1001 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1452/1452 variables, and 1471 constraints, problems are : Problem set: 381 solved, 1001 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 168/168 constraints, ReadFeed: 140/140 constraints, PredecessorRefiner: 1154/1382 constraints, Known Traps: 2/2 constraints]
After SMT, in 67583ms problems are : Problem set: 381 solved, 1001 unsolved
Search for dead transitions found 381 dead transitions in 67612ms
Found 381 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 381 transitions
Dead transitions reduction (with SMT) removed 381 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 168/168 places, 1002/1383 transitions.
Reduce places removed 31 places and 400 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 137 transition count 602
Reduce places removed 17 places and 119 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 48 place count 120 transition count 483
Reduce places removed 5 places and 40 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 53 place count 115 transition count 443
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 113 transition count 427
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 112 transition count 422
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 60 place count 108 transition count 394
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 108 transition count 394
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 107 transition count 388
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 107 transition count 388
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 66 rules in 26 ms. Remains 107 /168 variables (removed 61) and now considering 388/1002 (removed 614) transitions.
[2024-05-21 23:23:59] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
// Phase 1: matrix 369 rows 107 cols
[2024-05-21 23:23:59] [INFO ] Computed 13 invariants in 3 ms
[2024-05-21 23:23:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-21 23:23:59] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
[2024-05-21 23:23:59] [INFO ] Invariant cache hit.
[2024-05-21 23:23:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 23:23:59] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 107/168 places, 388/1383 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69279 ms. Remains : 107/168 places, 388/1383 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
FORMULA BugTracking-PT-q8m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:23:59] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
Found an invariant !
This invariant on transitions {3=1, 38=1, 294=1, 352=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {5=1, 294=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:24:00] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
// Phase 1: matrix 369 rows 102 cols
[2024-05-21 23:24:00] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000160 steps (2 resets) in 391 ms. (2551 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 833 ms. (1199 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:24:01] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
[2024-05-21 23:24:01] [INFO ] Invariant cache hit.
[2024-05-21 23:24:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:24:01] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-21 23:24:01] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 23:24:01] [INFO ] [Real]Added 67 Read/Feed constraints in 15 ms returned sat
[2024-05-21 23:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:24:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-21 23:24:01] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-21 23:24:01] [INFO ] [Nat]Added 67 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:24:01] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:24:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 352 ms
[2024-05-21 23:24:02] [INFO ] Computed and/alt/rep : 216/1011/216 causal constraints (skipped 152 transitions) in 30 ms.
[2024-05-21 23:24:02] [INFO ] Added : 27 causal constraints over 6 iterations in 168 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 388/388 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 102/102 places, 388/388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 388/388 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2024-05-21 23:24:02] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
[2024-05-21 23:24:02] [INFO ] Invariant cache hit.
[2024-05-21 23:24:02] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 23:24:02] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
[2024-05-21 23:24:02] [INFO ] Invariant cache hit.
[2024-05-21 23:24:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-21 23:24:02] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-21 23:24:02] [INFO ] Redundant transitions in 2 ms returned []
Running 387 sub problems to find dead transitions.
[2024-05-21 23:24:02] [INFO ] Flow matrix only has 369 transitions (discarded 19 similar events)
[2024-05-21 23:24:02] [INFO ] Invariant cache hit.
[2024-05-21 23:24:02] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 387 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 387 unsolved
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD245 is UNSAT
At refinement iteration 2 (OVERLAPS) 369/471 variables, 102/110 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/471 variables, 67/177 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 384 unsolved
[2024-05-21 23:24:09] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/471 variables, 1/178 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 7 (OVERLAPS) 0/471 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 178 constraints, problems are : Problem set: 3 solved, 384 unsolved in 12467 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 387/387 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 3 (OVERLAPS) 369/471 variables, 102/111 constraints. Problems are: Problem set: 3 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 67/178 constraints. Problems are: Problem set: 3 solved, 384 unsolved
Problem TDEAD216 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 384/562 constraints. Problems are: Problem set: 5 solved, 382 unsolved
[2024-05-21 23:24:20] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:24:21] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/471 variables, 2/564 constraints. Problems are: Problem set: 5 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 0/564 constraints. Problems are: Problem set: 5 solved, 382 unsolved
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:24:34] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/471 variables, 2/566 constraints. Problems are: Problem set: 5 solved, 382 unsolved
[2024-05-21 23:24:39] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:24:41] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 3/569 constraints. Problems are: Problem set: 5 solved, 382 unsolved
[2024-05-21 23:24:45] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/471 variables, and 570 constraints, problems are : Problem set: 35 solved, 352 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 384/387 constraints, Known Traps: 9/9 constraints]
After SMT, in 43169ms problems are : Problem set: 35 solved, 352 unsolved
Search for dead transitions found 35 dead transitions in 43176ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 102/102 places, 353/388 transitions.
Graph (complete) has 588 edges and 102 vertex of which 101 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 11 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 342
Applied a total of 2 rules in 14 ms. Remains 100 /102 variables (removed 2) and now considering 342/353 (removed 11) transitions.
[2024-05-21 23:24:46] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
// Phase 1: matrix 324 rows 100 cols
[2024-05-21 23:24:46] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 23:24:46] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:24:46] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:46] [INFO ] Invariant cache hit.
[2024-05-21 23:24:46] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 23:24:46] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 100/102 places, 342/388 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44010 ms. Remains : 100/102 places, 342/388 transitions.
[2024-05-21 23:24:46] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
Found an invariant !
This invariant on transitions {4=1, 249=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {2=1, 249=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:24:46] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000123 steps (2 resets) in 326 ms. (3058 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 581 ms. (1718 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:24:47] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:47] [INFO ] Invariant cache hit.
[2024-05-21 23:24:47] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:24:47] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-21 23:24:47] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 23:24:47] [INFO ] [Real]Added 63 Read/Feed constraints in 11 ms returned sat
[2024-05-21 23:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:24:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:24:47] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 23:24:47] [INFO ] [Nat]Added 63 Read/Feed constraints in 15 ms returned sat
[2024-05-21 23:24:47] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:24:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-21 23:24:47] [INFO ] Computed and/alt/rep : 202/958/202 causal constraints (skipped 121 transitions) in 26 ms.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-21 23:24:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 228 ms
[2024-05-21 23:24:48] [INFO ] Added : 37 causal constraints over 9 iterations in 443 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Support contains 1 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 342/342 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 100/100 places, 342/342 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2024-05-21 23:24:48] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:48] [INFO ] Invariant cache hit.
[2024-05-21 23:24:48] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-21 23:24:48] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:48] [INFO ] Invariant cache hit.
[2024-05-21 23:24:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 23:24:49] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-21 23:24:49] [INFO ] Redundant transitions in 1 ms returned []
Running 341 sub problems to find dead transitions.
[2024-05-21 23:24:49] [INFO ] Flow matrix only has 324 transitions (discarded 18 similar events)
[2024-05-21 23:24:49] [INFO ] Invariant cache hit.
[2024-05-21 23:24:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
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 TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 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
At refinement iteration 2 (OVERLAPS) 324/424 variables, 100/107 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/424 variables, 63/170 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 23:24:52] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 1/171 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/171 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 6 (OVERLAPS) 0/424 variables, 0/171 constraints. Problems are: Problem set: 60 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 171 constraints, problems are : Problem set: 60 solved, 281 unsolved in 8780 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 60 solved, 281 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 7/7 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 1/8 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 3 (OVERLAPS) 324/422 variables, 98/106 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 63/169 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 215/384 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:25:00] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 2/386 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:25:04] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 2/388 constraints. Problems are: Problem set: 60 solved, 281 unsolved
[2024-05-21 23:25:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/389 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/389 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 10 (OVERLAPS) 2/424 variables, 2/391 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 66/457 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/457 constraints. Problems are: Problem set: 60 solved, 281 unsolved
At refinement iteration 13 (OVERLAPS) 0/424 variables, 0/457 constraints. Problems are: Problem set: 60 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 457 constraints, problems are : Problem set: 60 solved, 281 unsolved in 24648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 100/100 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 281/341 constraints, Known Traps: 6/6 constraints]
After SMT, in 33912ms problems are : Problem set: 60 solved, 281 unsolved
Search for dead transitions found 60 dead transitions in 33917ms
Found 60 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 60 transitions
Dead transitions reduction (with SMT) removed 60 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/100 places, 282/342 transitions.
Graph (complete) has 508 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 96 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 96 transition count 272
Applied a total of 5 rules in 5 ms. Remains 96 /100 variables (removed 4) and now considering 272/282 (removed 10) transitions.
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
// Phase 1: matrix 252 rows 96 cols
[2024-05-21 23:25:23] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 23:25:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:23] [INFO ] Invariant cache hit.
[2024-05-21 23:25:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:25:23] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/100 places, 272/342 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34906 ms. Remains : 96/100 places, 272/342 transitions.
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:25:23] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 1000196 steps (2 resets) in 316 ms. (3155 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 575 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
[2024-05-21 23:25:24] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:24] [INFO ] Invariant cache hit.
[2024-05-21 23:25:24] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:25:24] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 23:25:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:25:24] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2024-05-21 23:25:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:25:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:25:24] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-21 23:25:24] [INFO ] [Nat]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-21 23:25:24] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 17 ms.
[2024-05-21 23:25:24] [INFO ] Added : 33 causal constraints over 7 iterations in 116 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 23:25:24] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:24] [INFO ] Invariant cache hit.
[2024-05-21 23:25:25] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 23:25:25] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:25] [INFO ] Invariant cache hit.
[2024-05-21 23:25:25] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:25:25] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-05-21 23:25:25] [INFO ] Redundant transitions in 0 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 23:25:25] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:25] [INFO ] Invariant cache hit.
[2024-05-21 23:25:25] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:25:28] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7897 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:25:35] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:25:37] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:25:38] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 435 constraints, problems are : Problem set: 0 solved, 271 unsolved in 14464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints]
After SMT, in 22554ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 22557ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22876 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 23:25:47] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
RANDOM walk for 40548 steps (8 resets) in 125 ms. (321 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 1/1 properties
[2024-05-21 23:25:48] [INFO ] Flatten gal took : 90 ms
[2024-05-21 23:25:48] [INFO ] Flatten gal took : 60 ms
[2024-05-21 23:25:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality142151418116998902.gal : 38 ms
[2024-05-21 23:25:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2128370910999824409.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality142151418116998902.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2128370910999824409.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality2128370910999824409.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 62964
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62964 after 194805
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :194805 after 458230
Interrupted probabilistic random walk after 1183526 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :0 out of 1
Probabilistic random walk after 1183526 steps, saw 719935 distinct states, run finished after 3004 ms. (steps per millisecond=393 ) properties seen :0
[2024-05-21 23:25:51] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:51] [INFO ] Invariant cache hit.
[2024-05-21 23:25:51] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 127/335 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/342 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/348 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 127/335 variables, 35/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/342 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/348 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 272/272 transitions.
RANDOM walk for 40439 steps (8 resets) in 17 ms. (2246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1328097 steps, run timeout after 3001 ms. (steps per millisecond=442 ) properties seen :0 out of 1
Probabilistic random walk after 1328097 steps, saw 760411 distinct states, run finished after 3001 ms. (steps per millisecond=442 ) properties seen :0
[2024-05-21 23:25:54] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:54] [INFO ] Invariant cache hit.
[2024-05-21 23:25:54] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 127/335 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/342 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/348 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 127/335 variables, 35/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/342 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/348 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 286ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 23:25:54] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:54] [INFO ] Invariant cache hit.
[2024-05-21 23:25:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-21 23:25:54] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:54] [INFO ] Invariant cache hit.
[2024-05-21 23:25:54] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:25:55] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-21 23:25:55] [INFO ] Redundant transitions in 0 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 23:25:55] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:25:55] [INFO ] Invariant cache hit.
[2024-05-21 23:25:55] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:25:57] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :458230 after 984823
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:26:04] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 0 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:26:07] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 435 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints]
After SMT, in 37586ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 37589ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37865 ms. Remains : 96/96 places, 272/272 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 406 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 92 transition count 251
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 77 transition count 182
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 77 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 77 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 76 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 76 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 75 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 75 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 75 transition count 175
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 69 place count 70 transition count 170
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 66 transition count 188
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 66 transition count 183
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 87 place count 61 transition count 183
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 61 transition count 183
Applied a total of 89 rules in 48 ms. Remains 61 /96 variables (removed 35) and now considering 183/272 (removed 89) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 61 cols
[2024-05-21 23:26:32] [INFO ] Computed 8 invariants in 5 ms
[2024-05-21 23:26:32] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-21 23:26:32] [INFO ] After 55ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:26:32] [INFO ] After 67ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 23:26:32] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2024-05-21 23:26:32] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:26:32] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:26:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7372780005058121746.gal : 7 ms
[2024-05-21 23:26:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4458753222479039060.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7372780005058121746.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4458753222479039060.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4458753222479039060.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 64506
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :64506 after 196347
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :196347 after 459772
Detected timeout of ITS tools.
[2024-05-21 23:26:38] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:26:38] [INFO ] Applying decomposition
[2024-05-21 23:26:38] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1160256322376618014.txt' '-o' '/tmp/graph1160256322376618014.bin' '-w' '/tmp/graph1160256322376618014.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1160256322376618014.bin' '-l' '-1' '-v' '-w' '/tmp/graph1160256322376618014.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:39] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-21 23:26:39] [INFO ] Flatten gal took : 122 ms
[2024-05-21 23:26:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 5 ms.
[2024-05-21 23:26:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5147790966186194747.gal : 12 ms
[2024-05-21 23:26:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11648558245320964632.prop : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5147790966186194747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11648558245320964632.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality11648558245320964632.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 6407
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6407 after 21750
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :21750 after 69223
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :69223 after 192338
Detected timeout of ITS tools.
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:26:47] [INFO ] Applying decomposition
[2024-05-21 23:26:47] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8878428976814104880.txt' '-o' '/tmp/graph8878428976814104880.bin' '-w' '/tmp/graph8878428976814104880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8878428976814104880.bin' '-l' '-1' '-v' '-w' '/tmp/graph8878428976814104880.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:26:48] [INFO ] Decomposing Gal with order
[2024-05-21 23:26:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:26:48] [INFO ] Removed a total of 45 redundant transitions.
[2024-05-21 23:26:48] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:26:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 1 ms.
[2024-05-21 23:26:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16035459940140624496.gal : 13 ms
[2024-05-21 23:26:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9807940338091278874.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16035459940140624496.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9807940338091278874.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9807940338091278874.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 6.66581e+07
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :192338 after 435317
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.66581e+07 after 1.898e+11
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :435317 after 1.34852e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30530 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, 1, +inf, 1, +inf, 1, +inf, +inf]
Starting property specific reduction for BugTracking-PT-q8m256-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 23:27:03] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
// Phase 1: matrix 252 rows 96 cols
[2024-05-21 23:27:03] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10109 steps (2 resets) in 4 ms. (2021 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-21 23:27:03] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:03] [INFO ] Invariant cache hit.
[2024-05-21 23:27:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:27:03] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 23:27:03] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:27:03] [INFO ] [Real]Added 55 Read/Feed constraints in 7 ms returned sat
[2024-05-21 23:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:27:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:27:03] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 23:27:03] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2024-05-21 23:27:03] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 17 ms to minimize.
[2024-05-21 23:27:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 23:27:03] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 18 ms.
[2024-05-21 23:27:03] [INFO ] Added : 40 causal constraints over 9 iterations in 148 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 23:27:03] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-21 23:27:04] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000215 steps (2 resets) in 575 ms. (1736 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 717 ms. (1392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-21 23:27:05] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:05] [INFO ] Invariant cache hit.
[2024-05-21 23:27:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:27:05] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-21 23:27:05] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:27:05] [INFO ] [Real]Added 55 Read/Feed constraints in 9 ms returned sat
[2024-05-21 23:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:27:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2024-05-21 23:27:05] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-21 23:27:05] [INFO ] [Nat]Added 55 Read/Feed constraints in 20 ms returned sat
[2024-05-21 23:27:05] [INFO ] Computed and/alt/rep : 211/1047/211 causal constraints (skipped 40 transitions) in 24 ms.
[2024-05-21 23:27:05] [INFO ] Added : 33 causal constraints over 7 iterations in 173 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 96/96 places, 272/272 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
[2024-05-21 23:27:06] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:06] [INFO ] Invariant cache hit.
[2024-05-21 23:27:06] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-21 23:27:06] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:06] [INFO ] Invariant cache hit.
[2024-05-21 23:27:06] [INFO ] State equation strengthened by 55 read => feed constraints.
[2024-05-21 23:27:06] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-21 23:27:06] [INFO ] Redundant transitions in 1 ms returned []
Running 271 sub problems to find dead transitions.
[2024-05-21 23:27:06] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:06] [INFO ] Invariant cache hit.
[2024-05-21 23:27:06] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 252/348 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:27:09] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7474 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (OVERLAPS) 252/348 variables, 96/104 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 55/159 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 271/430 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:27:16] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:27:19] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 9 (OVERLAPS) 0/348 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 435 constraints, problems are : Problem set: 0 solved, 271 unsolved in 13424 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints]
After SMT, in 21161ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 21165ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21657 ms. Remains : 96/96 places, 272/272 transitions.
[2024-05-21 23:27:27] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
Found an invariant !
This invariant on transitions {0=1, 179=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 179=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40427 steps (8 resets) in 26 ms. (1497 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-21 23:27:27] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:27:27] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:27:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7766506061378432211.gal : 2 ms
[2024-05-21 23:27:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13042375657147357049.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7766506061378432211.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13042375657147357049.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13042375657147357049.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :19 after 36
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :36 after 69
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :69 after 134
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :134 after 257
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :257 after 62964
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :62964 after 194805
Interrupted probabilistic random walk after 1062810 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1062810 steps, saw 666762 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
[2024-05-21 23:27:30] [INFO ] Flow matrix only has 252 transitions (discarded 20 similar events)
[2024-05-21 23:27:30] [INFO ] Invariant cache hit.
[2024-05-21 23:27:30] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 127/335 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/335 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/342 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/342 variables, 7/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/348 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/348 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 107/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 21/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/115 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 93/208 variables, 37/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/208 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 127/335 variables, 35/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/335 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 24/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 7/342 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/342 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/348 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/348 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 348/348 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 272/272 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 272/272 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 272/272 transitions.
RANDOM walk for 40504 steps (8 resets) in 13 ms. (2893 steps per ms) remains 1/1 properties
BEST_FIRST walk for 25198 steps (5 resets) in 42 ms. (586 steps per ms) remains 0/1 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q8m256-UpperBounds-01 in 28067 ms.
[2024-05-21 23:27:31] [INFO ] Flatten gal took : 23 ms
[2024-05-21 23:27:31] [INFO ] Applying decomposition
[2024-05-21 23:27:31] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6891267885698920589.txt' '-o' '/tmp/graph6891267885698920589.bin' '-w' '/tmp/graph6891267885698920589.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6891267885698920589.bin' '-l' '-1' '-v' '-w' '/tmp/graph6891267885698920589.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:27:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:27:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:27:31] [INFO ] Removed a total of 6 redundant transitions.
[2024-05-21 23:27:31] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:27:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 1 ms.
[2024-05-21 23:27:31] [INFO ] Time to serialize gal into /tmp/UpperBounds12396706556837230792.gal : 2 ms
[2024-05-21 23:27:31] [INFO ] Time to serialize properties into /tmp/UpperBounds17920670136470337180.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12396706556837230792.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17920670136470337180.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds17920670136470337180.prop.

BK_STOP 1716334315564

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-q8m256"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m256, 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 r048-tajo-171620399500445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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