MCC'2024- Execution of r048-tajo-171620399400381

About the Execution of ITS-Tools for BugTracking-PT-q3m256

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
0.000	784454.00	0.00	0.00	0 ? 0 14 0 0 0 0 0 1 0 0 0 0 0 0	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399400381.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-q3m256, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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:23 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-q3m256-UpperBounds-00
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-01
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-02
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-03
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-04
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-05
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-06
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-07
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-08
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-09
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-10
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-11
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-12
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-13
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-14
FORMULA_NAME BugTracking-PT-q3m256-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716332394792

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-q3m256
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 22:59:56] [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 22:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:59:57] [INFO ] Load time of PNML (sax parser for PT used): 1189 ms
[2024-05-21 22:59:57] [INFO ] Transformed 754 places.
[2024-05-21 22:59:57] [INFO ] Transformed 27370 transitions.
[2024-05-21 22:59:58] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1485 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 514 places in 119 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 22:59:58] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
// Phase 1: matrix 2642 rows 240 cols
[2024-05-21 22:59:58] [INFO ] Computed 10 invariants in 55 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
RANDOM walk for 10012 steps (2 resets) in 35 ms. (278 steps per ms)
BEST_FIRST walk for 70006 steps (14 resets) in 172 ms. (404 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
[2024-05-21 22:59:58] [INFO ] Flow matrix only has 2642 transitions (discarded 127 similar events)
[2024-05-21 22:59:58] [INFO ] Invariant cache hit.
[2024-05-21 22:59:58] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2024-05-21 22:59:59] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2024-05-21 22:59:59] [INFO ] State equation strengthened by 255 read => feed constraints.
[2024-05-21 22:59:59] [INFO ] [Real]Added 255 Read/Feed constraints in 46 ms returned sat
[2024-05-21 22:59:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 22:59:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-21 23:00:00] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2024-05-21 23:00:00] [INFO ] [Nat]Added 255 Read/Feed constraints in 85 ms returned sat
[2024-05-21 23:00:00] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 380 ms.
[2024-05-21 23:00:01] [INFO ] Added : 2 causal constraints over 1 iterations in 727 ms. Result :sat
Minimization took 706 ms.
[2024-05-21 23:00:02] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-21 23:00:02] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2024-05-21 23:00:02] [INFO ] [Real]Added 255 Read/Feed constraints in 164 ms returned sat
[2024-05-21 23:00:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:00:03] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2024-05-21 23:00:03] [INFO ] [Nat]Added 255 Read/Feed constraints in 70 ms returned sat
[2024-05-21 23:00:04] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 265 ms.
[2024-05-21 23:00:04] [INFO ] Added : 2 causal constraints over 1 iterations in 667 ms. Result :sat
Minimization took 641 ms.
[2024-05-21 23:00:05] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:05] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2024-05-21 23:00:05] [INFO ] [Real]Added 255 Read/Feed constraints in 81 ms returned sat
[2024-05-21 23:00:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:06] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-05-21 23:00:06] [INFO ] [Nat]Added 255 Read/Feed constraints in 114 ms returned sat
[2024-05-21 23:00:07] [INFO ] Deduced a trap composed of 21 places in 401 ms of which 18 ms to minimize.
[2024-05-21 23:00:07] [INFO ] Deduced a trap composed of 40 places in 468 ms of which 2 ms to minimize.
[2024-05-21 23:00:08] [INFO ] Deduced a trap composed of 39 places in 345 ms of which 1 ms to minimize.
[2024-05-21 23:00:08] [INFO ] Deduced a trap composed of 66 places in 506 ms of which 2 ms to minimize.
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 26 places in 411 ms of which 2 ms to minimize.
[2024-05-21 23:00:09] [INFO ] Deduced a trap composed of 12 places in 537 ms of which 2 ms to minimize.
[2024-05-21 23:00:10] [INFO ] Deduced a trap composed of 52 places in 479 ms of which 2 ms to minimize.
[2024-05-21 23:00:10] [INFO ] Deduced a trap composed of 75 places in 431 ms of which 3 ms to minimize.
[2024-05-21 23:00:11] [INFO ] Deduced a trap composed of 41 places in 335 ms of which 2 ms to minimize.
[2024-05-21 23:00:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:00:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:11] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2024-05-21 23:00:11] [INFO ] [Real]Added 255 Read/Feed constraints in 40 ms returned sat
[2024-05-21 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:00:12] [INFO ] [Nat]Absence check using state equation in 487 ms returned sat
[2024-05-21 23:00:12] [INFO ] [Nat]Added 255 Read/Feed constraints in 151 ms returned sat
[2024-05-21 23:00:12] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 190 ms.
[2024-05-21 23:00:13] [INFO ] Added : 3 causal constraints over 1 iterations in 534 ms. Result :sat
Minimization took 912 ms.
[2024-05-21 23:00:14] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:15] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2024-05-21 23:00:15] [INFO ] [Real]Added 255 Read/Feed constraints in 69 ms returned sat
[2024-05-21 23:00:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:15] [INFO ] [Nat]Absence check using state equation in 475 ms returned sat
[2024-05-21 23:00:16] [INFO ] [Nat]Added 255 Read/Feed constraints in 104 ms returned sat
[2024-05-21 23:00:16] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 295 ms.
[2024-05-21 23:00:16] [INFO ] Added : 6 causal constraints over 2 iterations in 732 ms. Result :sat
Minimization took 630 ms.
[2024-05-21 23:00:17] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-21 23:00:18] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-21 23:00:18] [INFO ] [Real]Added 255 Read/Feed constraints in 48 ms returned sat
[2024-05-21 23:00:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-21 23:00:18] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2024-05-21 23:00:18] [INFO ] [Nat]Added 255 Read/Feed constraints in 194 ms returned sat
[2024-05-21 23:00:19] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 262 ms.
[2024-05-21 23:00:19] [INFO ] Added : 5 causal constraints over 1 iterations in 630 ms. Result :sat
Minimization took 732 ms.
[2024-05-21 23:00:20] [INFO ] [Real]Absence check using 10 positive place invariants in 92 ms returned sat
[2024-05-21 23:00:23] [INFO ] [Real]Absence check using state equation in 2647 ms returned sat
[2024-05-21 23:00:23] [INFO ] [Real]Added 255 Read/Feed constraints in 51 ms returned sat
[2024-05-21 23:00:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:23] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2024-05-21 23:00:24] [INFO ] [Nat]Added 255 Read/Feed constraints in 137 ms returned sat
[2024-05-21 23:00:24] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 3 ms to minimize.
[2024-05-21 23:00:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2024-05-21 23:00:24] [INFO ] Computed and/alt/rep : 355/1401/355 causal constraints (skipped 2285 transitions) in 208 ms.
[2024-05-21 23:00:26] [INFO ] Deduced a trap composed of 18 places in 355 ms of which 1 ms to minimize.
[2024-05-21 23:00:26] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 2 ms to minimize.
[2024-05-21 23:00:26] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2024-05-21 23:00:27] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 1 ms to minimize.
[2024-05-21 23:00:27] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 1 ms to minimize.
[2024-05-21 23:00:28] [INFO ] Deduced a trap composed of 40 places in 401 ms of which 1 ms to minimize.
[2024-05-21 23:00:28] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 2862 ms
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 2, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
Support contains 7 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Graph (complete) has 3422 edges and 240 vertex of which 238 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.35 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 237 transition count 2750
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 237 transition count 2750
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 229 transition count 2747
Applied a total of 19 rules in 443 ms. Remains 229 /240 variables (removed 11) and now considering 2747/2769 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 461 ms. Remains : 229/240 places, 2747/2769 transitions.
[2024-05-21 23:00:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
Found an invariant !
This invariant on transitions {4=1, 1722=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 3 ms.
This minimized invariant on transitions {0=1, 1722=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 7) seen :[0, 2, 0, 0, 0, 1, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 2, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
[2024-05-21 23:00:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2024-05-21 23:00:30] [INFO ] Computed 8 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0, 0, 0, 1, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1, 1]
FORMULA BugTracking-PT-q3m256-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000043 steps (2 resets) in 853 ms. (1171 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 12739 ms. (470 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 14, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 23:00:43] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 23:00:43] [INFO ] Invariant cache hit.
[2024-05-21 23:00:43] [INFO ] [Real]Absence check using 8 positive place invariants in 24 ms returned sat
[2024-05-21 23:00:44] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2024-05-21 23:00:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 23:00:44] [INFO ] [Real]Added 241 Read/Feed constraints in 56 ms returned sat
[2024-05-21 23:00:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:45] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-21 23:00:45] [INFO ] [Nat]Added 241 Read/Feed constraints in 128 ms returned sat
[2024-05-21 23:00:46] [INFO ] Deduced a trap composed of 7 places in 596 ms of which 1 ms to minimize.
[2024-05-21 23:00:46] [INFO ] Deduced a trap composed of 33 places in 346 ms of which 2 ms to minimize.
[2024-05-21 23:00:46] [INFO ] Deduced a trap composed of 10 places in 340 ms of which 1 ms to minimize.
[2024-05-21 23:00:47] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2024-05-21 23:00:47] [INFO ] Deduced a trap composed of 38 places in 397 ms of which 2 ms to minimize.
[2024-05-21 23:00:48] [INFO ] Deduced a trap composed of 58 places in 374 ms of which 2 ms to minimize.
[2024-05-21 23:00:48] [INFO ] Deduced a trap composed of 48 places in 405 ms of which 3 ms to minimize.
[2024-05-21 23:00:49] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2024-05-21 23:00:49] [INFO ] Deduced a trap composed of 27 places in 333 ms of which 2 ms to minimize.
[2024-05-21 23:00:49] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 4145 ms
[2024-05-21 23:00:49] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 220 ms.
[2024-05-21 23:00:50] [INFO ] Added : 10 causal constraints over 4 iterations in 993 ms. Result :sat
Minimization took 2289 ms.
[2024-05-21 23:00:53] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:53] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-05-21 23:00:53] [INFO ] [Real]Added 241 Read/Feed constraints in 73 ms returned sat
[2024-05-21 23:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:00:54] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2024-05-21 23:00:54] [INFO ] [Nat]Added 241 Read/Feed constraints in 56 ms returned sat
[2024-05-21 23:00:54] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 208 ms.
[2024-05-21 23:00:55] [INFO ] Added : 2 causal constraints over 1 iterations in 507 ms. Result :sat
Minimization took 2803 ms.
[2024-05-21 23:00:58] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:00:58] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2024-05-21 23:00:58] [INFO ] [Real]Added 241 Read/Feed constraints in 59 ms returned sat
[2024-05-21 23:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:00:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:00:59] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2024-05-21 23:00:59] [INFO ] [Nat]Added 241 Read/Feed constraints in 192 ms returned sat
[2024-05-21 23:00:59] [INFO ] Deduced a trap composed of 19 places in 316 ms of which 4 ms to minimize.
[2024-05-21 23:01:00] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 13 ms to minimize.
[2024-05-21 23:01:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 640 ms
[2024-05-21 23:01:00] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 209 ms.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 1 ms to minimize.
[2024-05-21 23:01:01] [INFO ] Deduced a trap composed of 21 places in 356 ms of which 3 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 32 places in 358 ms of which 2 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 28 places in 328 ms of which 2 ms to minimize.
[2024-05-21 23:01:02] [INFO ] Deduced a trap composed of 49 places in 264 ms of which 2 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Deduced a trap composed of 51 places in 338 ms of which 2 ms to minimize.
[2024-05-21 23:01:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2794 ms
[2024-05-21 23:01:03] [INFO ] Added : 7 causal constraints over 3 iterations in 3569 ms. Result :sat
Minimization took 2135 ms.
[2024-05-21 23:01:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2024-05-21 23:01:06] [INFO ] [Real]Added 241 Read/Feed constraints in 34 ms returned sat
[2024-05-21 23:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:01:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:01:07] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2024-05-21 23:01:07] [INFO ] [Nat]Added 241 Read/Feed constraints in 126 ms returned sat
[2024-05-21 23:01:07] [INFO ] Deduced a trap composed of 66 places in 493 ms of which 3 ms to minimize.
[2024-05-21 23:01:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 611 ms
[2024-05-21 23:01:08] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 214 ms.
[2024-05-21 23:01:08] [INFO ] Added : 3 causal constraints over 1 iterations in 511 ms. Result :sat
Minimization took 2638 ms.
[2024-05-21 23:01:11] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:01:11] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2024-05-21 23:01:11] [INFO ] [Real]Added 241 Read/Feed constraints in 51 ms returned sat
[2024-05-21 23:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:01:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:01:12] [INFO ] [Nat]Absence check using state equation in 493 ms returned sat
[2024-05-21 23:01:12] [INFO ] [Nat]Added 241 Read/Feed constraints in 90 ms returned sat
[2024-05-21 23:01:12] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 233 ms.
[2024-05-21 23:01:13] [INFO ] Added : 1 causal constraints over 1 iterations in 586 ms. Result :sat
Minimization took 1925 ms.
[2024-05-21 23:01:15] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:01:15] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-21 23:01:15] [INFO ] [Real]Added 241 Read/Feed constraints in 50 ms returned sat
[2024-05-21 23:01:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:01:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-21 23:01:16] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2024-05-21 23:01:16] [INFO ] [Nat]Added 241 Read/Feed constraints in 105 ms returned sat
[2024-05-21 23:01:16] [INFO ] Deduced a trap composed of 19 places in 480 ms of which 6 ms to minimize.
[2024-05-21 23:01:17] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 2 ms to minimize.
[2024-05-21 23:01:17] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 2 ms to minimize.
[2024-05-21 23:01:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1406 ms
[2024-05-21 23:01:17] [INFO ] Computed and/alt/rep : 342/1316/342 causal constraints (skipped 2275 transitions) in 189 ms.
[2024-05-21 23:01:18] [INFO ] Added : 6 causal constraints over 2 iterations in 672 ms. Result :sat
Minimization took 2710 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 14, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 14, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 56 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2024-05-21 23:01:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 23:01:22] [INFO ] Invariant cache hit.
[2024-05-21 23:01:26] [INFO ] Implicit Places using invariants in 3754 ms returned []
[2024-05-21 23:01:26] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 23:01:26] [INFO ] Invariant cache hit.
[2024-05-21 23:01:26] [INFO ] State equation strengthened by 241 read => feed constraints.
[2024-05-21 23:01:27] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 5462 ms to find 0 implicit places.
[2024-05-21 23:01:28] [INFO ] Redundant transitions in 302 ms returned []
Running 2746 sub problems to find dead transitions.
[2024-05-21 23:01:28] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2024-05-21 23:01:28] [INFO ] Invariant cache hit.
[2024-05-21 23:01:28] [INFO ] State equation strengthened by 241 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2746 unsolved
[2024-05-21 23:02:17] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2024-05-21 23:02:20] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 1 ms to minimize.
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1486 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1492 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1502 is UNSAT
Problem TDEAD1503 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1516 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1519 is UNSAT
[2024-05-21 23:02:20] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 1 ms to minimize.
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1565 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1576 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1585 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
[2024-05-21 23:02:21] [INFO ] Deduced a trap composed of 11 places in 149 ms of which 1 ms to minimize.
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1732 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1747 is UNSAT
Problem TDEAD1748 is UNSAT
[2024-05-21 23:02:21] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
Problem TDEAD1749 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1766 is UNSAT
Problem TDEAD1767 is UNSAT
[2024-05-21 23:02:22] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1776 is UNSAT
Problem TDEAD1780 is UNSAT
Problem TDEAD1781 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1783 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1790 is UNSAT
Problem TDEAD1791 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1795 is UNSAT
[2024-05-21 23:02:22] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
Problem TDEAD1796 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1798 is UNSAT
Problem TDEAD1801 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
[2024-05-21 23:02:22] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
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 229/2847 variables, and 16 constraints, problems are : Problem set: 200 solved, 2546 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 2746/2746 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 200 solved, 2546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 7/7 constraints. Problems are: Problem set: 200 solved, 2546 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1461 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1471 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1476 is UNSAT
Problem TDEAD1477 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 8/15 constraints. Problems are: Problem set: 226 solved, 2520 unsolved
[2024-05-21 23:02:39] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
[2024-05-21 23:02:39] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 1 ms to minimize.
Problem TDEAD1440 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1446 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1450 is UNSAT
[2024-05-21 23:02:45] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
Problem TDEAD2709 is UNSAT
Problem TDEAD2710 is UNSAT
Problem TDEAD2720 is UNSAT
Problem TDEAD2721 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1031 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 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 TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 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 TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 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 TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1343 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1349 is UNSAT
Problem TDEAD1350 is UNSAT
Problem TDEAD1351 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1357 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1359 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 3/18 constraints. Problems are: Problem set: 504 solved, 2242 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 221/2847 variables, and 18 constraints, problems are : Problem set: 504 solved, 2242 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/8 constraints, State Equation: 0/229 constraints, ReadFeed: 0/241 constraints, PredecessorRefiner: 0/2746 constraints, Known Traps: 11/11 constraints]
After SMT, in 88216ms problems are : Problem set: 504 solved, 2242 unsolved
Search for dead transitions found 504 dead transitions in 88301ms
Found 504 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 504 transitions
Dead transitions reduction (with SMT) removed 504 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 229/229 places, 2243/2747 transitions.
Graph (complete) has 2784 edges and 229 vertex of which 221 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 650 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 192 transition count 1593
Reduce places removed 15 places and 271 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 45 place count 177 transition count 1322
Reduce places removed 10 places and 132 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 55 place count 167 transition count 1190
Reduce places removed 8 places and 89 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 63 place count 159 transition count 1101
Reduce places removed 1 places and 17 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 158 transition count 1084
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 75 place count 147 transition count 1026
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 15 places and 231 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 101 place count 132 transition count 795
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 108 place count 125 transition count 732
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 115 place count 125 transition count 732
Deduced a syphon composed of 2 places in 14 ms
Applied a total of 115 rules in 77 ms. Remains 125 /229 variables (removed 104) and now considering 732/2243 (removed 1511) transitions.
[2024-05-21 23:02:56] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
// Phase 1: matrix 668 rows 125 cols
[2024-05-21 23:02:56] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 23:02:56] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-21 23:02:56] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:02:56] [INFO ] Invariant cache hit.
[2024-05-21 23:02:57] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 23:02:57] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/229 places, 732/2747 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 95110 ms. Remains : 125/229 places, 732/2747 transitions.
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:02:57] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
Found an invariant !
This invariant on transitions {4=1, 367=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {7=1, 367=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :[0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 14, 0, 0, 0, 0] Max Struct:[+inf, +inf, 1, +inf, +inf, 1]
[2024-05-21 23:02:57] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
// Phase 1: matrix 668 rows 123 cols
[2024-05-21 23:02:57] [INFO ] Computed 7 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
RANDOM walk for 1000166 steps (2 resets) in 417 ms. (2392 steps per ms)
BEST_FIRST walk for 4000003 steps (8 resets) in 4309 ms. (928 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, 1, +inf, 1]
Inconsistency detected : max struct is less than max seen for bound index 1
[2024-05-21 23:03:02] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:02] [INFO ] Invariant cache hit.
[2024-05-21 23:03:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:03:02] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-21 23:03:02] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 23:03:02] [INFO ] [Real]Added 87 Read/Feed constraints in 11 ms returned sat
[2024-05-21 23:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:03] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-21 23:03:03] [INFO ] [Nat]Added 87 Read/Feed constraints in 32 ms returned sat
[2024-05-21 23:03:03] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-21 23:03:03] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 86 ms.
[2024-05-21 23:03:03] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-05-21 23:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-21 23:03:03] [INFO ] Added : 14 causal constraints over 4 iterations in 391 ms. Result :sat
Minimization took 245 ms.
[2024-05-21 23:03:03] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2024-05-21 23:03:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:04] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-21 23:03:04] [INFO ] [Real]Added 87 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:03:04] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2024-05-21 23:03:04] [INFO ] [Nat]Added 87 Read/Feed constraints in 33 ms returned sat
[2024-05-21 23:03:04] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:03:04] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-05-21 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2024-05-21 23:03:04] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 64 ms.
[2024-05-21 23:03:04] [INFO ] Added : 3 causal constraints over 1 iterations in 141 ms. Result :sat
Minimization took 243 ms.
[2024-05-21 23:03:05] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:03:05] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-21 23:03:05] [INFO ] [Real]Added 87 Read/Feed constraints in 12 ms returned sat
[2024-05-21 23:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:05] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-21 23:03:05] [INFO ] [Nat]Added 87 Read/Feed constraints in 38 ms returned sat
[2024-05-21 23:03:05] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-21 23:03:05] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 0 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 6 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 677 ms
[2024-05-21 23:03:06] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 43 ms.
[2024-05-21 23:03:06] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-21 23:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-21 23:03:06] [INFO ] Added : 16 causal constraints over 4 iterations in 369 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 14, 0, 0, 0, 0] Max Struct:[+inf, 14, 1, 1, +inf, 1]
FORMULA BugTracking-PT-q3m256-UpperBounds-03 14 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 732/732 transitions.
Applied a total of 0 rules in 37 ms. Remains 123 /123 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 123/123 places, 732/732 transitions.
[2024-05-21 23:03:07] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
Found an invariant !
This invariant on transitions {4=1, 367=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {7=1, 367=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :[1, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:03:07] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000172 steps (2 resets) in 514 ms. (1942 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 3195 ms. (938 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:03:11] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:11] [INFO ] Invariant cache hit.
[2024-05-21 23:03:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:03:11] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-21 23:03:11] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 23:03:11] [INFO ] [Real]Added 87 Read/Feed constraints in 49 ms returned sat
[2024-05-21 23:03:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2024-05-21 23:03:12] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-21 23:03:12] [INFO ] [Nat]Added 87 Read/Feed constraints in 19 ms returned sat
[2024-05-21 23:03:13] [INFO ] Deduced a trap composed of 5 places in 1017 ms of which 26 ms to minimize.
[2024-05-21 23:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1068 ms
[2024-05-21 23:03:13] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 51 ms.
[2024-05-21 23:03:13] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-21 23:03:13] [INFO ] Added : 14 causal constraints over 4 iterations in 315 ms. Result :sat
Minimization took 204 ms.
[2024-05-21 23:03:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:03:13] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-21 23:03:13] [INFO ] [Real]Added 87 Read/Feed constraints in 27 ms returned sat
[2024-05-21 23:03:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:14] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-21 23:03:14] [INFO ] [Nat]Added 87 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:03:14] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-05-21 23:03:14] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 1 ms to minimize.
[2024-05-21 23:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2024-05-21 23:03:14] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 41 ms.
[2024-05-21 23:03:14] [INFO ] Added : 3 causal constraints over 1 iterations in 91 ms. Result :sat
Minimization took 155 ms.
[2024-05-21 23:03:14] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:14] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-21 23:03:14] [INFO ] [Real]Added 87 Read/Feed constraints in 23 ms returned sat
[2024-05-21 23:03:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:03:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:03:15] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 23:03:15] [INFO ] [Nat]Added 87 Read/Feed constraints in 20 ms returned sat
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 1 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-21 23:03:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 801 ms
[2024-05-21 23:03:16] [INFO ] Computed and/alt/rep : 180/564/179 causal constraints (skipped 488 transitions) in 50 ms.
[2024-05-21 23:03:16] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-21 23:03:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2024-05-21 23:03:16] [INFO ] Added : 16 causal constraints over 4 iterations in 411 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 732/732 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 732/732 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 123/123 places, 732/732 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 732/732 transitions.
Applied a total of 0 rules in 19 ms. Remains 123 /123 variables (removed 0) and now considering 732/732 (removed 0) transitions.
[2024-05-21 23:03:16] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:16] [INFO ] Invariant cache hit.
[2024-05-21 23:03:17] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-21 23:03:17] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:17] [INFO ] Invariant cache hit.
[2024-05-21 23:03:17] [INFO ] State equation strengthened by 87 read => feed constraints.
[2024-05-21 23:03:17] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
[2024-05-21 23:03:18] [INFO ] Redundant transitions in 18 ms returned []
Running 731 sub problems to find dead transitions.
[2024-05-21 23:03:18] [INFO ] Flow matrix only has 668 transitions (discarded 64 similar events)
[2024-05-21 23:03:18] [INFO ] Invariant cache hit.
[2024-05-21 23:03:18] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 731 unsolved
[2024-05-21 23:03:22] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:03:22] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:03:22] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:03:22] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 4/11 constraints. Problems are: Problem set: 4 solved, 727 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 4 solved, 727 unsolved
Problem TDEAD413 is UNSAT
At refinement iteration 3 (OVERLAPS) 668/791 variables, 123/134 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 87/221 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/791 variables, 0/221 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 6 (OVERLAPS) 0/791 variables, 0/221 constraints. Problems are: Problem set: 5 solved, 726 unsolved
No progress, stopping.
After SMT solving in domain Real declared 791/791 variables, and 221 constraints, problems are : Problem set: 5 solved, 726 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 5 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 7/7 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 4/11 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 3 (OVERLAPS) 668/791 variables, 123/134 constraints. Problems are: Problem set: 5 solved, 726 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/791 variables, 87/221 constraints. Problems are: Problem set: 5 solved, 726 unsolved
Problem TDEAD105 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD704 is UNSAT
Problem TDEAD710 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD723 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/791 variables, 726/947 constraints. Problems are: Problem set: 81 solved, 650 unsolved
[2024-05-21 23:04:01] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-21 23:04:03] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 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 TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
[2024-05-21 23:04:08] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 0 ms to minimize.
Problem TDEAD390 is UNSAT
[2024-05-21 23:04:08] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
Problem TDEAD395 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/791 variables, 4/951 constraints. Problems are: Problem set: 128 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 791/791 variables, and 951 constraints, problems are : Problem set: 128 solved, 603 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 123/123 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 726/731 constraints, Known Traps: 8/8 constraints]
After SMT, in 62693ms problems are : Problem set: 128 solved, 603 unsolved
Search for dead transitions found 128 dead transitions in 62702ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/123 places, 604/732 transitions.
Graph (complete) has 875 edges and 123 vertex of which 120 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 15 places and 187 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 105 transition count 417
Reduce places removed 8 places and 75 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 24 place count 97 transition count 342
Reduce places removed 3 places and 29 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 27 place count 94 transition count 313
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 92 transition count 297
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 30 place count 91 transition count 288
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 36 place count 85 transition count 242
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 42 place count 85 transition count 242
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 42 rules in 17 ms. Remains 85 /123 variables (removed 38) and now considering 242/604 (removed 362) transitions.
[2024-05-21 23:04:20] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 85 cols
[2024-05-21 23:04:20] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 23:04:20] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-21 23:04:20] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 23:04:20] [INFO ] Invariant cache hit.
[2024-05-21 23:04:21] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 23:04:21] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 85/123 places, 242/732 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64237 ms. Remains : 85/123 places, 242/732 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA BugTracking-PT-q3m256-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:04:21] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
Found an invariant !
This invariant on transitions {4=1, 154=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {1=1, 154=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:04:21] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
// Phase 1: matrix 225 rows 83 cols
[2024-05-21 23:04:21] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000000 steps (2 resets) in 323 ms. (3086 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 618 ms. (1615 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:04:22] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 23:04:22] [INFO ] Invariant cache hit.
[2024-05-21 23:04:22] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:04:22] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 23:04:22] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-05-21 23:04:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:04:22] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-21 23:04:22] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:04:22] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 23:04:22] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 23:04:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:04:22] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:04:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-05-21 23:04:22] [INFO ] Computed and/alt/rep : 187/1011/187 causal constraints (skipped 37 transitions) in 33 ms.
[2024-05-21 23:04:22] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:04:23] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:04:23] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:04:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:04:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 324 ms
[2024-05-21 23:04:23] [INFO ] Added : 68 causal constraints over 16 iterations in 718 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 242/242 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-21 23:04:23] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 23:04:23] [INFO ] Invariant cache hit.
[2024-05-21 23:04:23] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-21 23:04:23] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 23:04:23] [INFO ] Invariant cache hit.
[2024-05-21 23:04:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-21 23:04:23] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 23:04:23] [INFO ] Redundant transitions in 14 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-21 23:04:23] [INFO ] Flow matrix only has 225 transitions (discarded 17 similar events)
[2024-05-21 23:04:23] [INFO ] Invariant cache hit.
[2024-05-21 23:04:23] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
At refinement iteration 3 (OVERLAPS) 225/308 variables, 83/91 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 48/139 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-21 23:04:26] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-21 23:04:27] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/141 constraints. Problems are: Problem set: 2 solved, 239 unsolved
[2024-05-21 23:04:29] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/308 variables, 1/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 10 (OVERLAPS) 0/308 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 142 constraints, problems are : Problem set: 2 solved, 239 unsolved in 8719 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 225/308 variables, 83/94 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 48/142 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 239/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/381 constraints. Problems are: Problem set: 4 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 381 constraints, problems are : Problem set: 4 solved, 237 unsolved in 6554 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 239/241 constraints, Known Traps: 3/3 constraints]
After SMT, in 15654ms problems are : Problem set: 4 solved, 237 unsolved
Search for dead transitions found 4 dead transitions in 15657ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 83/83 places, 238/242 transitions.
Reduce places removed 1 places and 7 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 82 transition count 231
Applied a total of 1 rules in 3 ms. Remains 82 /83 variables (removed 1) and now considering 231/238 (removed 7) transitions.
[2024-05-21 23:04:39] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
// Phase 1: matrix 215 rows 82 cols
[2024-05-21 23:04:39] [INFO ] Computed 8 invariants in 4 ms
[2024-05-21 23:04:39] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:04:39] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:39] [INFO ] Invariant cache hit.
[2024-05-21 23:04:39] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 23:04:39] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 82/83 places, 231/242 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 16282 ms. Remains : 82/83 places, 231/242 transitions.
[2024-05-21 23:04:39] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {1=1, 144=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1, 144=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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:04:39] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000060 steps (2 resets) in 304 ms. (3278 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 547 ms. (1824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:04:40] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:40] [INFO ] Invariant cache hit.
[2024-05-21 23:04:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:04:40] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 23:04:40] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 23:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:04:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:04:40] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:04:40] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-21 23:04:40] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 23:04:40] [INFO ] [Nat]Added 47 Read/Feed constraints in 17 ms returned sat
[2024-05-21 23:04:41] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-21 23:04:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-21 23:04:41] [INFO ] Computed and/alt/rep : 178/955/178 causal constraints (skipped 36 transitions) in 18 ms.
[2024-05-21 23:04:41] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:04:41] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:04:41] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:04:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2024-05-21 23:04:41] [INFO ] Added : 50 causal constraints over 10 iterations in 410 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 82/82 places, 231/231 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 231/231 transitions.
Applied a total of 0 rules in 5 ms. Remains 82 /82 variables (removed 0) and now considering 231/231 (removed 0) transitions.
[2024-05-21 23:04:41] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:41] [INFO ] Invariant cache hit.
[2024-05-21 23:04:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 23:04:41] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:41] [INFO ] Invariant cache hit.
[2024-05-21 23:04:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-21 23:04:42] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-21 23:04:42] [INFO ] Redundant transitions in 1 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-21 23:04:42] [INFO ] Flow matrix only has 215 transitions (discarded 16 similar events)
[2024-05-21 23:04:42] [INFO ] Invariant cache hit.
[2024-05-21 23:04:42] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 3 (OVERLAPS) 215/297 variables, 82/90 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 47/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/137 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 23:04:45] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 1/138 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 23:04:47] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 139 constraints, problems are : Problem set: 12 solved, 218 unsolved in 7906 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 12 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 2/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 215/297 variables, 82/92 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 47/139 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 218/357 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 23:04:52] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 1/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/358 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 23:04:57] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/297 variables, 1/359 constraints. Problems are: Problem set: 12 solved, 218 unsolved
[2024-05-21 23:04:59] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 1/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
At refinement iteration 12 (OVERLAPS) 0/297 variables, 0/360 constraints. Problems are: Problem set: 12 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 360 constraints, problems are : Problem set: 12 solved, 218 unsolved in 14909 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 218/230 constraints, Known Traps: 5/5 constraints]
After SMT, in 23064ms problems are : Problem set: 12 solved, 218 unsolved
Search for dead transitions found 12 dead transitions in 23067ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 219/231 transitions.
Applied a total of 0 rules in 7 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 23:05:05] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 23533 ms. Remains : 82/82 places, 219/231 transitions.
[2024-05-21 23:05:05] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:05:05] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-05-21 23:05:05] [INFO ] Computed 8 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[14, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000102 steps (2 resets) in 433 ms. (2304 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 683 ms. (1461 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:05:06] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:06] [INFO ] Invariant cache hit.
[2024-05-21 23:05:06] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:05:06] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:05:06] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-05-21 23:05:06] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:05:06] [INFO ] [Real]Added 45 Read/Feed constraints in 6 ms returned sat
[2024-05-21 23:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:05:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:05:06] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:05:06] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 23:05:06] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-05-21 23:05:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:05:06] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:05:06] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:05:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
[2024-05-21 23:05:06] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 15 ms.
[2024-05-21 23:05:07] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:05:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:05:07] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:05:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 218 ms
[2024-05-21 23:05:07] [INFO ] Added : 57 causal constraints over 13 iterations in 419 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 23:05:07] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-21 23:05:07] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:05:07] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-21 23:05:07] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 23:05:07] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:07] [INFO ] Invariant cache hit.
[2024-05-21 23:05:07] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:05:13] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7112 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 11339ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11343ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11675 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 23:05:19] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:05:19] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 1000160 steps (2 resets) in 327 ms. (3049 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 542 ms. (1841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
[2024-05-21 23:05:20] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:20] [INFO ] Invariant cache hit.
[2024-05-21 23:05:20] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:05:20] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:05:20] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-21 23:05:20] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:05:20] [INFO ] [Real]Added 45 Read/Feed constraints in 20 ms returned sat
[2024-05-21 23:05:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:05:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:05:20] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:05:20] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 23:05:20] [INFO ] [Nat]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-05-21 23:05:20] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:05:20] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:05:20] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:05:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2024-05-21 23:05:20] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 12 ms.
[2024-05-21 23:05:21] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:05:21] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:05:21] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:05:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 267 ms
[2024-05-21 23:05:21] [INFO ] Added : 57 causal constraints over 13 iterations in 459 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 23:05:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:21] [INFO ] Invariant cache hit.
[2024-05-21 23:05:21] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-21 23:05:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:21] [INFO ] Invariant cache hit.
[2024-05-21 23:05:21] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:05:21] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-21 23:05:21] [INFO ] Redundant transitions in 1 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 23:05:21] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:21] [INFO ] Invariant cache hit.
[2024-05-21 23:05:21] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:05:28] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 8018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 12496ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 12501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12945 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 23:05:34] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
RANDOM walk for 40470 steps (8 resets) in 82 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
[2024-05-21 23:05:35] [INFO ] Flatten gal took : 114 ms
[2024-05-21 23:05:35] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:05:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality115245589454037936.gal : 14 ms
[2024-05-21 23:05:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4713452771471923794.prop : 6 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/ReachabilityCardinality115245589454037936.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4713452771471923794.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/ReachabilityCardinality4713452771471923794.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 1131144 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1131144 steps, saw 721469 distinct states, run finished after 3004 ms. (steps per millisecond=376 ) properties seen :0
[2024-05-21 23:05:37] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:37] [INFO ] Invariant cache hit.
[2024-05-21 23:05:37] [INFO ] State equation strengthened by 45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/216 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/218 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/221 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/223 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 31/254 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/254 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 31/285 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/216 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/218 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/221 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/223 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/223 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 31/254 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 31/285 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:05:38] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:05:38] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-21 23:05:38] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 487ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
RANDOM walk for 40536 steps (8 resets) in 16 ms. (2384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1334481 steps, run timeout after 3001 ms. (steps per millisecond=444 ) properties seen :0 out of 1
Probabilistic random walk after 1334481 steps, saw 777161 distinct states, run finished after 3002 ms. (steps per millisecond=444 ) properties seen :0
[2024-05-21 23:05:41] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:41] [INFO ] Invariant cache hit.
[2024-05-21 23:05:41] [INFO ] State equation strengthened by 45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 39/216 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/216 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/218 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/218 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/221 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/221 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/223 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/223 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 31/254 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/254 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 31/285 variables, 14/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/285 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 6/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 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) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 118/127 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 49/177 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/177 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 39/216 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/216 variables, 10/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/216 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/218 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/218 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/218 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 3/221 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/221 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/221 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/223 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/223 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 31/254 variables, 14/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/254 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/254 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 31/285 variables, 14/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/285 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/285 variables, 6/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:05:41] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:05:41] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:05:41] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/285 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/285 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 26 ms.
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 23:05:41] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:41] [INFO ] Invariant cache hit.
[2024-05-21 23:05:42] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-21 23:05:42] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:42] [INFO ] Invariant cache hit.
[2024-05-21 23:05:42] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:05:42] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2024-05-21 23:05:42] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 23:05:42] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:05:42] [INFO ] Invariant cache hit.
[2024-05-21 23:05:42] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 3654 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:05:47] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :458230 after 984823
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 6337 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 10203ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 10206ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10613 ms. Remains : 82/82 places, 219/219 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 331 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 80 transition count 202
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 18 place count 80 transition count 201
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 79 transition count 201
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 31 place count 68 transition count 157
Iterating global reduction 1 with 11 rules applied. Total rules applied 42 place count 68 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 68 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 67 transition count 155
Ensure Unique test removed 1 places
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 66 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 65 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 65 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 65 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 63 transition count 152
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 63 transition count 151
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 61 transition count 151
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 57 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 71 place count 53 transition count 152
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 75 place count 53 transition count 148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 79 place count 49 transition count 148
Applied a total of 79 rules in 37 ms. Remains 49 /82 variables (removed 33) and now considering 148/219 (removed 71) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 148 rows 49 cols
[2024-05-21 23:05:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-21 23:05:52] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-21 23:05:52] [INFO ] After 46ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 23:05:52] [INFO ] After 59ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-21 23:05:52] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2024-05-21 23:05:52] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:05:52] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:05:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6454326679773710385.gal : 5 ms
[2024-05-21 23:05:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2325956338094901213.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/ReachabilityCardinality6454326679773710385.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2325956338094901213.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/ReachabilityCardinality2325956338094901213.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
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :459772 after 986365
Detected timeout of ITS tools.
[2024-05-21 23:06:07] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:06:07] [INFO ] Applying decomposition
[2024-05-21 23:06:07] [INFO ] Flatten gal took : 10 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/graph11217083515267046306.txt' '-o' '/tmp/graph11217083515267046306.bin' '-w' '/tmp/graph11217083515267046306.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11217083515267046306.bin' '-l' '-1' '-v' '-w' '/tmp/graph11217083515267046306.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:06:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:06:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:06:08] [INFO ] Removed a total of 150 redundant transitions.
[2024-05-21 23:06:08] [INFO ] Flatten gal took : 114 ms
[2024-05-21 23:06:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 8 ms.
[2024-05-21 23:06:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3200972976985604276.gal : 9 ms
[2024-05-21 23:06:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14173290550327867335.prop : 8 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/ReachabilityCardinality3200972976985604276.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14173290550327867335.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/ReachabilityCardinality14173290550327867335.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 6145
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.6232e+10,0.151367,8956,349,1758,3680,12051,160,5519,155,24859,0
Total reachable state count : 16231987156

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,256,0.152204,8956,17,288,3680,12051,164,5519,159,24859,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15821 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-21 23:06:08] [INFO ] Flatten gal took : 17 ms
[2024-05-21 23:06:08] [INFO ] Applying decomposition
[2024-05-21 23:06:08] [INFO ] Flatten gal took : 17 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/graph3453163430906954164.txt' '-o' '/tmp/graph3453163430906954164.bin' '-w' '/tmp/graph3453163430906954164.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3453163430906954164.bin' '-l' '-1' '-v' '-w' '/tmp/graph3453163430906954164.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:06:08] [INFO ] Decomposing Gal with order
[2024-05-21 23:06:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:06:08] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-21 23:06:08] [INFO ] Flatten gal took : 24 ms
[2024-05-21 23:06:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-21 23:06:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8182719654528959937.gal : 4 ms
[2024-05-21 23:06:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6178599901523204226.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/ReachabilityCardinality8182719654528959937.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6178599901523204226.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 ...307
Loading property file /tmp/ReachabilityCardinality6178599901523204226.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 5895
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :5895 after 10761
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10761 after 28924
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :28924 after 190608
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :190608 after 409338
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :409338 after 1.23648e+06
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[18, 0, 0, 0, 0] Max Struct:[+inf, 1, 1, +inf, 1]
Starting property specific reduction for BugTracking-PT-q3m256-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:06:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
// Phase 1: matrix 203 rows 82 cols
[2024-05-21 23:06:58] [INFO ] Computed 8 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10102 steps (2 resets) in 8 ms. (1122 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 15 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-21 23:06:58] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:06:58] [INFO ] Invariant cache hit.
[2024-05-21 23:06:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:06:58] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:06:58] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 23:06:58] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:06:58] [INFO ] [Real]Added 45 Read/Feed constraints in 7 ms returned sat
[2024-05-21 23:06:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:06:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:06:58] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:06:58] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-21 23:06:58] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-21 23:06:58] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 194 ms
[2024-05-21 23:06:59] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 13 ms.
[2024-05-21 23:06:59] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:06:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 242 ms
[2024-05-21 23:06:59] [INFO ] Added : 57 causal constraints over 13 iterations in 448 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 18 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 23:06:59] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {4=1, 132=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:[11] Max Struct:[+inf]
[2024-05-21 23:06:59] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:06:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 1000058 steps (2 resets) in 508 ms. (1964 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 619 ms. (1612 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[+inf]
[2024-05-21 23:07:01] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:07:01] [INFO ] Invariant cache hit.
[2024-05-21 23:07:01] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-21 23:07:01] [INFO ] [Real]Absence check using 7 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 23:07:01] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 23:07:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:07:01] [INFO ] [Real]Added 45 Read/Feed constraints in 18 ms returned sat
[2024-05-21 23:07:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:07:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 23:07:01] [INFO ] [Nat]Absence check using 7 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 23:07:01] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 23:07:01] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2024-05-21 23:07:01] [INFO ] Computed and/alt/rep : 166/847/166 causal constraints (skipped 36 transitions) in 16 ms.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:07:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 178 ms
[2024-05-21 23:07:01] [INFO ] Added : 57 causal constraints over 13 iterations in 417 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[+inf]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 219/219 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 219/219 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2024-05-21 23:07:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:07:02] [INFO ] Invariant cache hit.
[2024-05-21 23:07:02] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-21 23:07:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:07:02] [INFO ] Invariant cache hit.
[2024-05-21 23:07:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-21 23:07:02] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-21 23:07:02] [INFO ] Redundant transitions in 0 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-21 23:07:02] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
[2024-05-21 23:07:02] [INFO ] Invariant cache hit.
[2024-05-21 23:07:02] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 135 constraints, problems are : Problem set: 0 solved, 218 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 203/285 variables, 82/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 45/135 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 218/353 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-21 23:07:08] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/285 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 354 constraints, problems are : Problem set: 0 solved, 218 unsolved in 7342 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 1/1 constraints]
After SMT, in 11737ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 11740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12055 ms. Remains : 82/82 places, 219/219 transitions.
[2024-05-21 23:07:14] [INFO ] Flow matrix only has 203 transitions (discarded 16 similar events)
Found an invariant !
This invariant on transitions {0=1, 10=1, 132=1, 187=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {4=1, 132=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[11] Max Struct:[+inf]
RANDOM walk for 40499 steps (8 resets) in 24 ms. (1619 steps per ms) remains 1/1 properties
BEST_FIRST walk for 29888 steps (7 resets) in 49 ms. (597 steps per ms) remains 0/1 properties
[2024-05-21 23:07:14] [INFO ] Flatten gal took : 35 ms
[2024-05-21 23:07:14] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:07:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4714089872627034364.gal : 4 ms
[2024-05-21 23:07:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7566453703394581780.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/ReachabilityCardinality4714089872627034364.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7566453703394581780.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
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:[11] Max Struct:[+inf]
Ending property specific reduction for BugTracking-PT-q3m256-UpperBounds-01 in 15786 ms.
[2024-05-21 23:07:14] [INFO ] Flatten gal took : 15 ms
[2024-05-21 23:07:14] [INFO ] Applying decomposition
[2024-05-21 23:07:14] [INFO ] Flatten gal took : 14 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/graph15258626714584013431.txt' '-o' '/tmp/graph15258626714584013431.bin' '-w' '/tmp/graph15258626714584013431.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15258626714584013431.bin' '-l' '-1' '-v' '-w' '/tmp/graph15258626714584013431.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:07:14] [INFO ] Decomposing Gal with order
[2024-05-21 23:07:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:07:14] [INFO ] Removed a total of 5 redundant transitions.
[2024-05-21 23:07:14] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:07:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 0 ms.
[2024-05-21 23:07:14] [INFO ] Time to serialize gal into /tmp/UpperBounds14609145274458970584.gal : 3 ms
[2024-05-21 23:07:14] [INFO ] Time to serialize properties into /tmp/UpperBounds13286260258075107642.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/UpperBounds14609145274458970584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13286260258075107642.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/UpperBounds13286260258075107642.prop.

BK_STOP 1716333179246

--------------------
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-q3m256"
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-q3m256, 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-171620399400381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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