Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132900565.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900565
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716395107146

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 16:25:08] [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-22 16:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:25:08] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-22 16:25:08] [INFO ] Transformed 1064 places.
[2024-05-22 16:25:08] [INFO ] Transformed 998 transitions.
[2024-05-22 16:25:08] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2024-05-22 16:25:08] [INFO ] Invariants computation overflowed in 144 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (332 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 160003 steps (4535 resets) in 304 ms. (524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 998 rows 1064 cols
[2024-05-22 16:25:09] [INFO ] Invariants computation overflowed in 95 ms
[2024-05-22 16:25:10] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2024-05-22 16:25:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:11] [INFO ] [Nat]Absence check using state equation in 712 ms returned sat
[2024-05-22 16:25:11] [INFO ] Deduced a trap composed of 426 places in 591 ms of which 61 ms to minimize.
[2024-05-22 16:25:12] [INFO ] Deduced a trap composed of 468 places in 361 ms of which 7 ms to minimize.
[2024-05-22 16:25:12] [INFO ] Deduced a trap composed of 469 places in 334 ms of which 7 ms to minimize.
[2024-05-22 16:25:13] [INFO ] Deduced a trap composed of 470 places in 364 ms of which 6 ms to minimize.
[2024-05-22 16:25:13] [INFO ] Deduced a trap composed of 435 places in 573 ms of which 6 ms to minimize.
[2024-05-22 16:25:14] [INFO ] Deduced a trap composed of 137 places in 312 ms of which 6 ms to minimize.
[2024-05-22 16:25:14] [INFO ] Deduced a trap composed of 401 places in 297 ms of which 7 ms to minimize.
[2024-05-22 16:25:14] [INFO ] Deduced a trap composed of 415 places in 299 ms of which 6 ms to minimize.
[2024-05-22 16:25:15] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 5 ms to minimize.
[2024-05-22 16:25:15] [INFO ] Deduced a trap composed of 8 places in 358 ms of which 6 ms to minimize.
[2024-05-22 16:25:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 16:25:18] [INFO ] [Real]Absence check using state equation in 2485 ms returned unknown
[2024-05-22 16:25:20] [INFO ] [Real]Absence check using state equation in 1868 ms returned unknown
[2024-05-22 16:25:21] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2024-05-22 16:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:23] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2024-05-22 16:25:23] [INFO ] Deduced a trap composed of 29 places in 303 ms of which 5 ms to minimize.
[2024-05-22 16:25:23] [INFO ] Deduced a trap composed of 45 places in 301 ms of which 6 ms to minimize.
[2024-05-22 16:25:24] [INFO ] Deduced a trap composed of 31 places in 307 ms of which 6 ms to minimize.
[2024-05-22 16:25:24] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 6 ms to minimize.
[2024-05-22 16:25:24] [INFO ] Deduced a trap composed of 16 places in 314 ms of which 6 ms to minimize.
[2024-05-22 16:25:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1765 ms
[2024-05-22 16:25:24] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 48 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-22 16:25:27] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-05-22 16:25:27] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:28] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-05-22 16:25:28] [INFO ] Deduced a trap composed of 414 places in 319 ms of which 5 ms to minimize.
[2024-05-22 16:25:29] [INFO ] Deduced a trap composed of 294 places in 287 ms of which 6 ms to minimize.
[2024-05-22 16:25:29] [INFO ] Deduced a trap composed of 441 places in 312 ms of which 6 ms to minimize.
[2024-05-22 16:25:29] [INFO ] Deduced a trap composed of 420 places in 308 ms of which 8 ms to minimize.
[2024-05-22 16:25:30] [INFO ] Deduced a trap composed of 417 places in 289 ms of which 6 ms to minimize.
[2024-05-22 16:25:30] [INFO ] Deduced a trap composed of 415 places in 299 ms of which 6 ms to minimize.
[2024-05-22 16:25:30] [INFO ] Deduced a trap composed of 411 places in 309 ms of which 6 ms to minimize.
[2024-05-22 16:25:31] [INFO ] Deduced a trap composed of 31 places in 293 ms of which 5 ms to minimize.
[2024-05-22 16:25:31] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 6 ms to minimize.
[2024-05-22 16:25:31] [INFO ] Deduced a trap composed of 420 places in 302 ms of which 5 ms to minimize.
[2024-05-22 16:25:32] [INFO ] Deduced a trap composed of 375 places in 304 ms of which 6 ms to minimize.
[2024-05-22 16:25:32] [INFO ] Deduced a trap composed of 385 places in 293 ms of which 5 ms to minimize.
[2024-05-22 16:25:32] [INFO ] Deduced a trap composed of 427 places in 292 ms of which 7 ms to minimize.
[2024-05-22 16:25:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-22 16:25:33] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2024-05-22 16:25:34] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 6 ms to minimize.
[2024-05-22 16:25:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:35] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2024-05-22 16:25:35] [INFO ] Deduced a trap composed of 91 places in 253 ms of which 5 ms to minimize.
[2024-05-22 16:25:35] [INFO ] Deduced a trap composed of 89 places in 270 ms of which 5 ms to minimize.
[2024-05-22 16:25:36] [INFO ] Deduced a trap composed of 79 places in 256 ms of which 5 ms to minimize.
[2024-05-22 16:25:36] [INFO ] Deduced a trap composed of 149 places in 246 ms of which 5 ms to minimize.
[2024-05-22 16:25:36] [INFO ] Deduced a trap composed of 103 places in 259 ms of which 4 ms to minimize.
[2024-05-22 16:25:37] [INFO ] Deduced a trap composed of 77 places in 248 ms of which 4 ms to minimize.
[2024-05-22 16:25:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1886 ms
[2024-05-22 16:25:37] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 55 ms.
[2024-05-22 16:25:39] [INFO ] Added : 135 causal constraints over 27 iterations in 2241 ms. Result :unknown
[2024-05-22 16:25:41] [INFO ] [Real]Absence check using state equation in 1933 ms returned unknown
[2024-05-22 16:25:41] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2024-05-22 16:25:42] [INFO ] Deduced a trap composed of 388 places in 314 ms of which 6 ms to minimize.
[2024-05-22 16:25:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:42] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2024-05-22 16:25:43] [INFO ] Deduced a trap composed of 388 places in 307 ms of which 5 ms to minimize.
[2024-05-22 16:25:43] [INFO ] Deduced a trap composed of 53 places in 308 ms of which 6 ms to minimize.
[2024-05-22 16:25:44] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 6 ms to minimize.
[2024-05-22 16:25:44] [INFO ] Deduced a trap composed of 41 places in 328 ms of which 5 ms to minimize.
[2024-05-22 16:25:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1968 ms
[2024-05-22 16:25:44] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 49 ms.
[2024-05-22 16:25:47] [INFO ] Added : 160 causal constraints over 32 iterations in 2580 ms. Result :unknown
[2024-05-22 16:25:48] [INFO ] [Real]Absence check using state equation in 1273 ms returned unknown
[2024-05-22 16:25:50] [INFO ] [Real]Absence check using state equation in 1298 ms returned unknown
[2024-05-22 16:25:51] [INFO ] [Real]Absence check using state equation in 1522 ms returned unknown
[2024-05-22 16:25:52] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2024-05-22 16:25:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:52] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2024-05-22 16:25:53] [INFO ] Deduced a trap composed of 33 places in 325 ms of which 6 ms to minimize.
[2024-05-22 16:25:53] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 6 ms to minimize.
[2024-05-22 16:25:54] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 7 ms to minimize.
[2024-05-22 16:25:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1204 ms
[2024-05-22 16:25:54] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 59 ms.
[2024-05-22 16:25:55] [INFO ] Added : 20 causal constraints over 4 iterations in 1274 ms. Result :unknown
[2024-05-22 16:25:57] [INFO ] [Real]Absence check using state equation in 1749 ms returned unknown
[2024-05-22 16:25:58] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2024-05-22 16:25:58] [INFO ] Deduced a trap composed of 233 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:25:59] [INFO ] [Nat]Absence check using state equation in 828 ms returned sat
[2024-05-22 16:25:59] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 52 ms.
[2024-05-22 16:26:00] [INFO ] Added : 20 causal constraints over 4 iterations in 1479 ms. Result :unknown
[2024-05-22 16:26:05] [INFO ] [Real]Absence check using state equation in 4889 ms returned unknown
[2024-05-22 16:26:06] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2024-05-22 16:26:06] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 50 ms.
[2024-05-22 16:26:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:26:07] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-05-22 16:26:07] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 54 ms.
[2024-05-22 16:26:07] [INFO ] Added : 20 causal constraints over 4 iterations in 832 ms. Result :sat
Minimization took 531 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1058 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1057 transition count 771
Reduce places removed 225 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 765
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 466 place count 826 transition count 765
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 466 place count 826 transition count 723
Deduced a syphon composed of 42 places in 7 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 550 place count 784 transition count 723
Performed 176 Post agglomeration using F-continuation condition.Transition count delta: 176
Deduced a syphon composed of 176 places in 3 ms
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 3 with 352 rules applied. Total rules applied 902 place count 608 transition count 547
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 15 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 974 place count 572 transition count 547
Free-agglomeration rule (complex) applied 77 times.
Iterating global reduction 3 with 77 rules applied. Total rules applied 1051 place count 572 transition count 470
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 1128 place count 495 transition count 470
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 4 with 80 rules applied. Total rules applied 1208 place count 495 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 494 transition count 469
Applied a total of 1209 rules in 293 ms. Remains 494 /1064 variables (removed 570) and now considering 469/998 (removed 529) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 494/1064 places, 469/998 transitions.
Found an invariant !
This invariant on transitions {29=1, 40=1, 43=1, 55=2, 65=2, 131=1, 142=1, 259=2, 295=1, 300=1, 417=1, 436=1, 468=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 40=1, 43=1, 131=1, 142=1, 295=1, 300=1, 417=1, 436=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1237 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 469 rows 494 cols
[2024-05-22 16:37:10] [INFO ] Computed 100 invariants in 85 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (123904 resets) in 985 ms. (1014 steps per ms)
BEST_FIRST walk for 16000007 steps (1334016 resets) in 10210 ms. (1566 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:37:21] [INFO ] Invariant cache hit.
[2024-05-22 16:37:21] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-22 16:37:21] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:37:22] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2024-05-22 16:37:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:37:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-22 16:37:22] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:37:23] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2024-05-22 16:37:23] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:37:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:37:29] [INFO ] [Nat]Added 75 Read/Feed constraints in 6055 ms returned sat
[2024-05-22 16:37:29] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 39 ms.
[2024-05-22 16:37:49] [INFO ] Added : 380 causal constraints over 76 iterations in 20340 ms.(timeout) Result :sat
Minimization took 4502 ms.
[2024-05-22 16:37:54] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:37:54] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:37:54] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-22 16:37:54] [INFO ] [Real]Added 75 Read/Feed constraints in 243 ms returned sat
[2024-05-22 16:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:37:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:37:54] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 27 ms returned sat
[2024-05-22 16:37:54] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-05-22 16:37:55] [INFO ] [Nat]Added 75 Read/Feed constraints in 376 ms returned sat
[2024-05-22 16:37:55] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 35 ms.
[2024-05-22 16:37:55] [INFO ] Added : 54 causal constraints over 11 iterations in 469 ms. Result :sat
Minimization took 1036 ms.
[2024-05-22 16:37:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:37:56] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:37:57] [INFO ] [Real]Absence check using state equation in 328 ms returned sat
[2024-05-22 16:37:57] [INFO ] [Real]Added 75 Read/Feed constraints in 290 ms returned sat
[2024-05-22 16:37:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:37:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:37:57] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:37:57] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-05-22 16:37:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 416 ms returned sat
[2024-05-22 16:37:58] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 16 places in 201 ms of which 3 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 3 ms to minimize.
[2024-05-22 16:38:00] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Deduced a trap composed of 137 places in 196 ms of which 3 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Deduced a trap composed of 8 places in 161 ms of which 2 ms to minimize.
[2024-05-22 16:38:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1780 ms
[2024-05-22 16:38:01] [INFO ] Added : 131 causal constraints over 27 iterations in 3604 ms. Result :sat
Minimization took 1292 ms.
[2024-05-22 16:38:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:03] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned unsat
[2024-05-22 16:38:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:03] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:38:03] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-22 16:38:05] [INFO ] [Real]Added 75 Read/Feed constraints in 1735 ms returned sat
[2024-05-22 16:38:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-22 16:38:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:38:05] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-22 16:38:09] [INFO ] [Nat]Added 75 Read/Feed constraints in 3500 ms returned sat
[2024-05-22 16:38:09] [INFO ] Deduced a trap composed of 140 places in 192 ms of which 2 ms to minimize.
[2024-05-22 16:38:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-22 16:38:09] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-22 16:38:23] [INFO ] Added : 376 causal constraints over 76 iterations in 14256 ms. Result :sat
Minimization took 3613 ms.
[2024-05-22 16:38:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:27] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:38:27] [INFO ] [Real]Absence check using state equation in 267 ms returned sat
[2024-05-22 16:38:28] [INFO ] [Real]Added 75 Read/Feed constraints in 669 ms returned sat
[2024-05-22 16:38:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:28] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:38:28] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-22 16:38:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 1261 ms returned sat
[2024-05-22 16:38:30] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:38:35] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 3 ms to minimize.
[2024-05-22 16:38:35] [INFO ] Deduced a trap composed of 20 places in 137 ms of which 2 ms to minimize.
[2024-05-22 16:38:35] [INFO ] Deduced a trap composed of 8 places in 144 ms of which 3 ms to minimize.
[2024-05-22 16:38:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 603 ms
[2024-05-22 16:38:36] [INFO ] Added : 233 causal constraints over 48 iterations in 5799 ms. Result :sat
Minimization took 2544 ms.
[2024-05-22 16:38:38] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:38] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:38:39] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2024-05-22 16:38:39] [INFO ] [Real]Added 75 Read/Feed constraints in 570 ms returned sat
[2024-05-22 16:38:39] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 32 ms.
[2024-05-22 16:38:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:40] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:38:40] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2024-05-22 16:38:41] [INFO ] [Nat]Added 75 Read/Feed constraints in 1289 ms returned sat
[2024-05-22 16:38:41] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-22 16:38:45] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 6 ms to minimize.
[2024-05-22 16:38:45] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 2 ms to minimize.
[2024-05-22 16:38:45] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-05-22 16:38:46] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 3 ms to minimize.
[2024-05-22 16:38:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 760 ms
[2024-05-22 16:38:46] [INFO ] Added : 198 causal constraints over 40 iterations in 4377 ms. Result :sat
Minimization took 1884 ms.
[2024-05-22 16:38:48] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:48] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:38:48] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2024-05-22 16:38:48] [INFO ] [Real]Added 75 Read/Feed constraints in 167 ms returned sat
[2024-05-22 16:38:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:48] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:38:48] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-22 16:38:49] [INFO ] [Nat]Added 75 Read/Feed constraints in 242 ms returned sat
[2024-05-22 16:38:49] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:38:49] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 3 ms to minimize.
[2024-05-22 16:38:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2024-05-22 16:38:49] [INFO ] Added : 45 causal constraints over 10 iterations in 674 ms. Result :sat
Minimization took 1027 ms.
[2024-05-22 16:38:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:51] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:38:51] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-05-22 16:38:51] [INFO ] [Real]Added 75 Read/Feed constraints in 477 ms returned sat
[2024-05-22 16:38:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:51] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:38:52] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2024-05-22 16:38:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 892 ms returned sat
[2024-05-22 16:38:52] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 24 ms.
[2024-05-22 16:38:55] [INFO ] Deduced a trap composed of 8 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2024-05-22 16:38:56] [INFO ] Added : 174 causal constraints over 36 iterations in 3034 ms. Result :sat
Minimization took 1532 ms.
[2024-05-22 16:38:57] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:38:57] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:38:57] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2024-05-22 16:38:58] [INFO ] [Real]Added 75 Read/Feed constraints in 285 ms returned sat
[2024-05-22 16:38:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:38:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:38:58] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:38:58] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2024-05-22 16:38:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 939 ms returned sat
[2024-05-22 16:38:59] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:39:01] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:39:01] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:39:01] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:39:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2024-05-22 16:39:01] [INFO ] Added : 125 causal constraints over 26 iterations in 2401 ms. Result :sat
Minimization took 1629 ms.
[2024-05-22 16:39:03] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:39:03] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:39:03] [INFO ] [Real]Absence check using state equation in 277 ms returned sat
[2024-05-22 16:39:04] [INFO ] [Real]Added 75 Read/Feed constraints in 430 ms returned sat
[2024-05-22 16:39:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:39:04] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:39:04] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2024-05-22 16:39:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 685 ms returned sat
[2024-05-22 16:39:05] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:39:07] [INFO ] Deduced a trap composed of 8 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:39:08] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:39:08] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 2 ms to minimize.
[2024-05-22 16:39:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 634 ms
[2024-05-22 16:39:08] [INFO ] Added : 146 causal constraints over 30 iterations in 3016 ms. Result :sat
Minimization took 1735 ms.
[2024-05-22 16:39:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:10] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:39:10] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-22 16:39:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:39:10] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:39:11] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2024-05-22 16:39:12] [INFO ] [Nat]Added 75 Read/Feed constraints in 1757 ms returned sat
[2024-05-22 16:39:12] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:39:18] [INFO ] Added : 256 causal constraints over 52 iterations in 6136 ms. Result :sat
Minimization took 3532 ms.
[2024-05-22 16:39:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:22] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:39:23] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2024-05-22 16:39:23] [INFO ] [Real]Added 75 Read/Feed constraints in 755 ms returned sat
[2024-05-22 16:39:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:23] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:39:24] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2024-05-22 16:39:26] [INFO ] [Nat]Added 75 Read/Feed constraints in 1724 ms returned sat
[2024-05-22 16:39:26] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:39:31] [INFO ] Deduced a trap composed of 8 places in 146 ms of which 3 ms to minimize.
[2024-05-22 16:39:31] [INFO ] Deduced a trap composed of 20 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:39:32] [INFO ] Deduced a trap composed of 10 places in 151 ms of which 3 ms to minimize.
[2024-05-22 16:39:32] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 3 ms to minimize.
[2024-05-22 16:39:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 901 ms
[2024-05-22 16:39:32] [INFO ] Added : 241 causal constraints over 49 iterations in 6348 ms. Result :sat
Minimization took 2383 ms.
[2024-05-22 16:39:34] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:34] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:39:35] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-22 16:39:36] [INFO ] [Real]Added 75 Read/Feed constraints in 1490 ms returned sat
[2024-05-22 16:39:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:39:36] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:39:36] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2024-05-22 16:39:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 2197 ms returned sat
[2024-05-22 16:39:39] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:39:44] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-22 16:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 201 ms
[2024-05-22 16:39:44] [INFO ] Added : 214 causal constraints over 44 iterations in 5254 ms. Result :sat
Minimization took 2395 ms.
[2024-05-22 16:39:46] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 37 ms returned sat
[2024-05-22 16:39:47] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-22 16:39:47] [INFO ] [Real]Added 75 Read/Feed constraints in 421 ms returned sat
[2024-05-22 16:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:47] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:39:47] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-22 16:39:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 668 ms returned sat
[2024-05-22 16:39:48] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:39:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-22 16:39:48] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:39:50] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:39:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-22 16:39:50] [INFO ] Added : 113 causal constraints over 23 iterations in 1657 ms. Result :sat
Minimization took 1296 ms.
[2024-05-22 16:39:51] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:39:51] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:39:52] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-22 16:39:52] [INFO ] [Real]Added 75 Read/Feed constraints in 167 ms returned sat
[2024-05-22 16:39:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:39:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-22 16:39:52] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:39:52] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-22 16:39:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 261 ms returned sat
[2024-05-22 16:39:52] [INFO ] Computed and/alt/rep : 407/2327/407 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-22 16:39:53] [INFO ] Deduced a trap composed of 8 places in 196 ms of which 3 ms to minimize.
[2024-05-22 16:39:53] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 3 ms to minimize.
[2024-05-22 16:39:53] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:39:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 693 ms
[2024-05-22 16:39:53] [INFO ] Added : 50 causal constraints over 10 iterations in 1107 ms. Result :sat
Minimization took 1024 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DoubleExponent-PT-020-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 469/469 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 494 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 493 transition count 468
Applied a total of 2 rules in 33 ms. Remains 493 /494 variables (removed 1) and now considering 468/469 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 493/494 places, 468/469 transitions.
Found an invariant !
This invariant on transitions {29=1, 40=1, 43=1, 55=2, 65=2, 129=1, 140=1, 257=2, 293=1, 298=1, 415=1, 434=1, 466=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {29=1, 40=1, 43=1, 129=1, 140=1, 293=1, 298=1, 415=1, 434=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1091 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 468 rows 493 cols
[2024-05-22 16:42:18] [INFO ] Computed 100 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (108012 resets) in 913 ms. (1094 steps per ms)
BEST_FIRST walk for 15000008 steps (1130417 resets) in 10183 ms. (1472 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:42:29] [INFO ] Invariant cache hit.
[2024-05-22 16:42:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:42:29] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:42:31] [INFO ] [Real]Absence check using state equation in 1912 ms returned sat
[2024-05-22 16:42:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:42:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:42:31] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:42:33] [INFO ] [Nat]Absence check using state equation in 1956 ms returned sat
[2024-05-22 16:42:33] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:42:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:42:42] [INFO ] [Nat]Added 75 Read/Feed constraints in 9008 ms returned sat
[2024-05-22 16:42:42] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:42:54] [INFO ] Added : 357 causal constraints over 72 iterations in 11956 ms. Result :sat
Minimization took 4502 ms.
[2024-05-22 16:42:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:42:59] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:42:59] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-05-22 16:42:59] [INFO ] [Real]Added 75 Read/Feed constraints in 227 ms returned sat
[2024-05-22 16:42:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:42:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:42:59] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:00] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2024-05-22 16:43:00] [INFO ] [Nat]Added 75 Read/Feed constraints in 264 ms returned sat
[2024-05-22 16:43:00] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:43:01] [INFO ] Added : 91 causal constraints over 19 iterations in 1009 ms. Result :sat
Minimization took 1150 ms.
[2024-05-22 16:43:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:43:02] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:43:03] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-05-22 16:43:03] [INFO ] [Real]Added 75 Read/Feed constraints in 342 ms returned sat
[2024-05-22 16:43:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:43:03] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:43:03] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-22 16:43:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 639 ms returned sat
[2024-05-22 16:43:04] [INFO ] Deduced a trap composed of 147 places in 197 ms of which 3 ms to minimize.
[2024-05-22 16:43:04] [INFO ] Deduced a trap composed of 138 places in 198 ms of which 3 ms to minimize.
[2024-05-22 16:43:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2024-05-22 16:43:04] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:43:08] [INFO ] Added : 173 causal constraints over 35 iterations in 3774 ms. Result :sat
Minimization took 1993 ms.
[2024-05-22 16:43:10] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:10] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:43:11] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-22 16:43:12] [INFO ] [Real]Added 75 Read/Feed constraints in 1387 ms returned sat
[2024-05-22 16:43:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:12] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:12] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2024-05-22 16:43:16] [INFO ] [Nat]Added 75 Read/Feed constraints in 3233 ms returned sat
[2024-05-22 16:43:16] [INFO ] Deduced a trap composed of 138 places in 191 ms of which 3 ms to minimize.
[2024-05-22 16:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2024-05-22 16:43:16] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:43:25] [INFO ] Added : 335 causal constraints over 67 iterations in 9588 ms. Result :sat
Minimization took 3561 ms.
[2024-05-22 16:43:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:43:29] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:29] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-22 16:43:30] [INFO ] [Real]Added 75 Read/Feed constraints in 1047 ms returned sat
[2024-05-22 16:43:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:43:30] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:31] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2024-05-22 16:43:32] [INFO ] [Nat]Added 75 Read/Feed constraints in 1633 ms returned sat
[2024-05-22 16:43:32] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-22 16:43:39] [INFO ] Added : 266 causal constraints over 54 iterations in 6412 ms. Result :sat
Minimization took 1836 ms.
[2024-05-22 16:43:41] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:41] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:43:41] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-22 16:43:42] [INFO ] [Real]Added 75 Read/Feed constraints in 534 ms returned sat
[2024-05-22 16:43:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:42] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:42] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-22 16:43:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 1343 ms returned sat
[2024-05-22 16:43:44] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:43:46] [INFO ] Added : 157 causal constraints over 32 iterations in 2155 ms. Result :sat
Minimization took 1518 ms.
[2024-05-22 16:43:47] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:47] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:48] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-22 16:43:48] [INFO ] [Real]Added 75 Read/Feed constraints in 151 ms returned sat
[2024-05-22 16:43:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:43:48] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:43:48] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-22 16:43:48] [INFO ] [Nat]Added 75 Read/Feed constraints in 323 ms returned sat
[2024-05-22 16:43:48] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:43:49] [INFO ] Added : 43 causal constraints over 9 iterations in 405 ms. Result :sat
Minimization took 1106 ms.
[2024-05-22 16:43:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:50] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:43:50] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-22 16:43:51] [INFO ] [Real]Added 75 Read/Feed constraints in 440 ms returned sat
[2024-05-22 16:43:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:51] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:43:51] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2024-05-22 16:43:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 852 ms returned sat
[2024-05-22 16:43:52] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 33 ms.
[2024-05-22 16:43:55] [INFO ] Added : 174 causal constraints over 35 iterations in 2925 ms. Result :sat
Minimization took 1449 ms.
[2024-05-22 16:43:56] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:56] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:43:57] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-22 16:43:57] [INFO ] [Real]Added 75 Read/Feed constraints in 286 ms returned sat
[2024-05-22 16:43:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:43:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:43:57] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 31 ms returned sat
[2024-05-22 16:43:57] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-22 16:43:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 854 ms returned sat
[2024-05-22 16:43:58] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:44:00] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-05-22 16:44:00] [INFO ] Added : 102 causal constraints over 21 iterations in 1707 ms. Result :sat
Minimization took 1815 ms.
[2024-05-22 16:44:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:44:02] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:44:02] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2024-05-22 16:44:02] [INFO ] [Real]Added 75 Read/Feed constraints in 387 ms returned sat
[2024-05-22 16:44:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:44:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:44:03] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:44:03] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-22 16:44:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 926 ms returned sat
[2024-05-22 16:44:04] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 26 ms.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:44:07] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:44:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1032 ms
[2024-05-22 16:44:08] [INFO ] Added : 184 causal constraints over 37 iterations in 4205 ms. Result :sat
Minimization took 1643 ms.
[2024-05-22 16:44:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:44:10] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 38 ms returned sat
[2024-05-22 16:44:10] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-22 16:44:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:44:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:44:10] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 36 ms returned sat
[2024-05-22 16:44:10] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2024-05-22 16:44:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:44:15] [INFO ] [Nat]Added 75 Read/Feed constraints in 4699 ms returned sat
[2024-05-22 16:44:15] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 20 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:44:24] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:44:25] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:44:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1322 ms
[2024-05-22 16:44:25] [INFO ] Added : 288 causal constraints over 59 iterations in 9622 ms. Result :sat
Minimization took 2392 ms.
[2024-05-22 16:44:27] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:44:27] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 33 ms returned sat
[2024-05-22 16:44:28] [INFO ] [Real]Absence check using state equation in 311 ms returned sat
[2024-05-22 16:44:28] [INFO ] [Real]Added 75 Read/Feed constraints in 536 ms returned sat
[2024-05-22 16:44:28] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 30 ms.
[2024-05-22 16:44:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:44:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:44:28] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 29 ms returned sat
[2024-05-22 16:44:29] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-05-22 16:44:31] [INFO ] [Nat]Added 75 Read/Feed constraints in 1767 ms returned sat
[2024-05-22 16:44:31] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 28 ms.
[2024-05-22 16:44:33] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:44:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-22 16:44:33] [INFO ] Added : 161 causal constraints over 33 iterations in 2623 ms. Result :sat
Minimization took 1682 ms.
[2024-05-22 16:44:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:44:35] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:44:35] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2024-05-22 16:44:36] [INFO ] [Real]Added 75 Read/Feed constraints in 1040 ms returned sat
[2024-05-22 16:44:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:44:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:44:36] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:44:37] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2024-05-22 16:44:39] [INFO ] [Nat]Added 75 Read/Feed constraints in 2022 ms returned sat
[2024-05-22 16:44:39] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-22 16:44:56] [INFO ] Deduced a trap composed of 8 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2024-05-22 16:44:56] [INFO ] Added : 364 causal constraints over 74 iterations in 17134 ms. Result :sat
Minimization took 3564 ms.
[2024-05-22 16:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:45:00] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:45:00] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2024-05-22 16:45:00] [INFO ] [Real]Added 75 Read/Feed constraints in 170 ms returned sat
[2024-05-22 16:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:45:00] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 30 ms returned sat
[2024-05-22 16:45:00] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2024-05-22 16:45:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 1015 ms returned sat
[2024-05-22 16:45:01] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 27 ms.
[2024-05-22 16:45:02] [INFO ] Deduced a trap composed of 8 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:45:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2024-05-22 16:45:02] [INFO ] Added : 81 causal constraints over 17 iterations in 1042 ms. Result :sat
Minimization took 1521 ms.
[2024-05-22 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-22 16:45:04] [INFO ] [Real]Absence check using 2 positive and 98 generalized place invariants in 32 ms returned sat
[2024-05-22 16:45:04] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2024-05-22 16:45:04] [INFO ] [Real]Added 75 Read/Feed constraints in 152 ms returned sat
[2024-05-22 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-22 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 98 generalized place invariants in 35 ms returned sat
[2024-05-22 16:45:05] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2024-05-22 16:45:05] [INFO ] [Nat]Added 75 Read/Feed constraints in 175 ms returned sat
[2024-05-22 16:45:05] [INFO ] Computed and/alt/rep : 406/2326/406 causal constraints (skipped 61 transitions) in 29 ms.
[2024-05-22 16:45:06] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-22 16:45:06] [INFO ] Added : 77 causal constraints over 16 iterations in 1162 ms. Result :sat
Minimization took 1801 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 468/468 transitions.
Applied a total of 0 rules in 24 ms. Remains 493 /493 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 493/493 places, 468/468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 468/468 transitions.
Applied a total of 0 rules in 13 ms. Remains 493 /493 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-22 16:47:31] [INFO ] Invariant cache hit.
[2024-05-22 16:47:32] [INFO ] Implicit Places using invariants in 861 ms returned [14, 19, 47, 75, 80, 103, 108, 157, 162, 163, 190, 211, 218, 225, 239, 244, 267, 273, 297, 302, 323, 329, 350, 355, 376, 382, 403, 405, 409, 429, 436, 458, 463, 467, 485, 491]
[2024-05-22 16:47:32] [INFO ] Actually due to overlaps returned [163, 225, 80, 75, 157, 162]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 865 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 487/493 places, 468/468 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 487 transition count 465
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 484 transition count 465
Applied a total of 6 rules in 26 ms. Remains 484 /487 variables (removed 3) and now considering 465/468 (removed 3) transitions.
// Phase 1: matrix 465 rows 484 cols
[2024-05-22 16:47:32] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:47:32] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 465 rows 484 cols
[2024-05-22 16:47:32] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:47:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:47:40] [INFO ] Implicit Places using invariants and state equation in 8216 ms returned [14, 19, 47, 100, 105, 183, 204, 211, 230, 235, 258, 264, 288, 293, 314, 320, 341, 346, 367, 373, 394, 396, 400, 420, 427, 449, 454, 458, 476, 482]
[2024-05-22 16:47:40] [INFO ] Actually due to overlaps returned [183, 458, 100, 396, 105]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 8583 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 479/493 places, 465/468 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 479 transition count 463
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 477 transition count 463
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 477 transition count 463
Applied a total of 5 rules in 55 ms. Remains 477 /479 variables (removed 2) and now considering 463/465 (removed 2) transitions.
// Phase 1: matrix 463 rows 477 cols
[2024-05-22 16:47:40] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 16:47:41] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 463 rows 477 cols
[2024-05-22 16:47:41] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:47:41] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:47:47] [INFO ] Implicit Places using invariants and state equation in 6510 ms returned [14, 19, 47, 200, 207, 226, 231, 254, 260, 284, 289, 310, 316, 337, 342, 363, 369, 390, 395, 415, 422, 444, 449, 469, 475]
[2024-05-22 16:47:47] [INFO ] Actually due to overlaps returned [207, 47, 200]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 6898 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 474/493 places, 463/468 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 474 transition count 463
Applied a total of 1 rules in 31 ms. Remains 474 /474 variables (removed 0) and now considering 463/463 (removed 0) transitions.
// Phase 1: matrix 463 rows 474 cols
[2024-05-22 16:47:47] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:47:48] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 463 rows 474 cols
[2024-05-22 16:47:48] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:47:48] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:47:55] [INFO ] Implicit Places using invariants and state equation in 6924 ms returned [14, 19, 223, 228, 251, 257, 281, 286, 307, 313, 334, 339, 360, 366, 387, 392, 412, 419, 441, 446, 466, 472]
[2024-05-22 16:47:55] [INFO ] Actually due to overlaps returned [228, 223]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7326 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 472/493 places, 463/468 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 472 transition count 462
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 471 transition count 462
Applied a total of 2 rules in 29 ms. Remains 471 /472 variables (removed 1) and now considering 462/463 (removed 1) transitions.
// Phase 1: matrix 462 rows 471 cols
[2024-05-22 16:47:55] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:47:55] [INFO ] Implicit Places using invariants in 308 ms returned []
// Phase 1: matrix 462 rows 471 cols
[2024-05-22 16:47:55] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:47:55] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:48:01] [INFO ] Implicit Places using invariants and state equation in 6448 ms returned [14, 19, 248, 254, 278, 283, 304, 310, 331, 336, 357, 363, 384, 389, 409, 416, 438, 443, 463, 469]
[2024-05-22 16:48:01] [INFO ] Actually due to overlaps returned [254, 248]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6760 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 469/493 places, 462/468 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 469 transition count 461
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 468 transition count 461
Applied a total of 2 rules in 24 ms. Remains 468 /469 variables (removed 1) and now considering 461/462 (removed 1) transitions.
// Phase 1: matrix 461 rows 468 cols
[2024-05-22 16:48:02] [INFO ] Computed 82 invariants in 55 ms
[2024-05-22 16:48:02] [INFO ] Implicit Places using invariants in 577 ms returned [14, 19, 275, 280, 301, 307, 328, 333, 354, 360, 381, 386, 406, 413, 435, 440, 460, 466]
[2024-05-22 16:48:02] [INFO ] Actually due to overlaps returned [280, 275]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 582 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 466/493 places, 461/468 transitions.
Applied a total of 0 rules in 20 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 7 iterations and 31218 ms. Remains : 466/493 places, 461/468 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 119=1, 270=1, 275=1, 392=1, 411=1, 449=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 119=1, 270=1, 275=1, 392=1, 411=1, 449=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1268 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 461 rows 466 cols
[2024-05-22 16:48:04] [INFO ] Invariants computation overflowed in 37 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (125269 resets) in 902 ms. (1107 steps per ms)
BEST_FIRST walk for 15000007 steps (1250235 resets) in 9408 ms. (1594 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 461 rows 466 cols
[2024-05-22 16:48:14] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:48:15] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2024-05-22 16:48:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:48:16] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2024-05-22 16:48:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:48:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:48:25] [INFO ] [Nat]Added 75 Read/Feed constraints in 9016 ms returned unknown
[2024-05-22 16:48:25] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-22 16:48:26] [INFO ] [Real]Added 75 Read/Feed constraints in 738 ms returned sat
[2024-05-22 16:48:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:48:26] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2024-05-22 16:48:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 1076 ms returned sat
[2024-05-22 16:48:27] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-22 16:48:29] [INFO ] Deduced a trap composed of 127 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:48:29] [INFO ] Deduced a trap composed of 129 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:29] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:48:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 660 ms
[2024-05-22 16:48:30] [INFO ] Added : 106 causal constraints over 22 iterations in 2149 ms. Result :sat
Minimization took 1475 ms.
[2024-05-22 16:48:31] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2024-05-22 16:48:33] [INFO ] [Real]Added 75 Read/Feed constraints in 1151 ms returned sat
[2024-05-22 16:48:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:48:33] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-05-22 16:48:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 1113 ms returned sat
[2024-05-22 16:48:34] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:48:34] [INFO ] Deduced a trap composed of 28 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:48:35] [INFO ] Deduced a trap composed of 141 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:48:35] [INFO ] Deduced a trap composed of 22 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:48:35] [INFO ] Deduced a trap composed of 126 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:48:35] [INFO ] Deduced a trap composed of 137 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:48:36] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:48:36] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:48:37] [INFO ] Deduced a trap composed of 144 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:48:37] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:48:37] [INFO ] Deduced a trap composed of 127 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:38] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:48:38] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:48:39] [INFO ] Deduced a trap composed of 142 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:39] [INFO ] Deduced a trap composed of 139 places in 165 ms of which 3 ms to minimize.
[2024-05-22 16:48:39] [INFO ] Deduced a trap composed of 142 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:48:39] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:48:40] [INFO ] Deduced a trap composed of 118 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:48:40] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:48:40] [INFO ] Deduced a trap composed of 145 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:48:40] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:48:41] [INFO ] Deduced a trap composed of 150 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:48:41] [INFO ] Deduced a trap composed of 136 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:48:41] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:48:41] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:48:42] [INFO ] Deduced a trap composed of 154 places in 181 ms of which 3 ms to minimize.
[2024-05-22 16:48:42] [INFO ] Deduced a trap composed of 151 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:48:43] [INFO ] Deduced a trap composed of 136 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:48:43] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:48:43] [INFO ] Deduced a trap composed of 115 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 10 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 139 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:48:45] [INFO ] Deduced a trap composed of 141 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 131 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:48:46] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 141 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:48] [INFO ] Deduced a trap composed of 144 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:49] [INFO ] Deduced a trap composed of 149 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:48:49] [INFO ] Deduced a trap composed of 135 places in 180 ms of which 4 ms to minimize.
[2024-05-22 16:48:49] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:48:49] [INFO ] Deduced a trap composed of 128 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:48:49] [INFO ] Deduced a trap composed of 143 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 137 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 136 places in 185 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 153 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:50] [INFO ] Deduced a trap composed of 145 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:48:51] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:48:51] [INFO ] Deduced a trap composed of 154 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:48:51] [INFO ] Deduced a trap composed of 139 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:48:51] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:48:51] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:48:52] [INFO ] Deduced a trap composed of 136 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:48:52] [INFO ] Deduced a trap composed of 146 places in 167 ms of which 4 ms to minimize.
[2024-05-22 16:48:52] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:48:53] [INFO ] Deduced a trap composed of 146 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:53] [INFO ] Deduced a trap composed of 147 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 159 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 140 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 142 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:48:54] [INFO ] Deduced a trap composed of 137 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:48:55] [INFO ] Deduced a trap composed of 141 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:48:55] [INFO ] Deduced a trap composed of 144 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:48:55] [INFO ] Deduced a trap composed of 134 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 146 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 149 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 137 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:48:58] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:48:59] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:49:00] [INFO ] Deduced a trap composed of 133 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:49:00] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:49:00] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:49:00] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:49:01] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 2 ms to minimize.
[2024-05-22 16:49:01] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:49:01] [INFO ] Deduced a trap composed of 133 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 143 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 148 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 157 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 153 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:49:02] [INFO ] Deduced a trap composed of 27 places in 161 ms of which 4 ms to minimize.
[2024-05-22 16:49:03] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:49:03] [INFO ] Deduced a trap composed of 156 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:49:04] [INFO ] Deduced a trap composed of 146 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:49:04] [INFO ] Deduced a trap composed of 141 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 142 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:49:05] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 3 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 149 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 145 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 143 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:49:06] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:49:07] [INFO ] Deduced a trap composed of 142 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:49:07] [INFO ] Deduced a trap composed of 155 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:49:08] [INFO ] Deduced a trap composed of 157 places in 165 ms of which 3 ms to minimize.
[2024-05-22 16:49:08] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 143 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 140 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 153 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:49:09] [INFO ] Deduced a trap composed of 158 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 148 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 150 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 146 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 139 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:49:10] [INFO ] Deduced a trap composed of 140 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 147 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 168 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 155 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 145 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 142 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Deduced a trap composed of 149 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:49:11] [INFO ] Trap strengthening (SAT) tested/added 123/122 trap constraints in 37447 ms
[2024-05-22 16:49:12] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-22 16:49:18] [INFO ] Added : 135 causal constraints over 27 iterations in 6096 ms. Result :unknown
[2024-05-22 16:49:18] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2024-05-22 16:49:19] [INFO ] [Real]Added 75 Read/Feed constraints in 934 ms returned sat
[2024-05-22 16:49:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:49:19] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2024-05-22 16:49:21] [INFO ] [Nat]Added 75 Read/Feed constraints in 1933 ms returned sat
[2024-05-22 16:49:21] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 40 ms.
[2024-05-22 16:49:36] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:49:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 289 ms
[2024-05-22 16:49:37] [INFO ] Added : 393 causal constraints over 79 iterations in 15531 ms. Result :sat
Minimization took 4503 ms.
[2024-05-22 16:49:41] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2024-05-22 16:49:42] [INFO ] [Real]Added 75 Read/Feed constraints in 747 ms returned sat
[2024-05-22 16:49:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:49:43] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2024-05-22 16:49:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 1709 ms returned sat
[2024-05-22 16:49:44] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 31 ms.
[2024-05-22 16:49:54] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-22 16:49:55] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-05-22 16:49:55] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 3 ms to minimize.
[2024-05-22 16:49:55] [INFO ] Deduced a trap composed of 36 places in 130 ms of which 3 ms to minimize.
[2024-05-22 16:49:55] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-05-22 16:49:55] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 3 ms to minimize.
[2024-05-22 16:49:56] [INFO ] Deduced a trap composed of 35 places in 128 ms of which 3 ms to minimize.
[2024-05-22 16:49:56] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 3 ms to minimize.
[2024-05-22 16:49:56] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-22 16:49:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1671 ms
[2024-05-22 16:49:56] [INFO ] Added : 350 causal constraints over 71 iterations in 11815 ms. Result :sat
Minimization took 2639 ms.
[2024-05-22 16:49:59] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2024-05-22 16:50:00] [INFO ] [Real]Added 75 Read/Feed constraints in 450 ms returned sat
[2024-05-22 16:50:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:00] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2024-05-22 16:50:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 933 ms returned sat
[2024-05-22 16:50:01] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-22 16:50:04] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-22 16:50:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2024-05-22 16:50:04] [INFO ] Added : 180 causal constraints over 37 iterations in 2678 ms. Result :sat
Minimization took 1021 ms.
[2024-05-22 16:50:05] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2024-05-22 16:50:06] [INFO ] [Real]Added 75 Read/Feed constraints in 1007 ms returned sat
[2024-05-22 16:50:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:07] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-22 16:50:07] [INFO ] [Nat]Added 75 Read/Feed constraints in 195 ms returned sat
[2024-05-22 16:50:07] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-05-22 16:50:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2024-05-22 16:50:07] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 31 ms.
[2024-05-22 16:50:07] [INFO ] Added : 41 causal constraints over 9 iterations in 327 ms. Result :sat
Minimization took 318 ms.
[2024-05-22 16:50:08] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2024-05-22 16:50:09] [INFO ] [Real]Added 75 Read/Feed constraints in 1308 ms returned sat
[2024-05-22 16:50:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:09] [INFO ] [Nat]Absence check using state equation in 237 ms returned sat
[2024-05-22 16:50:10] [INFO ] [Nat]Added 75 Read/Feed constraints in 789 ms returned sat
[2024-05-22 16:50:10] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-22 16:50:15] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:50:16] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:50:16] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:50:16] [INFO ] Deduced a trap composed of 165 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:50:16] [INFO ] Deduced a trap composed of 157 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:50:17] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:50:17] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:50:17] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:50:17] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:50:17] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:50:18] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:50:18] [INFO ] Deduced a trap composed of 137 places in 165 ms of which 3 ms to minimize.
[2024-05-22 16:50:18] [INFO ] Deduced a trap composed of 135 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:50:18] [INFO ] Deduced a trap composed of 144 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:50:18] [INFO ] Deduced a trap composed of 142 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:50:19] [INFO ] Deduced a trap composed of 139 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:50:19] [INFO ] Deduced a trap composed of 143 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:50:19] [INFO ] Deduced a trap composed of 151 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:50:19] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 4 ms to minimize.
[2024-05-22 16:50:20] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:50:20] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 3 ms to minimize.
[2024-05-22 16:50:20] [INFO ] Deduced a trap composed of 158 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:50:20] [INFO ] Deduced a trap composed of 153 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:50:20] [INFO ] Deduced a trap composed of 151 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:50:21] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:50:21] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 3 ms to minimize.
[2024-05-22 16:50:21] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 2 ms to minimize.
[2024-05-22 16:50:21] [INFO ] Deduced a trap composed of 158 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:50:21] [INFO ] Deduced a trap composed of 145 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:50:22] [INFO ] Deduced a trap composed of 136 places in 167 ms of which 2 ms to minimize.
[2024-05-22 16:50:22] [INFO ] Deduced a trap composed of 147 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:50:22] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:50:22] [INFO ] Deduced a trap composed of 139 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:50:23] [INFO ] Deduced a trap composed of 145 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:50:23] [INFO ] Deduced a trap composed of 143 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:50:23] [INFO ] Deduced a trap composed of 156 places in 162 ms of which 3 ms to minimize.
[2024-05-22 16:50:23] [INFO ] Deduced a trap composed of 142 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:50:24] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:50:24] [INFO ] Deduced a trap composed of 125 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:50:24] [INFO ] Deduced a trap composed of 124 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:50:24] [INFO ] Deduced a trap composed of 119 places in 169 ms of which 3 ms to minimize.
[2024-05-22 16:50:25] [INFO ] Deduced a trap composed of 117 places in 156 ms of which 2 ms to minimize.
[2024-05-22 16:50:25] [INFO ] Deduced a trap composed of 114 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:50:25] [INFO ] Deduced a trap composed of 113 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:50:25] [INFO ] Deduced a trap composed of 126 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:50:25] [INFO ] Deduced a trap composed of 122 places in 166 ms of which 3 ms to minimize.
[2024-05-22 16:50:26] [INFO ] Deduced a trap composed of 151 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:50:26] [INFO ] Deduced a trap composed of 129 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:50:26] [INFO ] Deduced a trap composed of 128 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:50:26] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 2 ms to minimize.
[2024-05-22 16:50:27] [INFO ] Deduced a trap composed of 149 places in 166 ms of which 2 ms to minimize.
[2024-05-22 16:50:27] [INFO ] Deduced a trap composed of 160 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:50:27] [INFO ] Deduced a trap composed of 144 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:50:27] [INFO ] Deduced a trap composed of 150 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:50:27] [INFO ] Deduced a trap composed of 164 places in 158 ms of which 2 ms to minimize.
[2024-05-22 16:50:28] [INFO ] Deduced a trap composed of 164 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:50:28] [INFO ] Deduced a trap composed of 166 places in 159 ms of which 2 ms to minimize.
[2024-05-22 16:50:28] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 12692 ms
[2024-05-22 16:50:28] [INFO ] Added : 232 causal constraints over 47 iterations in 17794 ms. Result :sat
Minimization took 3502 ms.
[2024-05-22 16:50:32] [INFO ] [Real]Absence check using state equation in 443 ms returned sat
[2024-05-22 16:50:33] [INFO ] [Real]Added 75 Read/Feed constraints in 629 ms returned sat
[2024-05-22 16:50:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:33] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2024-05-22 16:50:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 952 ms returned sat
[2024-05-22 16:50:34] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-22 16:50:41] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:50:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2024-05-22 16:50:41] [INFO ] Added : 204 causal constraints over 42 iterations in 6517 ms. Result :sat
Minimization took 1226 ms.
[2024-05-22 16:50:42] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-22 16:50:43] [INFO ] [Real]Added 75 Read/Feed constraints in 311 ms returned sat
[2024-05-22 16:50:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:43] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-05-22 16:50:44] [INFO ] [Nat]Added 75 Read/Feed constraints in 760 ms returned sat
[2024-05-22 16:50:44] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-22 16:50:51] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-05-22 16:50:52] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 2 ms to minimize.
[2024-05-22 16:50:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2024-05-22 16:50:52] [INFO ] Added : 210 causal constraints over 43 iterations in 7627 ms. Result :sat
Minimization took 1785 ms.
[2024-05-22 16:50:54] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2024-05-22 16:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:50:54] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2024-05-22 16:50:58] [INFO ] [Nat]Added 75 Read/Feed constraints in 4376 ms returned sat
[2024-05-22 16:50:59] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 26 ms.
[2024-05-22 16:51:12] [INFO ] Deduced a trap composed of 18 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:51:12] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:51:12] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:51:13] [INFO ] Deduced a trap composed of 22 places in 162 ms of which 2 ms to minimize.
[2024-05-22 16:51:13] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:51:13] [INFO ] Deduced a trap composed of 149 places in 167 ms of which 3 ms to minimize.
[2024-05-22 16:51:13] [INFO ] Deduced a trap composed of 151 places in 158 ms of which 3 ms to minimize.
[2024-05-22 16:51:14] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:51:14] [INFO ] Deduced a trap composed of 20 places in 152 ms of which 3 ms to minimize.
[2024-05-22 16:51:14] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:51:14] [INFO ] Deduced a trap composed of 40 places in 152 ms of which 2 ms to minimize.
[2024-05-22 16:51:14] [INFO ] Deduced a trap composed of 164 places in 152 ms of which 2 ms to minimize.
[2024-05-22 16:51:15] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:51:15] [INFO ] Deduced a trap composed of 165 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:51:15] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 2 ms to minimize.
[2024-05-22 16:51:15] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 3 ms to minimize.
[2024-05-22 16:51:15] [INFO ] Deduced a trap composed of 160 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 165 places in 161 ms of which 2 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 163 places in 139 ms of which 3 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 172 places in 138 ms of which 2 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 3 ms to minimize.
[2024-05-22 16:51:16] [INFO ] Deduced a trap composed of 176 places in 147 ms of which 2 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 163 places in 154 ms of which 3 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 168 places in 139 ms of which 2 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 181 places in 145 ms of which 2 ms to minimize.
[2024-05-22 16:51:17] [INFO ] Deduced a trap composed of 169 places in 149 ms of which 2 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 165 places in 148 ms of which 3 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 173 places in 150 ms of which 3 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 179 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:51:18] [INFO ] Deduced a trap composed of 166 places in 152 ms of which 3 ms to minimize.
[2024-05-22 16:51:19] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 2 ms to minimize.
[2024-05-22 16:51:19] [INFO ] Deduced a trap composed of 157 places in 147 ms of which 2 ms to minimize.
[2024-05-22 16:51:19] [INFO ] Deduced a trap composed of 169 places in 144 ms of which 2 ms to minimize.
[2024-05-22 16:51:19] [INFO ] Deduced a trap composed of 159 places in 142 ms of which 3 ms to minimize.
[2024-05-22 16:51:19] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 3 ms to minimize.
[2024-05-22 16:51:20] [INFO ] Deduced a trap composed of 183 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:51:20] [INFO ] Deduced a trap composed of 152 places in 142 ms of which 2 ms to minimize.
[2024-05-22 16:51:20] [INFO ] Deduced a trap composed of 170 places in 149 ms of which 2 ms to minimize.
[2024-05-22 16:51:20] [INFO ] Deduced a trap composed of 163 places in 143 ms of which 2 ms to minimize.
[2024-05-22 16:51:20] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 8361 ms
[2024-05-22 16:51:21] [INFO ] Added : 272 causal constraints over 55 iterations in 22006 ms.(timeout) Result :sat
Minimization took 4509 ms.
[2024-05-22 16:51:25] [INFO ] [Real]Absence check using state equation in 324 ms returned sat
[2024-05-22 16:51:26] [INFO ] [Real]Added 75 Read/Feed constraints in 544 ms returned sat
[2024-05-22 16:51:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:26] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-22 16:51:27] [INFO ] [Nat]Added 75 Read/Feed constraints in 1090 ms returned sat
[2024-05-22 16:51:28] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 25 ms.
[2024-05-22 16:51:30] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 3 ms to minimize.
[2024-05-22 16:51:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-22 16:51:30] [INFO ] Added : 139 causal constraints over 28 iterations in 2279 ms. Result :sat
Minimization took 967 ms.
[2024-05-22 16:51:31] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-22 16:51:32] [INFO ] [Real]Added 75 Read/Feed constraints in 916 ms returned sat
[2024-05-22 16:51:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:32] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-22 16:51:34] [INFO ] [Nat]Added 75 Read/Feed constraints in 1816 ms returned sat
[2024-05-22 16:51:34] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 29 ms.
[2024-05-22 16:51:48] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-05-22 16:51:49] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 3 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 30 places in 86 ms of which 1 ms to minimize.
[2024-05-22 16:51:50] [INFO ] Deduced a trap composed of 64 places in 56 ms of which 1 ms to minimize.
[2024-05-22 16:51:51] [INFO ] Deduced a trap composed of 76 places in 60 ms of which 1 ms to minimize.
[2024-05-22 16:51:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2418 ms
[2024-05-22 16:51:51] [INFO ] Added : 364 causal constraints over 73 iterations in 16572 ms. Result :sat
Minimization took 4501 ms.
[2024-05-22 16:51:56] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2024-05-22 16:51:56] [INFO ] [Real]Added 75 Read/Feed constraints in 422 ms returned sat
[2024-05-22 16:51:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:51:56] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-05-22 16:51:57] [INFO ] [Nat]Added 75 Read/Feed constraints in 650 ms returned sat
[2024-05-22 16:51:57] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 28 ms.
[2024-05-22 16:52:01] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2024-05-22 16:52:01] [INFO ] Deduced a trap composed of 3 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:52:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 461 ms
[2024-05-22 16:52:01] [INFO ] Added : 158 causal constraints over 33 iterations in 4284 ms. Result :sat
Minimization took 1331 ms.
[2024-05-22 16:52:03] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-22 16:52:04] [INFO ] [Real]Added 75 Read/Feed constraints in 766 ms returned sat
[2024-05-22 16:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:52:04] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-22 16:52:04] [INFO ] [Nat]Added 75 Read/Feed constraints in 167 ms returned sat
[2024-05-22 16:52:04] [INFO ] Computed and/alt/rep : 402/2348/402 causal constraints (skipped 58 transitions) in 27 ms.
[2024-05-22 16:52:06] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:52:06] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:52:06] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 3 ms to minimize.
[2024-05-22 16:52:06] [INFO ] Deduced a trap composed of 11 places in 177 ms of which 3 ms to minimize.
[2024-05-22 16:52:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 834 ms
[2024-05-22 16:52:06] [INFO ] Added : 79 causal constraints over 18 iterations in 1963 ms. Result :sat
Minimization took 732 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 9 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 466/466 places, 461/461 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 461/461 transitions.
Applied a total of 0 rules in 9 ms. Remains 466 /466 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 466 cols
[2024-05-22 16:53:13] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:53:13] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 461 rows 466 cols
[2024-05-22 16:53:13] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:53:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:53:19] [INFO ] Implicit Places using invariants and state equation in 5368 ms returned [14, 19, 299, 305, 326, 331, 352, 358, 379, 384, 404, 411, 433, 438, 458, 464]
[2024-05-22 16:53:19] [INFO ] Actually due to overlaps returned [305, 299]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5663 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 464/466 places, 461/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 460
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 460
Applied a total of 2 rules in 27 ms. Remains 463 /464 variables (removed 1) and now considering 460/461 (removed 1) transitions.
// Phase 1: matrix 460 rows 463 cols
[2024-05-22 16:53:19] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:53:19] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 460 rows 463 cols
[2024-05-22 16:53:19] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:53:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:53:27] [INFO ] Implicit Places using invariants and state equation in 8107 ms returned [14, 19, 323, 328, 349, 355, 376, 381, 401, 408, 430, 435, 455, 461]
[2024-05-22 16:53:27] [INFO ] Actually due to overlaps returned [328, 323]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8406 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 461/466 places, 460/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 459
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 459
Applied a total of 2 rules in 24 ms. Remains 460 /461 variables (removed 1) and now considering 459/460 (removed 1) transitions.
// Phase 1: matrix 459 rows 460 cols
[2024-05-22 16:53:27] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:53:27] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 459 rows 460 cols
[2024-05-22 16:53:27] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:53:28] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:53:35] [INFO ] Implicit Places using invariants and state equation in 7197 ms returned [14, 19, 346, 352, 373, 378, 398, 405, 427, 432, 452, 458]
[2024-05-22 16:53:35] [INFO ] Actually due to overlaps returned [352, 346]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7459 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 458/466 places, 459/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 458
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 458
Applied a total of 2 rules in 25 ms. Remains 457 /458 variables (removed 1) and now considering 458/459 (removed 1) transitions.
// Phase 1: matrix 458 rows 457 cols
[2024-05-22 16:53:35] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:53:35] [INFO ] Implicit Places using invariants in 264 ms returned []
// Phase 1: matrix 458 rows 457 cols
[2024-05-22 16:53:35] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:53:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:03] [INFO ] Implicit Places using invariants and state equation in 27690 ms returned [14, 19, 370, 375, 395, 402, 424, 429, 449, 455]
[2024-05-22 16:54:03] [INFO ] Actually due to overlaps returned [375, 370]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 27955 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 455/466 places, 458/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 457
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 457/458 (removed 1) transitions.
// Phase 1: matrix 457 rows 454 cols
[2024-05-22 16:54:03] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:54:03] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 457 rows 454 cols
[2024-05-22 16:54:03] [INFO ] Invariants computation overflowed in 35 ms
[2024-05-22 16:54:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:10] [INFO ] Implicit Places using invariants and state equation in 6800 ms returned [14, 19, 392, 399, 421, 426, 446, 452]
[2024-05-22 16:54:10] [INFO ] Actually due to overlaps returned [399, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7061 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 452/466 places, 457/461 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 457
Applied a total of 1 rules in 20 ms. Remains 452 /452 variables (removed 0) and now considering 457/457 (removed 0) transitions.
// Phase 1: matrix 457 rows 452 cols
[2024-05-22 16:54:10] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:54:10] [INFO ] Implicit Places using invariants in 259 ms returned []
// Phase 1: matrix 457 rows 452 cols
[2024-05-22 16:54:10] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:54:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:16] [INFO ] Implicit Places using invariants and state equation in 6026 ms returned [14, 19, 419, 424, 444, 450]
[2024-05-22 16:54:16] [INFO ] Actually due to overlaps returned [424, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6287 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 450/466 places, 457/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 450 transition count 456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 449 transition count 456
Applied a total of 2 rules in 21 ms. Remains 449 /450 variables (removed 1) and now considering 456/457 (removed 1) transitions.
// Phase 1: matrix 456 rows 449 cols
[2024-05-22 16:54:16] [INFO ] Invariants computation overflowed in 40 ms
[2024-05-22 16:54:16] [INFO ] Implicit Places using invariants in 257 ms returned []
// Phase 1: matrix 456 rows 449 cols
[2024-05-22 16:54:16] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:54:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:28] [INFO ] Implicit Places using invariants and state equation in 11920 ms returned [14, 19, 441, 447]
[2024-05-22 16:54:28] [INFO ] Actually due to overlaps returned [441, 14]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12178 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 447/466 places, 456/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 446 transition count 455
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 446 transition count 455
Applied a total of 3 rules in 21 ms. Remains 446 /447 variables (removed 1) and now considering 455/456 (removed 1) transitions.
// Phase 1: matrix 455 rows 446 cols
[2024-05-22 16:54:28] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:54:28] [INFO ] Implicit Places using invariants in 248 ms returned []
// Phase 1: matrix 455 rows 446 cols
[2024-05-22 16:54:28] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:54:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:34] [INFO ] Implicit Places using invariants and state equation in 5672 ms returned [444]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 5924 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 445/466 places, 455/461 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 444 transition count 454
Applied a total of 2 rules in 21 ms. Remains 444 /445 variables (removed 1) and now considering 454/455 (removed 1) transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 16:54:34] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:54:34] [INFO ] Implicit Places using invariants in 237 ms returned []
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 16:54:34] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:54:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 16:54:38] [INFO ] Implicit Places using invariants and state equation in 4097 ms returned []
Implicit Place search using SMT with State Equation took 4335 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 444/466 places, 454/461 transitions.
Finished structural reductions in REACHABILITY mode , in 9 iterations and 85455 ms. Remains : 444/466 places, 454/461 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1280 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:04:39] [INFO ] Invariants computation overflowed in 29 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (125691 resets) in 866 ms. (1153 steps per ms)
BEST_FIRST walk for 15000006 steps (1250088 resets) in 9279 ms. (1616 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:04:49] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 17:04:51] [INFO ] [Real]Absence check using state equation in 2316 ms returned sat
[2024-05-22 17:04:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:04:54] [INFO ] [Nat]Absence check using state equation in 2644 ms returned sat
[2024-05-22 17:04:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 17:04:59] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 17:05:00] [INFO ] [Nat]Added 75 Read/Feed constraints in 6043 ms returned sat
[2024-05-22 17:05:00] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 3 ms to minimize.
[2024-05-22 17:05:01] [INFO ] Deduced a trap composed of 124 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:05:01] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 3 ms to minimize.
[2024-05-22 17:05:01] [INFO ] Deduced a trap composed of 140 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:05:01] [INFO ] Deduced a trap composed of 136 places in 151 ms of which 3 ms to minimize.
[2024-05-22 17:05:02] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:05:02] [INFO ] Deduced a trap composed of 147 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:02] [INFO ] Deduced a trap composed of 127 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:02] [INFO ] Deduced a trap composed of 125 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:05:03] [INFO ] Deduced a trap composed of 126 places in 148 ms of which 3 ms to minimize.
[2024-05-22 17:05:03] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 2 ms to minimize.
[2024-05-22 17:05:03] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
[2024-05-22 17:05:04] [INFO ] Deduced a trap composed of 142 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:04] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:04] [INFO ] Deduced a trap composed of 133 places in 148 ms of which 3 ms to minimize.
[2024-05-22 17:05:04] [INFO ] Deduced a trap composed of 147 places in 145 ms of which 3 ms to minimize.
[2024-05-22 17:05:05] [INFO ] Deduced a trap composed of 145 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:05] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:05:05] [INFO ] Deduced a trap composed of 128 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:05:05] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 3 ms to minimize.
[2024-05-22 17:05:06] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 3 ms to minimize.
[2024-05-22 17:05:06] [INFO ] Deduced a trap composed of 152 places in 165 ms of which 2 ms to minimize.
[2024-05-22 17:05:06] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-22 17:05:07] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:05:07] [INFO ] Deduced a trap composed of 136 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:05:08] [INFO ] Deduced a trap composed of 147 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:05:08] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-22 17:05:09] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:05:09] [INFO ] Deduced a trap composed of 134 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:05:09] [INFO ] Deduced a trap composed of 143 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:05:09] [INFO ] Deduced a trap composed of 142 places in 133 ms of which 2 ms to minimize.
[2024-05-22 17:05:10] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:10] [INFO ] Deduced a trap composed of 153 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:05:11] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:05:11] [INFO ] Deduced a trap composed of 128 places in 142 ms of which 3 ms to minimize.
[2024-05-22 17:05:11] [INFO ] Deduced a trap composed of 138 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:05:12] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:12] [INFO ] Deduced a trap composed of 159 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:12] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 3 ms to minimize.
[2024-05-22 17:05:12] [INFO ] Deduced a trap composed of 141 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:05:12] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:05:13] [INFO ] Deduced a trap composed of 134 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:05:13] [INFO ] Deduced a trap composed of 135 places in 137 ms of which 3 ms to minimize.
[2024-05-22 17:05:13] [INFO ] Deduced a trap composed of 136 places in 155 ms of which 3 ms to minimize.
[2024-05-22 17:05:14] [INFO ] Deduced a trap composed of 144 places in 145 ms of which 3 ms to minimize.
[2024-05-22 17:05:15] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 2 ms to minimize.
[2024-05-22 17:05:15] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 3 ms to minimize.
[2024-05-22 17:05:16] [INFO ] Deduced a trap composed of 137 places in 144 ms of which 2 ms to minimize.
[2024-05-22 17:05:17] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:22] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 21304 ms
[2024-05-22 17:05:22] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-05-22 17:05:22] [INFO ] [Real]Added 75 Read/Feed constraints in 257 ms returned sat
[2024-05-22 17:05:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:05:23] [INFO ] [Nat]Absence check using state equation in 441 ms returned sat
[2024-05-22 17:05:23] [INFO ] [Nat]Added 75 Read/Feed constraints in 178 ms returned sat
[2024-05-22 17:05:23] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:05:24] [INFO ] Deduced a trap composed of 8 places in 163 ms of which 2 ms to minimize.
[2024-05-22 17:05:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-22 17:05:24] [INFO ] Added : 77 causal constraints over 16 iterations in 970 ms. Result :sat
Minimization took 833 ms.
[2024-05-22 17:05:25] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-22 17:05:26] [INFO ] [Real]Added 75 Read/Feed constraints in 807 ms returned sat
[2024-05-22 17:05:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:05:27] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2024-05-22 17:05:28] [INFO ] [Nat]Added 75 Read/Feed constraints in 1018 ms returned sat
[2024-05-22 17:05:28] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-22 17:05:28] [INFO ] Deduced a trap composed of 117 places in 163 ms of which 2 ms to minimize.
[2024-05-22 17:05:28] [INFO ] Deduced a trap composed of 16 places in 159 ms of which 3 ms to minimize.
[2024-05-22 17:05:28] [INFO ] Deduced a trap composed of 21 places in 159 ms of which 2 ms to minimize.
[2024-05-22 17:05:29] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 2 ms to minimize.
[2024-05-22 17:05:29] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2024-05-22 17:05:29] [INFO ] Deduced a trap composed of 123 places in 162 ms of which 2 ms to minimize.
[2024-05-22 17:05:29] [INFO ] Deduced a trap composed of 123 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:30] [INFO ] Deduced a trap composed of 155 places in 163 ms of which 3 ms to minimize.
[2024-05-22 17:05:31] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:05:31] [INFO ] Deduced a trap composed of 129 places in 158 ms of which 3 ms to minimize.
[2024-05-22 17:05:31] [INFO ] Deduced a trap composed of 140 places in 164 ms of which 2 ms to minimize.
[2024-05-22 17:05:32] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:05:34] [INFO ] Deduced a trap composed of 144 places in 160 ms of which 2 ms to minimize.
[2024-05-22 17:05:34] [INFO ] Deduced a trap composed of 136 places in 162 ms of which 3 ms to minimize.
[2024-05-22 17:05:34] [INFO ] Deduced a trap composed of 89 places in 157 ms of which 2 ms to minimize.
[2024-05-22 17:05:34] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:05:35] [INFO ] Deduced a trap composed of 142 places in 158 ms of which 2 ms to minimize.
[2024-05-22 17:05:35] [INFO ] Deduced a trap composed of 135 places in 158 ms of which 3 ms to minimize.
[2024-05-22 17:05:35] [INFO ] Deduced a trap composed of 143 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:05:35] [INFO ] Deduced a trap composed of 144 places in 141 ms of which 3 ms to minimize.
[2024-05-22 17:05:35] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:05:38] [INFO ] Deduced a trap composed of 148 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:05:38] [INFO ] Deduced a trap composed of 148 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:05:38] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:05:38] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:05:39] [INFO ] Deduced a trap composed of 137 places in 153 ms of which 3 ms to minimize.
[2024-05-22 17:05:39] [INFO ] Deduced a trap composed of 138 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:05:39] [INFO ] Deduced a trap composed of 142 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:05:41] [INFO ] Deduced a trap composed of 135 places in 159 ms of which 3 ms to minimize.
[2024-05-22 17:05:41] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 3 ms to minimize.
[2024-05-22 17:05:41] [INFO ] Deduced a trap composed of 6 places in 162 ms of which 2 ms to minimize.
[2024-05-22 17:05:42] [INFO ] Deduced a trap composed of 148 places in 158 ms of which 3 ms to minimize.
[2024-05-22 17:05:42] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:05:42] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 3 ms to minimize.
[2024-05-22 17:05:42] [INFO ] Deduced a trap composed of 158 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:05:42] [INFO ] Deduced a trap composed of 153 places in 160 ms of which 2 ms to minimize.
[2024-05-22 17:05:43] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:43] [INFO ] Deduced a trap composed of 116 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:05:44] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:05:44] [INFO ] Deduced a trap composed of 121 places in 144 ms of which 2 ms to minimize.
[2024-05-22 17:05:44] [INFO ] Deduced a trap composed of 122 places in 157 ms of which 3 ms to minimize.
[2024-05-22 17:05:44] [INFO ] Deduced a trap composed of 117 places in 141 ms of which 3 ms to minimize.
[2024-05-22 17:05:45] [INFO ] Deduced a trap composed of 139 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:46] [INFO ] Deduced a trap composed of 110 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:46] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:47] [INFO ] Deduced a trap composed of 132 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:05:47] [INFO ] Deduced a trap composed of 140 places in 161 ms of which 3 ms to minimize.
[2024-05-22 17:05:47] [INFO ] Deduced a trap composed of 141 places in 153 ms of which 3 ms to minimize.
[2024-05-22 17:05:47] [INFO ] Deduced a trap composed of 156 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:48] [INFO ] Deduced a trap composed of 152 places in 157 ms of which 2 ms to minimize.
[2024-05-22 17:05:49] [INFO ] Deduced a trap composed of 148 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:05:49] [INFO ] Deduced a trap composed of 146 places in 153 ms of which 3 ms to minimize.
[2024-05-22 17:05:49] [INFO ] Deduced a trap composed of 147 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:05:49] [INFO ] Deduced a trap composed of 151 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:05:49] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:50] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 3 ms to minimize.
[2024-05-22 17:05:50] [INFO ] Deduced a trap composed of 127 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:05:50] [INFO ] Deduced a trap composed of 148 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:50] [INFO ] Deduced a trap composed of 147 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:50] [INFO ] Deduced a trap composed of 153 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:05:51] [INFO ] Deduced a trap composed of 144 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:05:51] [INFO ] Deduced a trap composed of 145 places in 157 ms of which 3 ms to minimize.
[2024-05-22 17:05:51] [INFO ] Deduced a trap composed of 145 places in 139 ms of which 2 ms to minimize.
[2024-05-22 17:05:51] [INFO ] Deduced a trap composed of 146 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:52] [INFO ] Deduced a trap composed of 147 places in 138 ms of which 3 ms to minimize.
[2024-05-22 17:05:52] [INFO ] Deduced a trap composed of 142 places in 138 ms of which 2 ms to minimize.
[2024-05-22 17:05:52] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 149 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 144 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 136 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 3 ms to minimize.
[2024-05-22 17:05:53] [INFO ] Deduced a trap composed of 151 places in 151 ms of which 3 ms to minimize.
[2024-05-22 17:05:54] [INFO ] Deduced a trap composed of 144 places in 144 ms of which 3 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 140 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 145 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 156 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 145 places in 153 ms of which 2 ms to minimize.
[2024-05-22 17:05:56] [INFO ] Deduced a trap composed of 149 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:05:57] [INFO ] Deduced a trap composed of 136 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:05:57] [INFO ] Deduced a trap composed of 140 places in 158 ms of which 2 ms to minimize.
[2024-05-22 17:05:57] [INFO ] Deduced a trap composed of 153 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:57] [INFO ] Deduced a trap composed of 152 places in 153 ms of which 3 ms to minimize.
[2024-05-22 17:05:57] [INFO ] Deduced a trap composed of 151 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:58] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:58] [INFO ] Deduced a trap composed of 138 places in 138 ms of which 2 ms to minimize.
[2024-05-22 17:05:58] [INFO ] Deduced a trap composed of 137 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:58] [INFO ] Deduced a trap composed of 141 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 141 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 144 places in 137 ms of which 3 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 147 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:05:59] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:06:00] [INFO ] Deduced a trap composed of 145 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:06:00] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:06:01] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:06:01] [INFO ] Deduced a trap composed of 142 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:06:01] [INFO ] Deduced a trap composed of 144 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:06:01] [INFO ] Deduced a trap composed of 149 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:06:01] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:06:02] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:06:02] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 7 ms to minimize.
[2024-05-22 17:06:02] [INFO ] Deduced a trap composed of 133 places in 152 ms of which 3 ms to minimize.
[2024-05-22 17:06:02] [INFO ] Deduced a trap composed of 141 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 3 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 145 places in 140 ms of which 2 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 152 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 150 places in 153 ms of which 3 ms to minimize.
[2024-05-22 17:06:03] [INFO ] Deduced a trap composed of 155 places in 153 ms of which 2 ms to minimize.
[2024-05-22 17:06:04] [INFO ] Deduced a trap composed of 149 places in 148 ms of which 3 ms to minimize.
[2024-05-22 17:06:04] [INFO ] Deduced a trap composed of 152 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:06:04] [INFO ] Deduced a trap composed of 150 places in 135 ms of which 3 ms to minimize.
[2024-05-22 17:06:04] [INFO ] Deduced a trap composed of 137 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:06:04] [INFO ] Deduced a trap composed of 145 places in 148 ms of which 3 ms to minimize.
[2024-05-22 17:06:05] [INFO ] Deduced a trap composed of 142 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:06:05] [INFO ] Deduced a trap composed of 134 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:06:05] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 2 ms to minimize.
[2024-05-22 17:06:05] [INFO ] Deduced a trap composed of 132 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:06:05] [INFO ] Deduced a trap composed of 143 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:06:06] [INFO ] Deduced a trap composed of 137 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:06:06] [INFO ] Deduced a trap composed of 137 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:06:06] [INFO ] Deduced a trap composed of 153 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:06:06] [INFO ] Deduced a trap composed of 149 places in 152 ms of which 3 ms to minimize.
[2024-05-22 17:06:06] [INFO ] Deduced a trap composed of 151 places in 152 ms of which 3 ms to minimize.
[2024-05-22 17:06:07] [INFO ] Deduced a trap composed of 140 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:06:07] [INFO ] Deduced a trap composed of 143 places in 146 ms of which 2 ms to minimize.
[2024-05-22 17:06:07] [INFO ] Deduced a trap composed of 146 places in 152 ms of which 3 ms to minimize.
[2024-05-22 17:06:07] [INFO ] Deduced a trap composed of 150 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:06:07] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 3 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 147 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 136 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 157 places in 148 ms of which 2 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 129 places in 140 ms of which 2 ms to minimize.
[2024-05-22 17:06:08] [INFO ] Deduced a trap composed of 148 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:06:09] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:06:09] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2024-05-22 17:06:09] [INFO ] Deduced a trap composed of 152 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:06:09] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:06:09] [INFO ] Deduced a trap composed of 166 places in 146 ms of which 3 ms to minimize.
[2024-05-22 17:06:10] [INFO ] Deduced a trap composed of 124 places in 144 ms of which 2 ms to minimize.
[2024-05-22 17:06:10] [INFO ] Deduced a trap composed of 115 places in 147 ms of which 2 ms to minimize.
[2024-05-22 17:06:11] [INFO ] Trap strengthening (SAT) tested/added 146/146 trap constraints in 43404 ms
[2024-05-22 17:06:11] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2024-05-22 17:06:12] [INFO ] [Real]Added 75 Read/Feed constraints in 436 ms returned sat
[2024-05-22 17:06:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:12] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2024-05-22 17:06:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 1300 ms returned sat
[2024-05-22 17:06:14] [INFO ] Deduced a trap composed of 106 places in 152 ms of which 2 ms to minimize.
[2024-05-22 17:06:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 203 ms
[2024-05-22 17:06:14] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-22 17:06:30] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 2 ms to minimize.
[2024-05-22 17:06:30] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-05-22 17:06:30] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-22 17:06:30] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-22 17:06:30] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-05-22 17:06:31] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 0 ms to minimize.
[2024-05-22 17:06:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1909 ms
[2024-05-22 17:06:32] [INFO ] Added : 365 causal constraints over 73 iterations in 17923 ms. Result :sat
Minimization took 4501 ms.
[2024-05-22 17:06:36] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2024-05-22 17:06:37] [INFO ] [Real]Added 75 Read/Feed constraints in 486 ms returned sat
[2024-05-22 17:06:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:37] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2024-05-22 17:06:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 1161 ms returned sat
[2024-05-22 17:06:38] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:06:50] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 2 ms to minimize.
[2024-05-22 17:06:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2024-05-22 17:06:50] [INFO ] Added : 266 causal constraints over 54 iterations in 11981 ms. Result :sat
Minimization took 2768 ms.
[2024-05-22 17:06:54] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2024-05-22 17:06:54] [INFO ] [Real]Added 75 Read/Feed constraints in 237 ms returned sat
[2024-05-22 17:06:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:06:55] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2024-05-22 17:06:56] [INFO ] [Nat]Added 75 Read/Feed constraints in 665 ms returned sat
[2024-05-22 17:06:56] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-22 17:07:02] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 3 ms to minimize.
[2024-05-22 17:07:03] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
[2024-05-22 17:07:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 362 ms
[2024-05-22 17:07:03] [INFO ] Added : 248 causal constraints over 51 iterations in 7229 ms. Result :sat
Minimization took 1565 ms.
[2024-05-22 17:07:05] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-22 17:07:05] [INFO ] [Real]Added 75 Read/Feed constraints in 721 ms returned sat
[2024-05-22 17:07:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:07:06] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-22 17:07:06] [INFO ] [Nat]Added 75 Read/Feed constraints in 140 ms returned sat
[2024-05-22 17:07:06] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:07:06] [INFO ] Added : 38 causal constraints over 8 iterations in 274 ms. Result :sat
Minimization took 313 ms.
[2024-05-22 17:07:07] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-05-22 17:07:07] [INFO ] [Real]Added 75 Read/Feed constraints in 700 ms returned sat
[2024-05-22 17:07:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:07:08] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2024-05-22 17:07:08] [INFO ] [Nat]Added 75 Read/Feed constraints in 585 ms returned sat
[2024-05-22 17:07:08] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-22 17:07:10] [INFO ] Added : 136 causal constraints over 28 iterations in 1858 ms. Result :sat
Minimization took 697 ms.
[2024-05-22 17:07:11] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2024-05-22 17:07:12] [INFO ] [Real]Added 75 Read/Feed constraints in 450 ms returned sat
[2024-05-22 17:07:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:07:12] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-22 17:07:13] [INFO ] [Nat]Added 75 Read/Feed constraints in 619 ms returned sat
[2024-05-22 17:07:13] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-22 17:07:21] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 2 ms to minimize.
[2024-05-22 17:07:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2024-05-22 17:07:21] [INFO ] Added : 180 causal constraints over 36 iterations in 8085 ms. Result :sat
Minimization took 1239 ms.
[2024-05-22 17:07:23] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2024-05-22 17:07:23] [INFO ] [Real]Added 75 Read/Feed constraints in 224 ms returned sat
[2024-05-22 17:07:23] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:07:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:07:24] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2024-05-22 17:07:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 411 ms returned sat
[2024-05-22 17:07:24] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:07:30] [INFO ] Added : 229 causal constraints over 47 iterations in 5879 ms. Result :sat
Minimization took 2885 ms.
[2024-05-22 17:07:33] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2024-05-22 17:07:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:07:34] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2024-05-22 17:07:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 17:07:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 4618 ms returned sat
[2024-05-22 17:07:38] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:07:51] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 2 ms to minimize.
[2024-05-22 17:07:51] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:07:51] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 2 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 2 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 2 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 6 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-22 17:07:52] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 3 ms to minimize.
[2024-05-22 17:07:53] [INFO ] Deduced a trap composed of 151 places in 159 ms of which 2 ms to minimize.
[2024-05-22 17:07:53] [INFO ] Deduced a trap composed of 145 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:07:53] [INFO ] Deduced a trap composed of 144 places in 149 ms of which 2 ms to minimize.
[2024-05-22 17:07:53] [INFO ] Deduced a trap composed of 160 places in 215 ms of which 2 ms to minimize.
[2024-05-22 17:07:54] [INFO ] Deduced a trap composed of 152 places in 250 ms of which 2 ms to minimize.
[2024-05-22 17:07:54] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 2 ms to minimize.
[2024-05-22 17:07:54] [INFO ] Deduced a trap composed of 163 places in 171 ms of which 2 ms to minimize.
[2024-05-22 17:07:54] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3419 ms
[2024-05-22 17:07:54] [INFO ] Added : 276 causal constraints over 56 iterations in 16059 ms. Result :sat
Minimization took 4500 ms.
[2024-05-22 17:07:59] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2024-05-22 17:08:00] [INFO ] [Real]Added 75 Read/Feed constraints in 785 ms returned sat
[2024-05-22 17:08:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:00] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2024-05-22 17:08:01] [INFO ] [Nat]Added 75 Read/Feed constraints in 687 ms returned sat
[2024-05-22 17:08:01] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-22 17:08:09] [INFO ] Added : 271 causal constraints over 55 iterations in 7470 ms. Result :sat
Minimization took 2721 ms.
[2024-05-22 17:08:12] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-22 17:08:12] [INFO ] [Real]Added 75 Read/Feed constraints in 526 ms returned sat
[2024-05-22 17:08:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:13] [INFO ] [Nat]Absence check using state equation in 310 ms returned sat
[2024-05-22 17:08:14] [INFO ] [Nat]Added 75 Read/Feed constraints in 1497 ms returned sat
[2024-05-22 17:08:14] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 25 ms.
[2024-05-22 17:08:31] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 2 ms to minimize.
[2024-05-22 17:08:31] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-05-22 17:08:32] [INFO ] Deduced a trap composed of 14 places in 126 ms of which 2 ms to minimize.
[2024-05-22 17:08:32] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 2 ms to minimize.
[2024-05-22 17:08:32] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-22 17:08:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1023 ms
[2024-05-22 17:08:32] [INFO ] Added : 362 causal constraints over 73 iterations in 17882 ms. Result :sat
Minimization took 3932 ms.
[2024-05-22 17:08:36] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2024-05-22 17:08:37] [INFO ] [Real]Added 75 Read/Feed constraints in 662 ms returned sat
[2024-05-22 17:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:38] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-22 17:08:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 452 ms returned sat
[2024-05-22 17:08:38] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 27 ms.
[2024-05-22 17:08:42] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 3 ms to minimize.
[2024-05-22 17:08:42] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 3 ms to minimize.
[2024-05-22 17:08:42] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-05-22 17:08:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 601 ms
[2024-05-22 17:08:42] [INFO ] Added : 171 causal constraints over 35 iterations in 3879 ms. Result :sat
Minimization took 1930 ms.
[2024-05-22 17:08:44] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2024-05-22 17:08:45] [INFO ] [Real]Added 75 Read/Feed constraints in 264 ms returned sat
[2024-05-22 17:08:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:08:45] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-22 17:08:45] [INFO ] [Nat]Added 75 Read/Feed constraints in 114 ms returned sat
[2024-05-22 17:08:45] [INFO ] Computed and/alt/rep : 388/2310/388 causal constraints (skipped 65 transitions) in 26 ms.
[2024-05-22 17:08:46] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-22 17:08:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2024-05-22 17:08:46] [INFO ] Added : 55 causal constraints over 13 iterations in 765 ms. Result :sat
Minimization took 551 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 15 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 444/444 places, 454/454 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 444 /444 variables (removed 0) and now considering 454/454 (removed 0) transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:10:36] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 17:10:36] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:10:36] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 17:10:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 17:10:40] [INFO ] Implicit Places using invariants and state equation in 4000 ms returned []
Implicit Place search using SMT with State Equation took 4267 ms to find 0 implicit places.
[2024-05-22 17:10:40] [INFO ] Redundant transitions in 32 ms returned []
Running 453 sub problems to find dead transitions.
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:10:40] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 17:10:40] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 454/897 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 75/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/897 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1/898 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/898 variables, and 519 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30044 ms.
Refiners :[State Equation: 444/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (OVERLAPS) 454/897 variables, 443/443 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 75/518 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/897 variables, 453/971 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/898 variables, and 971 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30017 ms.
Refiners :[State Equation: 443/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64706 ms. Remains : 444/444 places, 454/454 transitions.
Found an invariant !
This invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {26=1, 39=1, 111=1, 249=1, 254=1, 371=1, 390=1, 428=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 1228 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40000 steps (5110 resets) in 1541 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (317 resets) in 124 ms. (32 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (330 resets) in 173 ms. (23 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (347 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (344 resets) in 70 ms. (56 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (337 resets) in 69 ms. (57 steps per ms) remains 15/15 properties
[2024-05-22 17:21:42] [INFO ] Flatten gal took : 250 ms
BEST_FIRST walk for 4001 steps (340 resets) in 72 ms. (54 steps per ms) remains 15/15 properties
[2024-05-22 17:21:42] [INFO ] Flatten gal took : 82 ms
BEST_FIRST walk for 4004 steps (344 resets) in 88 ms. (44 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (333 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (331 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
[2024-05-22 17:21:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11656133834635964360.gal : 37 ms
[2024-05-22 17:21:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality833613526133623968.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/ReachabilityCardinality11656133834635964360.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality833613526133623968.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
BEST_FIRST walk for 4002 steps (332 resets) in 98 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (344 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (323 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (323 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (330 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (316 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality833613526133623968.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :6 after 11
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :11 after 22
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :22 after 41
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :41 after 81
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :81 after 262
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :262 after 752
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :752 after 5260
Invariant property MIN6 does not hold.
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :5260 after 41717
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :41717 after 94891
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :94891 after 212070
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :212070 after 455101
Invariant property MIN14 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,12 properties remain. new max is 16384
SDD size :455101 after 1.81696e+07
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :1.81696e+07 after 1.14291e+08
Interrupted probabilistic random walk after 159092 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :1 out of 15
Probabilistic random walk after 159092 steps, saw 79566 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :1
// Phase 1: matrix 454 rows 444 cols
[2024-05-22 17:21:45] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 17:21:45] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 263/323 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 345/668 variables, 197/314 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/668 variables, 35/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 148/816 variables, 97/446 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 15/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 65536
SDD size :1.14291e+08 after 4.56058e+08
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 66/882 variables, 36/497 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 7/504 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/882 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 16/898 variables, 15/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/898 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/898 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 898/898 variables, and 519 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1212 ms.
Refiners :[State Equation: 444/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 263/323 variables, 87/100 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 345/668 variables, 197/326 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/668 variables, 35/361 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 148/816 variables, 97/458 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/816 variables, 15/473 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/816 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 66/882 variables, 36/509 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/882 variables, 7/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/882 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 12 unsolved
SDD proceeding with computation,12 properties remain. new max is 131072
SDD size :4.56058e+08 after 1.56066e+09
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/898 variables, and 531 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5012 ms.
Refiners :[State Equation: 444/444 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 6264ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 454/454 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 442 transition count 452
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 442 transition count 449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 439 transition count 449
Applied a total of 10 rules in 22 ms. Remains 439 /444 variables (removed 5) and now considering 449/454 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 439/444 places, 449/454 transitions.
RANDOM walk for 40000 steps (4952 resets) in 192 ms. (207 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3301 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3298 resets) in 179 ms. (222 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3357 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3347 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3282 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3353 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3353 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3290 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3331 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3355 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3350 resets) in 136 ms. (291 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3359 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 181473 steps, run timeout after 3002 ms. (steps per millisecond=60 ) properties seen :0 out of 12
Probabilistic random walk after 181473 steps, saw 90756 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 449 rows 439 cols
[2024-05-22 17:21:55] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 17:21:55] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 286/346 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 17/121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 414/760 variables, 231/352 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 42/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 128/888 variables, 105/499 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/888 variables, 15/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/888 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 888/888 variables, and 514 constraints, problems are : Problem set: 0 solved, 12 unsolved in 896 ms.
Refiners :[State Equation: 439/439 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 286/346 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 17/121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 12/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/346 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 414/760 variables, 231/364 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/760 variables, 42/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/760 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 128/888 variables, 105/511 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/888 variables, 15/526 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:22:01] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2024-05-22 17:22:01] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-22 17:22:01] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 2 ms to minimize.
[2024-05-22 17:22:01] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 65 places in 1313 ms of which 2 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 1 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-22 17:22:03] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 1 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 1 ms to minimize.
[2024-05-22 17:22:04] [INFO ] Deduced a trap composed of 22 places in 115 ms of which 2 ms to minimize.
[2024-05-22 17:22:05] [INFO ] Deduced a trap composed of 20 places in 113 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 262144
SDD size :1.56066e+09 after 4.94121e+09
[2024-05-22 17:22:05] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/888 variables, 16/542 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:22:06] [INFO ] Deduced a trap composed of 168 places in 183 ms of which 2 ms to minimize.
[2024-05-22 17:22:06] [INFO ] Deduced a trap composed of 159 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:22:06] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-22 17:22:07] [INFO ] Deduced a trap composed of 65 places in 50 ms of which 1 ms to minimize.
[2024-05-22 17:22:07] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/888 variables, 5/547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/888 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:22:08] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/888 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/888 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 0/888 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 888/888 variables, and 548 constraints, problems are : Problem set: 0 solved, 12 unsolved in 14513 ms.
Refiners :[State Equation: 439/439 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 22/22 constraints]
After SMT, in 15461ms problems are : Problem set: 0 solved, 12 unsolved
Detected timeout of ITS tools.
[2024-05-22 17:22:32] [INFO ] Flatten gal took : 87 ms
[2024-05-22 17:22:32] [INFO ] Applying decomposition
[2024-05-22 17:22:32] [INFO ] Flatten gal took : 136 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/graph3216311901339827681.txt' '-o' '/tmp/graph3216311901339827681.bin' '-w' '/tmp/graph3216311901339827681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3216311901339827681.bin' '-l' '-1' '-v' '-w' '/tmp/graph3216311901339827681.weights' '-q' '0' '-e' '0.001'
[2024-05-22 17:22:33] [INFO ] Decomposing Gal with order
[2024-05-22 17:22:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 17:22:33] [INFO ] Removed a total of 195 redundant transitions.
[2024-05-22 17:22:33] [INFO ] Flatten gal took : 324 ms
[2024-05-22 17:22:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 61 ms.
[2024-05-22 17:22:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16046338756565306882.gal : 28 ms
[2024-05-22 17:22:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7970528021028817980.prop : 5 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/ReachabilityCardinality16046338756565306882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7970528021028817980.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/ReachabilityCardinality7970528021028817980.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :11 after 40
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :40 after 50
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :50 after 83
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :83 after 142
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :142 after 250
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :250 after 262
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :262 after 354
Parikh walk visited 0 properties in 30001 ms.
Support contains 12 out of 439 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 449/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 439 /439 variables (removed 0) and now considering 449/449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 439/439 places, 449/449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 439/439 places, 449/449 transitions.
Applied a total of 0 rules in 8 ms. Remains 439 /439 variables (removed 0) and now considering 449/449 (removed 0) transitions.
// Phase 1: matrix 449 rows 439 cols
[2024-05-22 17:22:41] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 17:22:41] [INFO ] Implicit Places using invariants in 704 ms returned []
// Phase 1: matrix 449 rows 439 cols
[2024-05-22 17:22:41] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 17:22:42] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 17:22:47] [INFO ] Implicit Places using invariants and state equation in 5931 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6637 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 438/439 places, 449/449 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 438 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 437 transition count 448
Applied a total of 2 rules in 24 ms. Remains 437 /438 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:22:47] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 17:22:48] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:22:48] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 17:22:48] [INFO ] State equation strengthened by 75 read => feed constraints.
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :354 after 1689
[2024-05-22 17:22:56] [INFO ] Implicit Places using invariants and state equation in 8482 ms returned []
Implicit Place search using SMT with State Equation took 8825 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 437/439 places, 448/449 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 15495 ms. Remains : 437/439 places, 448/449 transitions.
RANDOM walk for 40000 steps (5022 resets) in 223 ms. (178 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3274 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3266 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3343 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3375 resets) in 123 ms. (322 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3321 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (3389 resets) in 138 ms. (287 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3286 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3318 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (3359 resets) in 194 ms. (205 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (3314 resets) in 135 ms. (294 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3335 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (3329 resets) in 130 ms. (305 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 177952 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 12
Probabilistic random walk after 177952 steps, saw 88995 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:23:00] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 17:23:00] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 284/344 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 410/754 variables, 228/348 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/754 variables, 42/390 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 131/885 variables, 107/497 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/885 variables, 15/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/885 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 885/885 variables, and 512 constraints, problems are : Problem set: 0 solved, 12 unsolved in 939 ms.
Refiners :[State Equation: 437/437 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 284/344 variables, 90/103 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/344 variables, 17/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/344 variables, 12/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/344 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 410/754 variables, 228/360 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 42/402 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/754 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 131/885 variables, 107/509 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/885 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 15 ms to minimize.
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 147 places in 155 ms of which 2 ms to minimize.
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 1 ms to minimize.
[2024-05-22 17:23:06] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 2 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 1 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 2 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 140 places in 150 ms of which 3 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 136 places in 157 ms of which 2 ms to minimize.
[2024-05-22 17:23:07] [INFO ] Deduced a trap composed of 122 places in 139 ms of which 2 ms to minimize.
[2024-05-22 17:23:08] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2024-05-22 17:23:08] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-22 17:23:08] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-05-22 17:23:08] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-22 17:23:08] [INFO ] Deduced a trap composed of 154 places in 153 ms of which 2 ms to minimize.
[2024-05-22 17:23:09] [INFO ] Deduced a trap composed of 130 places in 149 ms of which 3 ms to minimize.
[2024-05-22 17:23:09] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/885 variables, 20/544 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:23:12] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 1 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-22 17:23:13] [INFO ] Deduced a trap composed of 117 places in 94 ms of which 1 ms to minimize.
[2024-05-22 17:23:14] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-05-22 17:23:14] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 2 ms to minimize.
[2024-05-22 17:23:15] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 2 ms to minimize.
[2024-05-22 17:23:15] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 3 ms to minimize.
[2024-05-22 17:23:15] [INFO ] Deduced a trap composed of 147 places in 156 ms of which 3 ms to minimize.
[2024-05-22 17:23:16] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 3 ms to minimize.
[2024-05-22 17:23:16] [INFO ] Deduced a trap composed of 138 places in 147 ms of which 3 ms to minimize.
[2024-05-22 17:23:16] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 2 ms to minimize.
[2024-05-22 17:23:16] [INFO ] Deduced a trap composed of 155 places in 151 ms of which 2 ms to minimize.
[2024-05-22 17:23:16] [INFO ] Deduced a trap composed of 145 places in 154 ms of which 2 ms to minimize.
Detected timeout of ITS tools.
At refinement iteration 14 (INCLUDED_ONLY) 0/885 variables, 20/564 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 17:23:26] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 3 ms to minimize.
[2024-05-22 17:23:26] [INFO ] Deduced a trap composed of 144 places in 131 ms of which 2 ms to minimize.
[2024-05-22 17:23:26] [INFO ] Deduced a trap composed of 150 places in 137 ms of which 3 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 0 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 0 ms to minimize.
[2024-05-22 17:23:27] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/885 variables, 9/573 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/885 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/885 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 885/885 variables, and 573 constraints, problems are : Problem set: 0 solved, 12 unsolved in 30679 ms.
Refiners :[State Equation: 437/437 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 49/49 constraints]
After SMT, in 31661ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 12 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 437 /437 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 437/437 places, 448/448 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 448/448 transitions.
Applied a total of 0 rules in 8 ms. Remains 437 /437 variables (removed 0) and now considering 448/448 (removed 0) transitions.
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:24:02] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 17:24:02] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:24:02] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 17:24:02] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-22 17:24:10] [INFO ] Implicit Places using invariants and state equation in 8175 ms returned []
Implicit Place search using SMT with State Equation took 8442 ms to find 0 implicit places.
[2024-05-22 17:24:10] [INFO ] Redundant transitions in 7 ms returned []
Running 447 sub problems to find dead transitions.
// Phase 1: matrix 448 rows 437 cols
[2024-05-22 17:24:10] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 17:24:10] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 448/884 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 75/511 constraints. Problems are: Problem set: 0 solved, 447 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/884 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (OVERLAPS) 1/885 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/885 variables, and 512 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30020 ms.
Refiners :[State Equation: 437/437 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 448/884 variables, 436/436 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/884 variables, 75/511 constraints. Problems are: Problem set: 0 solved, 447 unsolved

BK_TIME_CONFINEMENT_REACHED

--------------------
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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r136-tall-171631132900565"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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