About the Execution of ITS-Tools for EisenbergMcGuire-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16207.651 | 2735023.00 | 3094200.00 | 12417.80 | 1 ? ? 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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.r158-smll-171636266400197.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 EisenbergMcGuire-PT-09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266400197
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K 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.8K 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 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716557033942
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 13:23:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:23:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:23:57] [INFO ] Load time of PNML (sax parser for PT used): 747 ms
[2024-05-24 13:23:57] [INFO ] Transformed 891 places.
[2024-05-24 13:23:57] [INFO ] Transformed 3888 transitions.
[2024-05-24 13:23:57] [INFO ] Found NUPN structural information;
[2024-05-24 13:23:57] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 1068 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 20 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 13:23:57] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2024-05-24 13:23:57] [INFO ] Computed 28 invariants in 57 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 127 ms. (78 steps per ms)
FORMULA EisenbergMcGuire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (16 resets) in 163 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 13:23:58] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2024-05-24 13:23:58] [INFO ] Invariant cache hit.
[2024-05-24 13:23:59] [INFO ] [Real]Absence check using 19 positive place invariants in 47 ms returned sat
[2024-05-24 13:23:59] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 13:23:59] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2024-05-24 13:24:00] [INFO ] State equation strengthened by 932 read => feed constraints.
[2024-05-24 13:24:00] [INFO ] [Real]Added 932 Read/Feed constraints in 222 ms returned sat
[2024-05-24 13:24:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 31 ms returned sat
[2024-05-24 13:24:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:24:01] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2024-05-24 13:24:01] [INFO ] [Nat]Added 932 Read/Feed constraints in 163 ms returned sat
[2024-05-24 13:24:02] [INFO ] Deduced a trap composed of 84 places in 1003 ms of which 124 ms to minimize.
[2024-05-24 13:24:03] [INFO ] Deduced a trap composed of 50 places in 1055 ms of which 10 ms to minimize.
[2024-05-24 13:24:04] [INFO ] Deduced a trap composed of 47 places in 624 ms of which 8 ms to minimize.
[2024-05-24 13:24:05] [INFO ] Deduced a trap composed of 3 places in 474 ms of which 5 ms to minimize.
[2024-05-24 13:24:05] [INFO ] Deduced a trap composed of 41 places in 576 ms of which 6 ms to minimize.
[2024-05-24 13:24:05] [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-24 13:24:06] [INFO ] [Real]Absence check using 19 positive place invariants in 37 ms returned sat
[2024-05-24 13:24:06] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:24:06] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2024-05-24 13:24:07] [INFO ] [Real]Added 932 Read/Feed constraints in 234 ms returned sat
[2024-05-24 13:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 49 ms returned sat
[2024-05-24 13:24:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:24:08] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-24 13:24:08] [INFO ] [Nat]Added 932 Read/Feed constraints in 200 ms returned sat
[2024-05-24 13:24:09] [INFO ] Deduced a trap composed of 39 places in 586 ms of which 7 ms to minimize.
[2024-05-24 13:24:09] [INFO ] Deduced a trap composed of 43 places in 652 ms of which 8 ms to minimize.
[2024-05-24 13:24:10] [INFO ] Deduced a trap composed of 3 places in 756 ms of which 6 ms to minimize.
[2024-05-24 13:24:11] [INFO ] Deduced a trap composed of 3 places in 892 ms of which 9 ms to minimize.
[2024-05-24 13:24:12] [INFO ] Deduced a trap composed of 81 places in 871 ms of which 10 ms to minimize.
[2024-05-24 13:24:12] [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 1
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-24 13:24:13] [INFO ] [Real]Absence check using 19 positive place invariants in 41 ms returned sat
[2024-05-24 13:24:13] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 13:24:13] [INFO ] [Real]Absence check using state equation in 786 ms returned sat
[2024-05-24 13:24:14] [INFO ] [Real]Added 932 Read/Feed constraints in 253 ms returned sat
[2024-05-24 13:24:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2024-05-24 13:24:14] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:24:15] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2024-05-24 13:24:15] [INFO ] [Nat]Added 932 Read/Feed constraints in 156 ms returned sat
[2024-05-24 13:24:16] [INFO ] Deduced a trap composed of 8 places in 895 ms of which 8 ms to minimize.
[2024-05-24 13:24:17] [INFO ] Deduced a trap composed of 3 places in 825 ms of which 8 ms to minimize.
[2024-05-24 13:24:18] [INFO ] Deduced a trap composed of 77 places in 888 ms of which 8 ms to minimize.
[2024-05-24 13:24:19] [INFO ] Deduced a trap composed of 3 places in 893 ms of which 8 ms to minimize.
[2024-05-24 13:24:19] [INFO ] Deduced a trap composed of 33 places in 688 ms of which 6 ms to minimize.
[2024-05-24 13:24:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 13:24:20] [INFO ] [Real]Absence check using 19 positive place invariants in 28 ms returned sat
[2024-05-24 13:24:20] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:24:20] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-24 13:24:21] [INFO ] [Real]Added 932 Read/Feed constraints in 193 ms returned sat
[2024-05-24 13:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 28 ms returned sat
[2024-05-24 13:24:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:24:22] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-24 13:24:22] [INFO ] [Nat]Added 932 Read/Feed constraints in 254 ms returned sat
[2024-05-24 13:24:23] [INFO ] Deduced a trap composed of 3 places in 749 ms of which 8 ms to minimize.
[2024-05-24 13:24:24] [INFO ] Deduced a trap composed of 3 places in 997 ms of which 12 ms to minimize.
[2024-05-24 13:24:25] [INFO ] Deduced a trap composed of 56 places in 972 ms of which 11 ms to minimize.
[2024-05-24 13:24:26] [INFO ] Deduced a trap composed of 38 places in 1038 ms of which 10 ms to minimize.
[2024-05-24 13:24:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 13:24:26] [INFO ] [Real]Absence check using 19 positive place invariants in 41 ms returned sat
[2024-05-24 13:24:26] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 13:24:27] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2024-05-24 13:24:28] [INFO ] [Real]Added 932 Read/Feed constraints in 252 ms returned sat
[2024-05-24 13:24:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:28] [INFO ] [Nat]Absence check using 19 positive place invariants in 48 ms returned sat
[2024-05-24 13:24:28] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 13:24:29] [INFO ] [Nat]Absence check using state equation in 904 ms returned sat
[2024-05-24 13:24:29] [INFO ] [Nat]Added 932 Read/Feed constraints in 224 ms returned sat
[2024-05-24 13:24:31] [INFO ] Deduced a trap composed of 3 places in 1373 ms of which 14 ms to minimize.
[2024-05-24 13:24:32] [INFO ] Deduced a trap composed of 3 places in 1394 ms of which 13 ms to minimize.
[2024-05-24 13:24:33] [INFO ] Deduced a trap composed of 3 places in 1082 ms of which 9 ms to minimize.
[2024-05-24 13:24:33] [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-24 13:24:34] [INFO ] [Real]Absence check using 19 positive place invariants in 43 ms returned sat
[2024-05-24 13:24:34] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 12 ms returned sat
[2024-05-24 13:24:34] [INFO ] [Real]Absence check using state equation in 697 ms returned sat
[2024-05-24 13:24:35] [INFO ] [Real]Added 932 Read/Feed constraints in 301 ms returned sat
[2024-05-24 13:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:35] [INFO ] [Nat]Absence check using 19 positive place invariants in 47 ms returned sat
[2024-05-24 13:24:35] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-24 13:24:36] [INFO ] [Nat]Absence check using state equation in 852 ms returned sat
[2024-05-24 13:24:36] [INFO ] [Nat]Added 932 Read/Feed constraints in 304 ms returned sat
[2024-05-24 13:24:37] [INFO ] Deduced a trap composed of 3 places in 963 ms of which 9 ms to minimize.
[2024-05-24 13:24:38] [INFO ] Deduced a trap composed of 3 places in 891 ms of which 9 ms to minimize.
[2024-05-24 13:24:39] [INFO ] Deduced a trap composed of 42 places in 906 ms of which 9 ms to minimize.
[2024-05-24 13:24:40] [INFO ] Deduced a trap composed of 45 places in 772 ms of which 8 ms to minimize.
[2024-05-24 13:24:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 13:24:41] [INFO ] [Real]Absence check using 19 positive place invariants in 45 ms returned sat
[2024-05-24 13:24:41] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-24 13:24:41] [INFO ] [Real]Absence check using state equation in 899 ms returned sat
[2024-05-24 13:24:42] [INFO ] [Real]Added 932 Read/Feed constraints in 179 ms returned sat
[2024-05-24 13:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 29 ms returned sat
[2024-05-24 13:24:42] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:24:43] [INFO ] [Nat]Absence check using state equation in 667 ms returned sat
[2024-05-24 13:24:43] [INFO ] [Nat]Added 932 Read/Feed constraints in 255 ms returned sat
[2024-05-24 13:24:44] [INFO ] Deduced a trap composed of 3 places in 1019 ms of which 11 ms to minimize.
[2024-05-24 13:24:45] [INFO ] Deduced a trap composed of 6 places in 1032 ms of which 13 ms to minimize.
[2024-05-24 13:24:46] [INFO ] Deduced a trap composed of 3 places in 981 ms of which 12 ms to minimize.
[2024-05-24 13:24:47] [INFO ] Deduced a trap composed of 3 places in 1106 ms of which 12 ms to minimize.
[2024-05-24 13:24:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-24 13:24:48] [INFO ] [Real]Absence check using 19 positive place invariants in 46 ms returned sat
[2024-05-24 13:24:48] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 13 ms returned sat
[2024-05-24 13:24:49] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2024-05-24 13:24:49] [INFO ] [Real]Added 932 Read/Feed constraints in 285 ms returned sat
[2024-05-24 13:24:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:24:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 42 ms returned sat
[2024-05-24 13:24:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 13:24:50] [INFO ] [Nat]Absence check using state equation in 829 ms returned sat
[2024-05-24 13:24:51] [INFO ] [Nat]Added 932 Read/Feed constraints in 232 ms returned sat
[2024-05-24 13:24:52] [INFO ] Deduced a trap composed of 3 places in 1018 ms of which 11 ms to minimize.
[2024-05-24 13:24:53] [INFO ] Deduced a trap composed of 67 places in 1062 ms of which 11 ms to minimize.
[2024-05-24 13:24:54] [INFO ] Deduced a trap composed of 3 places in 1080 ms of which 11 ms to minimize.
[2024-05-24 13:24:55] [INFO ] Deduced a trap composed of 3 places in 978 ms of which 11 ms to minimize.
[2024-05-24 13:24:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 882 transition count 3628
Deduced a syphon composed of 251 places in 10 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 631 transition count 3628
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 592 place count 559 transition count 2980
Iterating global reduction 2 with 72 rules applied. Total rules applied 664 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 11 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 808 place count 487 transition count 2908
Applied a total of 808 rules in 858 ms. Remains 487 /891 variables (removed 404) and now considering 2908/3888 (removed 980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 878 ms. Remains : 487/891 places, 2908/3888 transitions.
[2024-05-24 13:24:56] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 13:24:56] [INFO ] Computed 28 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3012 ms. (331 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 5146 ms. (1554 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-24 13:25:04] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 13:25:04] [INFO ] Invariant cache hit.
[2024-05-24 13:25:04] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:25:04] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 13:25:05] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-05-24 13:25:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:25:05] [INFO ] [Real]Added 356 Read/Feed constraints in 119 ms returned sat
[2024-05-24 13:25:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:25:05] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:25:06] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-05-24 13:25:06] [INFO ] [Nat]Added 356 Read/Feed constraints in 99 ms returned sat
[2024-05-24 13:25:06] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 6 ms to minimize.
[2024-05-24 13:25:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2024-05-24 13:25:06] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 252 ms.
[2024-05-24 13:25:08] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 3 ms to minimize.
[2024-05-24 13:25:08] [INFO ] Deduced a trap composed of 3 places in 217 ms of which 2 ms to minimize.
[2024-05-24 13:25:08] [INFO ] Deduced a trap composed of 26 places in 142 ms of which 2 ms to minimize.
[2024-05-24 13:25:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 865 ms
[2024-05-24 13:25:09] [INFO ] Added : 92 causal constraints over 19 iterations in 2712 ms. Result :sat
Minimization took 396 ms.
[2024-05-24 13:25:09] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:25:09] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:10] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2024-05-24 13:25:10] [INFO ] [Real]Added 356 Read/Feed constraints in 96 ms returned sat
[2024-05-24 13:25:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-24 13:25:10] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:25:10] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2024-05-24 13:25:10] [INFO ] [Nat]Added 356 Read/Feed constraints in 78 ms returned sat
[2024-05-24 13:25:11] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 159 ms.
[2024-05-24 13:25:12] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-24 13:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-24 13:25:12] [INFO ] Added : 102 causal constraints over 21 iterations in 1879 ms. Result :sat
Minimization took 442 ms.
[2024-05-24 13:25:13] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-24 13:25:13] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:25:13] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-24 13:25:13] [INFO ] [Real]Added 356 Read/Feed constraints in 74 ms returned sat
[2024-05-24 13:25:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:25:13] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:25:14] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-24 13:25:14] [INFO ] [Nat]Added 356 Read/Feed constraints in 64 ms returned sat
[2024-05-24 13:25:14] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-24 13:25:14] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 13:25:14] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-24 13:25:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 430 ms
[2024-05-24 13:25:14] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 141 ms.
[2024-05-24 13:25:16] [INFO ] Added : 104 causal constraints over 21 iterations in 1473 ms. Result :sat
Minimization took 347 ms.
[2024-05-24 13:25:16] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:25:16] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:17] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2024-05-24 13:25:17] [INFO ] [Real]Added 356 Read/Feed constraints in 127 ms returned sat
[2024-05-24 13:25:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:18] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-05-24 13:25:18] [INFO ] [Nat]Added 356 Read/Feed constraints in 95 ms returned sat
[2024-05-24 13:25:18] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2024-05-24 13:25:18] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 13:25:18] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 13:25:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 536 ms
[2024-05-24 13:25:18] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 153 ms.
[2024-05-24 13:25:20] [INFO ] Added : 72 causal constraints over 15 iterations in 1437 ms. Result :sat
Minimization took 492 ms.
[2024-05-24 13:25:20] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:20] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:25:21] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-24 13:25:21] [INFO ] [Real]Added 356 Read/Feed constraints in 134 ms returned sat
[2024-05-24 13:25:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:22] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-24 13:25:22] [INFO ] [Nat]Added 356 Read/Feed constraints in 119 ms returned sat
[2024-05-24 13:25:22] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 5 ms to minimize.
[2024-05-24 13:25:23] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 3 ms to minimize.
[2024-05-24 13:25:23] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 3 ms to minimize.
[2024-05-24 13:25:23] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 3 ms to minimize.
[2024-05-24 13:25:24] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-05-24 13:25:24] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 3 ms to minimize.
[2024-05-24 13:25:24] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 3 ms to minimize.
[2024-05-24 13:25:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2393 ms
[2024-05-24 13:25:24] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 159 ms.
[2024-05-24 13:25:27] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-05-24 13:25:27] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-24 13:25:27] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 2 ms to minimize.
[2024-05-24 13:25:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 738 ms
[2024-05-24 13:25:27] [INFO ] Added : 121 causal constraints over 25 iterations in 3173 ms. Result :sat
Minimization took 510 ms.
[2024-05-24 13:25:28] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2024-05-24 13:25:28] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:28] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-05-24 13:25:29] [INFO ] [Real]Added 356 Read/Feed constraints in 114 ms returned sat
[2024-05-24 13:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:25:29] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2024-05-24 13:25:29] [INFO ] [Nat]Added 356 Read/Feed constraints in 100 ms returned sat
[2024-05-24 13:25:30] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 156 ms.
[2024-05-24 13:25:30] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-24 13:25:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2024-05-24 13:25:31] [INFO ] Added : 49 causal constraints over 11 iterations in 1341 ms. Result :sat
Minimization took 490 ms.
[2024-05-24 13:25:31] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:31] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 13:25:32] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2024-05-24 13:25:32] [INFO ] [Real]Added 356 Read/Feed constraints in 123 ms returned sat
[2024-05-24 13:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 27 ms returned sat
[2024-05-24 13:25:32] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:33] [INFO ] [Nat]Absence check using state equation in 451 ms returned sat
[2024-05-24 13:25:33] [INFO ] [Nat]Added 356 Read/Feed constraints in 136 ms returned sat
[2024-05-24 13:25:33] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 5 ms to minimize.
[2024-05-24 13:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2024-05-24 13:25:33] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 157 ms.
[2024-05-24 13:25:35] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2024-05-24 13:25:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 373 ms
[2024-05-24 13:25:35] [INFO ] Added : 86 causal constraints over 18 iterations in 2100 ms. Result :sat
Minimization took 494 ms.
[2024-05-24 13:25:36] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:36] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:36] [INFO ] [Real]Absence check using state equation in 394 ms returned sat
[2024-05-24 13:25:37] [INFO ] [Real]Added 356 Read/Feed constraints in 125 ms returned sat
[2024-05-24 13:25:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:25:37] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:25:37] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2024-05-24 13:25:37] [INFO ] [Nat]Added 356 Read/Feed constraints in 113 ms returned sat
[2024-05-24 13:25:37] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 152 ms.
[2024-05-24 13:25:39] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 2 ms to minimize.
[2024-05-24 13:25:39] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 2 ms to minimize.
[2024-05-24 13:25:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-05-24 13:25:40] [INFO ] Added : 91 causal constraints over 19 iterations in 2262 ms. Result :sat
Minimization took 496 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 162 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 486/487 places, 2907/2908 transitions.
[2024-05-24 13:25:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:25:43] [INFO ] Computed 28 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2705 ms. (369 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3840 ms. (1562 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2024-05-24 13:25:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:25:49] [INFO ] Invariant cache hit.
[2024-05-24 13:25:50] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:50] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:50] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
[2024-05-24 13:25:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:25:50] [INFO ] [Real]Added 356 Read/Feed constraints in 150 ms returned sat
[2024-05-24 13:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:25:51] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2024-05-24 13:25:51] [INFO ] [Nat]Added 356 Read/Feed constraints in 120 ms returned sat
[2024-05-24 13:25:51] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2024-05-24 13:25:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2024-05-24 13:25:51] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 147 ms.
[2024-05-24 13:25:53] [INFO ] Added : 80 causal constraints over 16 iterations in 1486 ms. Result :sat
Minimization took 400 ms.
[2024-05-24 13:25:53] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2024-05-24 13:25:53] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:54] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2024-05-24 13:25:54] [INFO ] [Real]Added 356 Read/Feed constraints in 84 ms returned sat
[2024-05-24 13:25:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:25:54] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:25:54] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2024-05-24 13:25:55] [INFO ] [Nat]Added 356 Read/Feed constraints in 97 ms returned sat
[2024-05-24 13:25:55] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-05-24 13:25:55] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-05-24 13:25:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2024-05-24 13:25:55] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 106 ms.
[2024-05-24 13:25:56] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-05-24 13:25:56] [INFO ] Deduced a trap composed of 31 places in 148 ms of which 2 ms to minimize.
[2024-05-24 13:25:57] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2024-05-24 13:25:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 692 ms
[2024-05-24 13:25:57] [INFO ] Added : 70 causal constraints over 15 iterations in 1947 ms. Result :sat
Minimization took 457 ms.
[2024-05-24 13:25:57] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2024-05-24 13:25:57] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2024-05-24 13:25:58] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2024-05-24 13:25:58] [INFO ] [Real]Added 356 Read/Feed constraints in 90 ms returned sat
[2024-05-24 13:25:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:25:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2024-05-24 13:25:58] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:25:58] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-24 13:25:58] [INFO ] [Nat]Added 356 Read/Feed constraints in 84 ms returned sat
[2024-05-24 13:25:59] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-05-24 13:25:59] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-24 13:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 332 ms
[2024-05-24 13:25:59] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 109 ms.
[2024-05-24 13:26:00] [INFO ] Added : 66 causal constraints over 14 iterations in 1058 ms. Result :sat
Minimization took 376 ms.
[2024-05-24 13:26:00] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:26:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2024-05-24 13:26:01] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2024-05-24 13:26:01] [INFO ] [Real]Added 356 Read/Feed constraints in 115 ms returned sat
[2024-05-24 13:26:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:26:01] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:26:02] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2024-05-24 13:26:02] [INFO ] [Nat]Added 356 Read/Feed constraints in 113 ms returned sat
[2024-05-24 13:26:02] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-05-24 13:26:02] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 2 ms to minimize.
[2024-05-24 13:26:02] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-24 13:26:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 550 ms
[2024-05-24 13:26:02] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 149 ms.
[2024-05-24 13:26:04] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 2 ms to minimize.
[2024-05-24 13:26:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 315 ms
[2024-05-24 13:26:05] [INFO ] Added : 102 causal constraints over 21 iterations in 2267 ms. Result :sat
Minimization took 453 ms.
[2024-05-24 13:26:05] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:26:05] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:26:06] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-05-24 13:26:06] [INFO ] [Real]Added 356 Read/Feed constraints in 131 ms returned sat
[2024-05-24 13:26:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:26:06] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:26:07] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-24 13:26:07] [INFO ] [Nat]Added 356 Read/Feed constraints in 103 ms returned sat
[2024-05-24 13:26:07] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 13:26:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2024-05-24 13:26:07] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 146 ms.
[2024-05-24 13:26:08] [INFO ] Added : 36 causal constraints over 8 iterations in 833 ms. Result :sat
Minimization took 366 ms.
[2024-05-24 13:26:08] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:26:08] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 16 ms returned sat
[2024-05-24 13:26:09] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-05-24 13:26:09] [INFO ] [Real]Added 356 Read/Feed constraints in 97 ms returned sat
[2024-05-24 13:26:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2024-05-24 13:26:09] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:26:09] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-24 13:26:09] [INFO ] [Nat]Added 356 Read/Feed constraints in 79 ms returned sat
[2024-05-24 13:26:10] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2024-05-24 13:26:10] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2024-05-24 13:26:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 354 ms
[2024-05-24 13:26:10] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 83 ms.
[2024-05-24 13:26:10] [INFO ] Added : 12 causal constraints over 3 iterations in 292 ms. Result :sat
Minimization took 361 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 133 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 486/486 places, 2907/2907 transitions.
[2024-05-24 13:26:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:26:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2676 ms. (373 steps per ms)
BEST_FIRST walk for 4000004 steps (8 resets) in 2536 ms. (1576 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-24 13:26:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:26:17] [INFO ] Invariant cache hit.
[2024-05-24 13:26:17] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:26:17] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 13:26:18] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-05-24 13:26:18] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:26:18] [INFO ] [Real]Added 356 Read/Feed constraints in 157 ms returned sat
[2024-05-24 13:26:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2024-05-24 13:26:18] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:26:19] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-24 13:26:19] [INFO ] [Nat]Added 356 Read/Feed constraints in 73 ms returned sat
[2024-05-24 13:26:19] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 13:26:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-24 13:26:19] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 86 ms.
[2024-05-24 13:26:20] [INFO ] Added : 80 causal constraints over 16 iterations in 977 ms. Result :sat
Minimization took 407 ms.
[2024-05-24 13:26:20] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:26:20] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:26:21] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-24 13:26:21] [INFO ] [Real]Added 356 Read/Feed constraints in 120 ms returned sat
[2024-05-24 13:26:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:26:21] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:26:22] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2024-05-24 13:26:22] [INFO ] [Nat]Added 356 Read/Feed constraints in 107 ms returned sat
[2024-05-24 13:26:22] [INFO ] Deduced a trap composed of 3 places in 167 ms of which 3 ms to minimize.
[2024-05-24 13:26:22] [INFO ] Deduced a trap composed of 3 places in 171 ms of which 2 ms to minimize.
[2024-05-24 13:26:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2024-05-24 13:26:22] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 142 ms.
[2024-05-24 13:26:24] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 3 ms to minimize.
[2024-05-24 13:26:24] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 3 ms to minimize.
[2024-05-24 13:26:24] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 2 ms to minimize.
[2024-05-24 13:26:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 973 ms
[2024-05-24 13:26:25] [INFO ] Added : 70 causal constraints over 15 iterations in 2484 ms. Result :sat
Minimization took 429 ms.
[2024-05-24 13:26:25] [INFO ] [Real]Absence check using 19 positive place invariants in 22 ms returned sat
[2024-05-24 13:26:25] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-24 13:26:26] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-24 13:26:26] [INFO ] [Real]Added 356 Read/Feed constraints in 119 ms returned sat
[2024-05-24 13:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:26:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:26:27] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-24 13:26:27] [INFO ] [Nat]Added 356 Read/Feed constraints in 103 ms returned sat
[2024-05-24 13:26:27] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 13:26:27] [INFO ] Deduced a trap composed of 25 places in 144 ms of which 2 ms to minimize.
[2024-05-24 13:26:27] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-05-24 13:26:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2024-05-24 13:26:27] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 145 ms.
[2024-05-24 13:26:29] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 2 ms to minimize.
[2024-05-24 13:26:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2024-05-24 13:26:29] [INFO ] Added : 102 causal constraints over 21 iterations in 2252 ms. Result :sat
Minimization took 426 ms.
[2024-05-24 13:26:30] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2024-05-24 13:26:30] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:26:30] [INFO ] [Real]Absence check using state equation in 405 ms returned sat
[2024-05-24 13:26:31] [INFO ] [Real]Added 356 Read/Feed constraints in 120 ms returned sat
[2024-05-24 13:26:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:26:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:26:31] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:26:31] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2024-05-24 13:26:31] [INFO ] [Nat]Added 356 Read/Feed constraints in 95 ms returned sat
[2024-05-24 13:26:31] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 13:26:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2024-05-24 13:26:32] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 144 ms.
[2024-05-24 13:26:32] [INFO ] Added : 36 causal constraints over 8 iterations in 829 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 108 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 108 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:26:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:26:34] [INFO ] Invariant cache hit.
[2024-05-24 13:26:35] [INFO ] Implicit Places using invariants in 767 ms returned []
[2024-05-24 13:26:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:26:35] [INFO ] Invariant cache hit.
[2024-05-24 13:26:35] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:26:39] [INFO ] Implicit Places using invariants and state equation in 4018 ms returned []
Implicit Place search using SMT with State Equation took 4790 ms to find 0 implicit places.
[2024-05-24 13:26:39] [INFO ] Redundant transitions in 352 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:26:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:26:39] [INFO ] Invariant cache hit.
[2024-05-24 13:26:39] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32917ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 33026ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38338 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 3361 ms. (11 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
[2024-05-24 13:27:14] [INFO ] Flatten gal took : 954 ms
[2024-05-24 13:27:15] [INFO ] Flatten gal took : 451 ms
[2024-05-24 13:27:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3328652419394664771.gal : 145 ms
[2024-05-24 13:27:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8710588086029364861.prop : 2 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/ReachabilityCardinality3328652419394664771.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8710588086029364861.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8710588086029364861.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :30 after 60
Interrupted probabilistic random walk after 118630 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :2 out of 8
Probabilistic random walk after 118630 steps, saw 80825 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :2
[2024-05-24 13:27:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:17] [INFO ] Invariant cache hit.
[2024-05-24 13:27:17] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :60 after 91
At refinement iteration 1 (OVERLAPS) 150/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/159 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :91 after 280
[2024-05-24 13:27:17] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 2 ms to minimize.
[2024-05-24 13:27:17] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :280 after 395
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-24 13:27:18] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 276/435 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 24/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 105/540 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 33/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 144/684 variables, 66/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 33/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/684 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 240/924 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/924 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 12/936 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :395 after 1330
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 378/1314 variables, 252/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 266/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 878 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3012 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/159 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 276/435 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 24/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 105/540 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 33/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 144/684 variables, 66/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 33/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/684 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 240/924 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/924 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 12/936 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 13:27:21] [INFO ] Deduced a trap composed of 57 places in 208 ms of which 3 ms to minimize.
[2024-05-24 13:27:22] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :1330 after 5100
[2024-05-24 13:27:22] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 4 ms to minimize.
[2024-05-24 13:27:22] [INFO ] Deduced a trap composed of 18 places in 180 ms of which 3 ms to minimize.
[2024-05-24 13:27:22] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 3 ms to minimize.
[2024-05-24 13:27:23] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 4 ms to minimize.
[2024-05-24 13:27:23] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 3 ms to minimize.
[2024-05-24 13:27:23] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 3 ms to minimize.
[2024-05-24 13:27:24] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 3 ms to minimize.
[2024-05-24 13:27:24] [INFO ] Deduced a trap composed of 15 places in 218 ms of which 2 ms to minimize.
[2024-05-24 13:27:24] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 2 ms to minimize.
[2024-05-24 13:27:24] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 2 ms to minimize.
[2024-05-24 13:27:25] [INFO ] Deduced a trap composed of 11 places in 231 ms of which 3 ms to minimize.
[2024-05-24 13:27:25] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/936 variables, 14/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 936/1314 variables, and 380 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 234/486 constraints, ReadFeed: 90/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 22/22 constraints]
After SMT, in 8063ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 168 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 137770 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 6
Probabilistic random walk after 137770 steps, saw 92803 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-24 13:27:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:29] [INFO ] Invariant cache hit.
[2024-05-24 13:27:29] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/159 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :5100 after 13717
[2024-05-24 13:27:29] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-05-24 13:27:29] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2024-05-24 13:27:29] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 2 ms to minimize.
[2024-05-24 13:27:29] [INFO ] Deduced a trap composed of 25 places in 176 ms of which 2 ms to minimize.
[2024-05-24 13:27:29] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 13:27:30] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2024-05-24 13:27:30] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2024-05-24 13:27:30] [INFO ] Deduced a trap composed of 20 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 276/435 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 24/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 105/540 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 33/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 144/684 variables, 66/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 33/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/684 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 240/924 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/924 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 12/936 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 378/1314 variables, 252/612 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 266/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 878 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2887 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 150/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/159 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 276/435 variables, 159/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/435 variables, 24/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/435 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 105/540 variables, 9/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 33/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 144/684 variables, 66/309 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/684 variables, 33/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/684 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 240/924 variables, 12/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/924 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 12/936 variables, 6/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/936 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 2 ms to minimize.
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 3 ms to minimize.
[2024-05-24 13:27:33] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 2 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 4 ms to minimize.
[2024-05-24 13:27:34] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-05-24 13:27:35] [INFO ] Deduced a trap composed of 20 places in 294 ms of which 4 ms to minimize.
[2024-05-24 13:27:35] [INFO ] Deduced a trap composed of 17 places in 260 ms of which 3 ms to minimize.
[2024-05-24 13:27:35] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 4 ms to minimize.
[2024-05-24 13:27:36] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
[2024-05-24 13:27:36] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 4 ms to minimize.
[2024-05-24 13:27:36] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 3 ms to minimize.
[2024-05-24 13:27:36] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/936 variables, 14/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/936 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 378/1314 variables, 252/632 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 266/898 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 898 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6152 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 22/22 constraints]
After SMT, in 9074ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2020 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 105 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 13:27:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:40] [INFO ] Invariant cache hit.
[2024-05-24 13:27:41] [INFO ] Implicit Places using invariants in 840 ms returned []
[2024-05-24 13:27:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:41] [INFO ] Invariant cache hit.
[2024-05-24 13:27:41] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :13717 after 54285
[2024-05-24 13:27:45] [INFO ] Implicit Places using invariants and state equation in 3893 ms returned []
Implicit Place search using SMT with State Equation took 4734 ms to find 0 implicit places.
[2024-05-24 13:27:45] [INFO ] Redundant transitions in 302 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 13:27:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:27:45] [INFO ] Invariant cache hit.
[2024-05-24 13:27:45] [INFO ] State equation strengthened by 356 read => feed constraints.
Detected timeout of ITS tools.
[2024-05-24 13:28:05] [INFO ] Flatten gal took : 229 ms
[2024-05-24 13:28:05] [INFO ] Applying decomposition
[2024-05-24 13:28:06] [INFO ] Flatten gal took : 208 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/graph5431597655107597650.txt' '-o' '/tmp/graph5431597655107597650.bin' '-w' '/tmp/graph5431597655107597650.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5431597655107597650.bin' '-l' '-1' '-v' '-w' '/tmp/graph5431597655107597650.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:28:06] [INFO ] Decomposing Gal with order
[2024-05-24 13:28:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:28:08] [INFO ] Removed a total of 6271 redundant transitions.
[2024-05-24 13:28:08] [INFO ] Flatten gal took : 1328 ms
[2024-05-24 13:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 632 labels/synchronizations in 207 ms.
[2024-05-24 13:28:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16759434523330563760.gal : 55 ms
[2024-05-24 13:28:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13143873062366505184.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16759434523330563760.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13143873062366505184.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 ...309
Loading property file /tmp/ReachabilityCardinality13143873062366505184.prop.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,4 properties remain. new max is 2
SDD size :1 after 434
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :434 after 1529
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1529 after 44099
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32727ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37954 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2723 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 5 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 600 place count 146 transition count 281
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 620 place count 136 transition count 296
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 278
Free-agglomeration rule applied 69 times.
Iterating global reduction 4 with 69 rules applied. Total rules applied 707 place count 136 transition count 209
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 776 place count 67 transition count 209
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 787 place count 67 transition count 209
Applied a total of 787 rules in 88 ms. Remains 67 /486 variables (removed 419) and now considering 209/2907 (removed 2698) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 209 rows 67 cols
[2024-05-24 13:28:18] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 13:28:18] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:28:18] [INFO ] After 144ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2024-05-24 13:28:18] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:28:18] [INFO ] After 55ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:28:18] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:28:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:28:18] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 13:28:18] [INFO ] After 47ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 13:28:18] [INFO ] After 118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 13:28:19] [INFO ] After 357ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2024-05-24 13:28:19] [INFO ] Flatten gal took : 11 ms
[2024-05-24 13:28:19] [INFO ] Flatten gal took : 10 ms
[2024-05-24 13:28:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10970026965588566859.gal : 2 ms
[2024-05-24 13:28:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality563637483044990500.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10970026965588566859.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality563637483044990500.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality563637483044990500.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :16 after 48
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :48 after 768
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :768 after 864
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :864 after 1056
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1056 after 1433
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1433 after 15000
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :15000 after 2.58894e+06
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2.58894e+06 after 2.7925e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.375e+07,0.132343,5872,2,407,15,5665,8,0,482,3986,0
Total reachable state count : 33750000
Verifying 4 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,18750,0.133091,5872,2,239,15,5665,9,0,485,3986,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,18750,0.13336,5872,2,239,15,5665,10,0,486,3986,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,112500,0.13361,5872,2,252,15,5665,10,0,487,3986,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,112500,0.133868,5872,2,252,15,5665,10,0,487,3986,0
Over-approximation ignoring read arcs solved 0 properties in 980 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-09-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-09-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:28:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:28:19] [INFO ] Computed 28 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 67 ms. (147 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 26 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:28:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:28:19] [INFO ] Invariant cache hit.
[2024-05-24 13:28:19] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:28:19] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 13:28:19] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2024-05-24 13:28:19] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:28:19] [INFO ] [Real]Added 356 Read/Feed constraints in 118 ms returned sat
[2024-05-24 13:28:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:28:20] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2024-05-24 13:28:20] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:28:20] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2024-05-24 13:28:20] [INFO ] [Nat]Added 356 Read/Feed constraints in 126 ms returned sat
[2024-05-24 13:28:20] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2024-05-24 13:28:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2024-05-24 13:28:21] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 167 ms.
[2024-05-24 13:28:22] [INFO ] Added : 80 causal constraints over 16 iterations in 1353 ms. Result :sat
Minimization took 284 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 486 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_5_2) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 286 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 486/486 places, 2906/2906 transitions.
[2024-05-24 13:28:23] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
// Phase 1: matrix 827 rows 486 cols
[2024-05-24 13:28:23] [INFO ] Computed 28 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2531 ms. (394 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 994 ms. (1005 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:28:26] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:28:26] [INFO ] Invariant cache hit.
[2024-05-24 13:28:27] [INFO ] [Real]Absence check using 19 positive place invariants in 21 ms returned sat
[2024-05-24 13:28:27] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:28:27] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2024-05-24 13:28:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:28:27] [INFO ] [Real]Added 356 Read/Feed constraints in 128 ms returned sat
[2024-05-24 13:28:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:28:27] [INFO ] [Nat]Absence check using 19 positive place invariants in 25 ms returned sat
[2024-05-24 13:28:27] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2024-05-24 13:28:28] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-05-24 13:28:28] [INFO ] [Nat]Added 356 Read/Feed constraints in 77 ms returned sat
[2024-05-24 13:28:28] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-24 13:28:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2024-05-24 13:28:28] [INFO ] Computed and/alt/rep : 704/1602/488 causal constraints (skipped 330 transitions) in 92 ms.
[2024-05-24 13:28:29] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2024-05-24 13:28:29] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-24 13:28:29] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2024-05-24 13:28:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 707 ms
[2024-05-24 13:28:30] [INFO ] Added : 98 causal constraints over 21 iterations in 2263 ms. Result :sat
Minimization took 397 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 111 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 115 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2024-05-24 13:28:31] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:28:31] [INFO ] Invariant cache hit.
[2024-05-24 13:28:32] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-05-24 13:28:32] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:28:32] [INFO ] Invariant cache hit.
[2024-05-24 13:28:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:28:36] [INFO ] Implicit Places using invariants and state equation in 4037 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2024-05-24 13:28:36] [INFO ] Redundant transitions in 109 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-05-24 13:28:36] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:28:36] [INFO ] Invariant cache hit.
[2024-05-24 13:28:36] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
SMT process timed out in 32377ms, After SMT, problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 32413ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37539 ms. Remains : 486/486 places, 2906/2906 transitions.
[2024-05-24 13:29:09] [INFO ] Flatten gal took : 108 ms
RANDOM walk for 40000 steps (8 resets) in 476 ms. (83 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
[2024-05-24 13:29:09] [INFO ] Flatten gal took : 101 ms
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
[2024-05-24 13:29:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7124927241090770702.gal : 33 ms
[2024-05-24 13:29:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14189919426450738475.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/ReachabilityCardinality7124927241090770702.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14189919426450738475.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14189919426450738475.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 92
Interrupted probabilistic random walk after 188600 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 188600 steps, saw 123887 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-24 13:29:12] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:29:12] [INFO ] Invariant cache hit.
[2024-05-24 13:29:12] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:29:12] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :92 after 312
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :312 after 613
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 504/1313 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :613 after 1518
[2024-05-24 13:29:14] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 3 ms to minimize.
[2024-05-24 13:29:14] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1496 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 2686ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 237 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 117 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 317 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 164380 steps, run timeout after 3011 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 164380 steps, saw 109099 distinct states, run finished after 3012 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-24 13:29:18] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:29:18] [INFO ] Invariant cache hit.
[2024-05-24 13:29:18] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:29:18] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 504/1313 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1518 after 7416
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1313 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1332 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 504/1313 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:29:21] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2024-05-24 13:29:21] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1313 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 875 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3069ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 249 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 121 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 150 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2024-05-24 13:29:22] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:29:22] [INFO ] Invariant cache hit.
[2024-05-24 13:29:23] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-05-24 13:29:23] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:29:23] [INFO ] Invariant cache hit.
[2024-05-24 13:29:23] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7416 after 17958
[2024-05-24 13:29:26] [INFO ] Implicit Places using invariants and state equation in 3713 ms returned []
Implicit Place search using SMT with State Equation took 4801 ms to find 0 implicit places.
[2024-05-24 13:29:27] [INFO ] Redundant transitions in 108 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-05-24 13:29:27] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:29:27] [INFO ] Invariant cache hit.
[2024-05-24 13:29:27] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17958 after 77537
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
SMT process timed out in 32207ms, After SMT, problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 32245ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37317 ms. Remains : 486/486 places, 2906/2906 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 513
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 513
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 494
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 494
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 351
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 279
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 279
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 261
Detected timeout of ITS tools.
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 189
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 189
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 189
Applied a total of 791 rules in 76 ms. Remains 64 /486 variables (removed 422) and now considering 189/2906 (removed 2717) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 189 rows 64 cols
[2024-05-24 13:29:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 13:29:59] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 13:29:59] [INFO ] Flatten gal took : 89 ms
[2024-05-24 13:29:59] [INFO ] Applying decomposition
[2024-05-24 13:29:59] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 13:29:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:29:59] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:29:59] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:29:59] [INFO ] Flatten gal took : 94 ms
[2024-05-24 13:29:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 13:29:59] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:29:59] [INFO ] After 14ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:29:59] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:29:59] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:29:59] [INFO ] Flatten gal took : 6 ms
[2024-05-24 13:29:59] [INFO ] Flatten gal took : 6 ms
[2024-05-24 13:29:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9331555428527798052.gal : 2 ms
[2024-05-24 13:29:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8232411601529655407.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/ReachabilityCardinality9331555428527798052.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8232411601529655407.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8232411601529655407.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 392
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :392 after 436
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :436 after 518
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :518 after 692
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :692 after 9375
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.06719e+07,0.062885,5720,2,401,14,4288,6,0,445,2908,0
Total reachable state count : 20671875
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,84375,0.063606,5720,2,248,14,4288,7,0,448,2908,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,84375,0.063913,5720,2,248,14,4288,8,0,449,2908,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 519 ms.
[2024-05-24 13:29:59] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Object.wait(Object.java:472)
at java.base/java.util.concurrent.TimeUnit.timedWait(TimeUnit.java:408)
at java.base/java.lang.ProcessImpl.waitFor(ProcessImpl.java:449)
at fr.lip6.move.gal.process.Runner.waitForOrTimeout(Runner.java:70)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:47)
at fr.lip6.move.gal.process.Runner.runTool(Runner.java:27)
at fr.lip6.move.gal.louvain.GraphBuilder.convertGraphToBin(GraphBuilder.java:258)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:189)
at fr.lip6.move.gal.louvain.GraphBuilder.computeLouvain(GraphBuilder.java:157)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:114)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:719)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:71)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 13:29:59] [INFO ] Flatten gal took : 94 ms
[2024-05-24 13:30:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9325472158871795747.gal : 16 ms
[2024-05-24 13:30:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17619049286923492509.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9325472158871795747.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17619049286923492509.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17619049286923492509.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 65
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :65 after 92
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :92 after 312
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :312 after 613
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :613 after 1518
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1518 after 7416
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :7416 after 17958
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :17958 after 77537
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :77537 after 118103
Detected timeout of ITS tools.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-01 in 150848 ms.
Starting property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:30:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 13:30:50] [INFO ] Computed 28 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:30:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 13:30:50] [INFO ] Invariant cache hit.
[2024-05-24 13:30:50] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:30:50] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2024-05-24 13:30:50] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-24 13:30:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:30:50] [INFO ] [Real]Added 356 Read/Feed constraints in 86 ms returned sat
[2024-05-24 13:30:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:30:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:30:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 13:30:51] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2024-05-24 13:30:51] [INFO ] [Nat]Added 356 Read/Feed constraints in 83 ms returned sat
[2024-05-24 13:30:51] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 3 ms to minimize.
[2024-05-24 13:30:51] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2024-05-24 13:30:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2024-05-24 13:30:51] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 105 ms.
[2024-05-24 13:30:52] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 2 ms to minimize.
[2024-05-24 13:30:53] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 2 ms to minimize.
[2024-05-24 13:30:53] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 2 ms to minimize.
[2024-05-24 13:30:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 847 ms
[2024-05-24 13:30:53] [INFO ] Added : 70 causal constraints over 15 iterations in 2229 ms. Result :sat
Minimization took 454 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 486 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p37_7_1) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 250 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 258 ms. Remains : 486/486 places, 2906/2906 transitions.
[2024-05-24 13:30:54] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
// Phase 1: matrix 827 rows 486 cols
[2024-05-24 13:30:54] [INFO ] Computed 28 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2881 ms. (346 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 652 ms. (1531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-24 13:30:58] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:30:58] [INFO ] Invariant cache hit.
[2024-05-24 13:30:58] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-05-24 13:30:58] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-24 13:30:58] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2024-05-24 13:30:58] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:30:59] [INFO ] [Real]Added 356 Read/Feed constraints in 144 ms returned sat
[2024-05-24 13:30:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 13:30:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 23 ms returned sat
[2024-05-24 13:30:59] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 10 ms returned sat
[2024-05-24 13:30:59] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2024-05-24 13:30:59] [INFO ] [Nat]Added 356 Read/Feed constraints in 108 ms returned sat
[2024-05-24 13:31:00] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
[2024-05-24 13:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2024-05-24 13:31:00] [INFO ] Computed and/alt/rep : 704/1602/488 causal constraints (skipped 330 transitions) in 150 ms.
[2024-05-24 13:31:01] [INFO ] Added : 80 causal constraints over 16 iterations in 1508 ms. Result :sat
Minimization took 435 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 174 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 175 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2024-05-24 13:31:02] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:02] [INFO ] Invariant cache hit.
[2024-05-24 13:31:04] [INFO ] Implicit Places using invariants in 1384 ms returned []
[2024-05-24 13:31:04] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:04] [INFO ] Invariant cache hit.
[2024-05-24 13:31:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:31:09] [INFO ] Implicit Places using invariants and state equation in 4886 ms returned []
Implicit Place search using SMT with State Equation took 6275 ms to find 0 implicit places.
[2024-05-24 13:31:09] [INFO ] Redundant transitions in 110 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-05-24 13:31:09] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:09] [INFO ] Invariant cache hit.
[2024-05-24 13:31:09] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
SMT process timed out in 32445ms, After SMT, problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 32477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39050 ms. Remains : 486/486 places, 2906/2906 transitions.
[2024-05-24 13:31:42] [INFO ] Flatten gal took : 456 ms
RANDOM walk for 40000 steps (8 resets) in 1120 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 2/2 properties
[2024-05-24 13:31:42] [INFO ] Flatten gal took : 305 ms
[2024-05-24 13:31:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6211087454998035163.gal : 31 ms
[2024-05-24 13:31:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16293750737731946117.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6211087454998035163.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16293750737731946117.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16293750737731946117.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :8 after 23
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :23 after 28
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :28 after 33
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :33 after 101
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :101 after 346
Interrupted probabilistic random walk after 162490 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 2
Probabilistic random walk after 162490 steps, saw 107854 distinct states, run finished after 3005 ms. (steps per millisecond=54 ) properties seen :0
[2024-05-24 13:31:45] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:45] [INFO ] Invariant cache hit.
[2024-05-24 13:31:45] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :346 after 943
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :943 after 1521
[2024-05-24 13:31:46] [INFO ] Deduced a trap composed of 66 places in 819 ms of which 8 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 504/1313 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1313 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 872 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2088 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:48] [INFO ] Deduced a trap composed of 79 places in 703 ms of which 6 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1521 after 5324
At refinement iteration 23 (OVERLAPS) 504/1313 variables, 336/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 314/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:49] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1313 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1313 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 876 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4418ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 365 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 172 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 486/486 places, 2906/2906 transitions.
RANDOM walk for 40000 steps (8 resets) in 683 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 187630 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 2
Probabilistic random walk after 187630 steps, saw 123255 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-24 13:31:53] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:53] [INFO ] Invariant cache hit.
[2024-05-24 13:31:53] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:55] [INFO ] Deduced a trap composed of 66 places in 847 ms of which 7 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :5324 after 13686
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 504/1313 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1313 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1313 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1313 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1313/1313 variables, and 872 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 91/144 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 137/281 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 192/473 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/473 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 320/793 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/793 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 16/809 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/809 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/809 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:57] [INFO ] Deduced a trap composed of 79 places in 675 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/809 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/809 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 504/1313 variables, 336/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1313 variables, 314/875 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 13:31:58] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1313 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1313 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1313 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1313/1313 variables, and 876 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2248 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4744ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 351 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 166 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 486/486 places, 2906/2906 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2906/2906 transitions.
Applied a total of 0 rules in 107 ms. Remains 486 /486 variables (removed 0) and now considering 2906/2906 (removed 0) transitions.
[2024-05-24 13:31:59] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:31:59] [INFO ] Invariant cache hit.
[2024-05-24 13:32:00] [INFO ] Implicit Places using invariants in 969 ms returned []
[2024-05-24 13:32:00] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:32:00] [INFO ] Invariant cache hit.
[2024-05-24 13:32:00] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 13:32:04] [INFO ] Implicit Places using invariants and state equation in 4317 ms returned []
Implicit Place search using SMT with State Equation took 5291 ms to find 0 implicit places.
[2024-05-24 13:32:04] [INFO ] Redundant transitions in 108 ms returned []
Running 2897 sub problems to find dead transitions.
[2024-05-24 13:32:04] [INFO ] Flow matrix only has 827 transitions (discarded 2079 similar events)
[2024-05-24 13:32:04] [INFO ] Invariant cache hit.
[2024-05-24 13:32:04] [INFO ] State equation strengthened by 356 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :13686 after 54883
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :54883 after 99869
Detected timeout of ITS tools.
[2024-05-24 13:32:32] [INFO ] Flatten gal took : 78 ms
[2024-05-24 13:32:32] [INFO ] Applying decomposition
[2024-05-24 13:32:32] [INFO ] Flatten gal took : 79 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/graph6220376622491869919.txt' '-o' '/tmp/graph6220376622491869919.bin' '-w' '/tmp/graph6220376622491869919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6220376622491869919.bin' '-l' '-1' '-v' '-w' '/tmp/graph6220376622491869919.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:32:33] [INFO ] Decomposing Gal with order
[2024-05-24 13:32:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:32:33] [INFO ] Removed a total of 6304 redundant transitions.
[2024-05-24 13:32:33] [INFO ] Flatten gal took : 281 ms
[2024-05-24 13:32:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 631 labels/synchronizations in 124 ms.
[2024-05-24 13:32:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13979792123715538475.gal : 22 ms
[2024-05-24 13:32:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13840542020423216630.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13979792123715538475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13840542020423216630.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 ...309
Loading property file /tmp/ReachabilityCardinality13840542020423216630.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 5517
(s9 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/485 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2897 unsolved
SMT process timed out in 32666ms, After SMT, problems are : Problem set: 0 solved, 2897 unsolved
Search for dead transitions found 0 dead transitions in 32699ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38218 ms. Remains : 486/486 places, 2906/2906 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 13 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 513
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 513
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 494
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 494
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 351
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 279
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 622 place count 135 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 631 place count 135 transition count 285
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 640 place count 135 transition count 276
Free-agglomeration rule applied 69 times.
Iterating global reduction 4 with 69 rules applied. Total rules applied 709 place count 135 transition count 207
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 4 with 69 rules applied. Total rules applied 778 place count 66 transition count 207
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 789 place count 66 transition count 207
Applied a total of 789 rules in 61 ms. Remains 66 /486 variables (removed 420) and now considering 207/2906 (removed 2699) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 207 rows 66 cols
[2024-05-24 13:32:37] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 13:32:37] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 13:32:37] [INFO ] After 94ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2024-05-24 13:32:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:32:37] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:32:37] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:32:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 13:32:37] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:32:37] [INFO ] After 20ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 13:32:37] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:32:37] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:32:37] [INFO ] Flatten gal took : 9 ms
[2024-05-24 13:32:37] [INFO ] Flatten gal took : 9 ms
[2024-05-24 13:32:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10704829890825939040.gal : 2 ms
[2024-05-24 13:32:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13662966010517237225.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/ReachabilityCardinality10704829890825939040.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13662966010517237225.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 ...330
Loading property file /tmp/ReachabilityCardinality13662966010517237225.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 48
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :48 after 392
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :392 after 436
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :436 after 518
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :518 after 692
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :692 after 5000
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5000 after 2.1557e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.8125e+07,0.073022,5876,2,416,13,5422,8,0,473,3672,0
Total reachable state count : 28125000
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,759375,0.073953,5876,2,253,13,5422,8,0,475,3672,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,759375,0.074257,5876,2,253,13,5422,8,0,475,3672,0
Over-approximation ignoring read arcs solved 0 properties in 598 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-02 in 107723 ms.
[2024-05-24 13:32:37] [INFO ] Flatten gal took : 126 ms
[2024-05-24 13:32:38] [INFO ] Applying decomposition
[2024-05-24 13:32:38] [INFO ] Flatten gal took : 130 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/graph4893796082894933982.txt' '-o' '/tmp/graph4893796082894933982.bin' '-w' '/tmp/graph4893796082894933982.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4893796082894933982.bin' '-l' '-1' '-v' '-w' '/tmp/graph4893796082894933982.weights' '-q' '0' '-e' '0.001'
[2024-05-24 13:32:38] [INFO ] Decomposing Gal with order
[2024-05-24 13:32:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:32:38] [INFO ] Removed a total of 6274 redundant transitions.
[2024-05-24 13:32:38] [INFO ] Flatten gal took : 347 ms
[2024-05-24 13:32:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 637 labels/synchronizations in 71 ms.
[2024-05-24 13:32:39] [INFO ] Time to serialize gal into /tmp/UpperBounds8944533940087911406.gal : 20 ms
[2024-05-24 13:32:39] [INFO ] Time to serialize properties into /tmp/UpperBounds11543422550413165107.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8944533940087911406.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11543422550413165107.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 ...284
Loading property file /tmp/UpperBounds11543422550413165107.prop.
ITS-tools command line returned an error code 137
[2024-05-24 13:46:33] [INFO ] Applying decomposition
[2024-05-24 13:46:33] [INFO ] Flatten gal took : 80 ms
[2024-05-24 13:46:33] [INFO ] Decomposing Gal with order
[2024-05-24 13:46:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 13:46:34] [INFO ] Removed a total of 7598 redundant transitions.
[2024-05-24 13:46:34] [INFO ] Flatten gal took : 451 ms
[2024-05-24 13:46:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 347 labels/synchronizations in 123 ms.
[2024-05-24 13:46:34] [INFO ] Time to serialize gal into /tmp/UpperBounds11862369757559730152.gal : 28 ms
[2024-05-24 13:46:34] [INFO ] Time to serialize properties into /tmp/UpperBounds12810699263161356525.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/UpperBounds11862369757559730152.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12810699263161356525.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...285
Loading property file /tmp/UpperBounds12810699263161356525.prop.
ITS-tools command line returned an error code 137
[2024-05-24 13:58:35] [INFO ] Flatten gal took : 94 ms
[2024-05-24 13:58:35] [INFO ] Input system was already deterministic with 2907 transitions.
[2024-05-24 13:58:35] [INFO ] Transformed 486 places.
[2024-05-24 13:58:35] [INFO ] Transformed 2907 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 13:58:35] [INFO ] Time to serialize gal into /tmp/UpperBounds7385710631523397226.gal : 11 ms
[2024-05-24 13:58:35] [INFO ] Time to serialize properties into /tmp/UpperBounds17994683328573441471.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/UpperBounds7385710631523397226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17994683328573441471.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17994683328573441471.prop.
ITS-tools command line returned an error code 137
Total runtime 2732230 ms.
BK_STOP 1716559768965
--------------------
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="EisenbergMcGuire-PT-09"
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 EisenbergMcGuire-PT-09, 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 r158-smll-171636266400197"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 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 '
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 ;