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.r496-tall-171640603000277.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 ltsminxred
Input is FunctionPointer-PT-c002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603000277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c002-UpperBounds-00
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-01
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-02
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-03
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-04
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-05
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-06
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-07
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-08
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-09
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-10
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-11
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-12
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-13
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-14
FORMULA_NAME FunctionPointer-PT-c002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717190481151

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:21:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:21:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:21:22] [INFO ] Load time of PNML (sax parser for PT used): 358 ms
[2024-05-31 21:21:22] [INFO ] Transformed 2826 places.
[2024-05-31 21:21:22] [INFO ] Transformed 8960 transitions.
[2024-05-31 21:21:22] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 506 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1198 places in 44 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c002-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c002-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:21:22] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
// Phase 1: matrix 3540 rows 1628 cols
[2024-05-31 21:21:23] [INFO ] Computed 4 invariants in 98 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, 2]
RANDOM walk for 10001 steps (2 resets) in 312 ms. (31 steps per ms)
FORMULA FunctionPointer-PT-c002-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (18 resets) in 261 ms. (343 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 6, 6, 0, 1, 8, 0, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:21:23] [INFO ] Flow matrix only has 3540 transitions (discarded 2422 similar events)
[2024-05-31 21:21:23] [INFO ] Invariant cache hit.
[2024-05-31 21:21:24] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2024-05-31 21:21:24] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 21:21:24] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2024-05-31 21:21:25] [INFO ] State equation strengthened by 479 read => feed constraints.
[2024-05-31 21:21:25] [INFO ] [Real]Added 479 Read/Feed constraints in 132 ms returned sat
[2024-05-31 21:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:26] [INFO ] [Nat]Absence check using state equation in 698 ms returned sat
[2024-05-31 21:21:26] [INFO ] [Nat]Added 479 Read/Feed constraints in 344 ms returned sat
[2024-05-31 21:21:27] [INFO ] Deduced a trap composed of 147 places in 1260 ms of which 89 ms to minimize.
[2024-05-31 21:21:29] [INFO ] Deduced a trap composed of 141 places in 1167 ms of which 13 ms to minimize.
[2024-05-31 21:21:30] [INFO ] Deduced a trap composed of 136 places in 1182 ms of which 11 ms to minimize.
[2024-05-31 21:21:30] [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-31 21:21:30] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:21:30] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Real]Absence check using state equation in 727 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Real]Added 479 Read/Feed constraints in 132 ms returned sat
[2024-05-31 21:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:21:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2024-05-31 21:21:32] [INFO ] [Nat]Added 479 Read/Feed constraints in 100 ms returned sat
[2024-05-31 21:21:33] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 737 ms.
[2024-05-31 21:21:35] [INFO ] Deduced a trap composed of 142 places in 1215 ms of which 11 ms to minimize.
[2024-05-31 21:21:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1439 ms
[2024-05-31 21:21:35] [INFO ] Added : 2 causal constraints over 1 iterations in 2645 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:21:36] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:21:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:37] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-31 21:21:37] [INFO ] [Real]Added 479 Read/Feed constraints in 206 ms returned sat
[2024-05-31 21:21:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:37] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:38] [INFO ] [Nat]Absence check using state equation in 784 ms returned sat
[2024-05-31 21:21:38] [INFO ] [Nat]Added 479 Read/Feed constraints in 126 ms returned sat
[2024-05-31 21:21:39] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 476 ms.
[2024-05-31 21:21:39] [INFO ] Added : 2 causal constraints over 1 iterations in 826 ms. Result :sat
Minimization took 579 ms.
[2024-05-31 21:21:40] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:21:40] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 21:21:40] [INFO ] [Real]Absence check using state equation in 725 ms returned sat
[2024-05-31 21:21:41] [INFO ] [Real]Added 479 Read/Feed constraints in 104 ms returned sat
[2024-05-31 21:21:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:42] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2024-05-31 21:21:42] [INFO ] [Nat]Added 479 Read/Feed constraints in 106 ms returned sat
[2024-05-31 21:21:42] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 422 ms.
[2024-05-31 21:21:42] [INFO ] Added : 2 causal constraints over 1 iterations in 737 ms. Result :sat
Minimization took 580 ms.
[2024-05-31 21:21:43] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 21:21:44] [INFO ] [Real]Absence check using state equation in 761 ms returned sat
[2024-05-31 21:21:44] [INFO ] [Real]Added 479 Read/Feed constraints in 106 ms returned sat
[2024-05-31 21:21:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:21:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-31 21:21:45] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2024-05-31 21:21:45] [INFO ] [Nat]Added 479 Read/Feed constraints in 90 ms returned sat
[2024-05-31 21:21:46] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 421 ms.
[2024-05-31 21:21:47] [INFO ] Deduced a trap composed of 164 places in 1091 ms of which 11 ms to minimize.
[2024-05-31 21:21:48] [INFO ] Deduced a trap composed of 153 places in 1188 ms of which 10 ms to minimize.
[2024-05-31 21:21:50] [INFO ] Deduced a trap composed of 141 places in 1115 ms of which 11 ms to minimize.
[2024-05-31 21:21:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:21:50] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2024-05-31 21:21:50] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:51] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2024-05-31 21:21:51] [INFO ] [Real]Added 479 Read/Feed constraints in 155 ms returned sat
[2024-05-31 21:21:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:51] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:52] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2024-05-31 21:21:52] [INFO ] [Nat]Added 479 Read/Feed constraints in 176 ms returned sat
[2024-05-31 21:21:53] [INFO ] Deduced a trap composed of 142 places in 1173 ms of which 10 ms to minimize.
[2024-05-31 21:21:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1374 ms
[2024-05-31 21:21:54] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 421 ms.
[2024-05-31 21:21:54] [INFO ] Added : 2 causal constraints over 1 iterations in 749 ms. Result :sat
Minimization took 576 ms.
[2024-05-31 21:21:55] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:21:55] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:56] [INFO ] [Real]Absence check using state equation in 722 ms returned sat
[2024-05-31 21:21:56] [INFO ] [Real]Added 479 Read/Feed constraints in 151 ms returned sat
[2024-05-31 21:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:21:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:21:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:21:57] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2024-05-31 21:21:57] [INFO ] [Nat]Added 479 Read/Feed constraints in 128 ms returned sat
[2024-05-31 21:21:58] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 420 ms.
[2024-05-31 21:21:58] [INFO ] Added : 2 causal constraints over 1 iterations in 747 ms. Result :sat
Minimization took 576 ms.
[2024-05-31 21:21:59] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:21:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:21:59] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-31 21:21:59] [INFO ] [Real]Added 479 Read/Feed constraints in 111 ms returned sat
[2024-05-31 21:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-31 21:22:00] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 21:22:00] [INFO ] [Nat]Absence check using state equation in 723 ms returned sat
[2024-05-31 21:22:01] [INFO ] [Nat]Added 479 Read/Feed constraints in 93 ms returned sat
[2024-05-31 21:22:01] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 432 ms.
[2024-05-31 21:22:01] [INFO ] Added : 1 causal constraints over 1 iterations in 758 ms. Result :sat
Minimization took 576 ms.
[2024-05-31 21:22:02] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2024-05-31 21:22:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:03] [INFO ] [Real]Absence check using state equation in 746 ms returned sat
[2024-05-31 21:22:03] [INFO ] [Real]Added 479 Read/Feed constraints in 171 ms returned sat
[2024-05-31 21:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2024-05-31 21:22:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 21:22:04] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2024-05-31 21:22:04] [INFO ] [Nat]Added 479 Read/Feed constraints in 145 ms returned sat
[2024-05-31 21:22:05] [INFO ] Computed and/alt/rep : 351/504/351 causal constraints (skipped 3187 transitions) in 440 ms.
[2024-05-31 21:22:05] [INFO ] Added : 2 causal constraints over 1 iterations in 761 ms. Result :sat
Minimization took 577 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 6, 6, 0, 1, 8, 0, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 6, 6, 0, 1, 8, 0, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 1628 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Graph (complete) has 7332 edges and 1628 vertex of which 1422 are kept as prefixes of interest. Removing 206 places using SCC suffix rule.16 ms
Discarding 206 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 1422 transition count 5583
Discarding 299 places :
Symmetric choice reduction at 1 with 299 rule applications. Total rules 679 place count 1123 transition count 3293
Iterating global reduction 1 with 299 rules applied. Total rules applied 978 place count 1123 transition count 3293
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 1328 place count 1123 transition count 2943
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1485 place count 966 transition count 2629
Iterating global reduction 2 with 157 rules applied. Total rules applied 1642 place count 966 transition count 2629
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 2 with 64 rules applied. Total rules applied 1706 place count 966 transition count 2565
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1720 place count 952 transition count 2537
Iterating global reduction 3 with 14 rules applied. Total rules applied 1734 place count 952 transition count 2537
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1748 place count 938 transition count 2509
Iterating global reduction 3 with 14 rules applied. Total rules applied 1762 place count 938 transition count 2509
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1776 place count 924 transition count 2481
Iterating global reduction 3 with 14 rules applied. Total rules applied 1790 place count 924 transition count 2481
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1804 place count 910 transition count 2453
Iterating global reduction 3 with 14 rules applied. Total rules applied 1818 place count 910 transition count 2453
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1832 place count 896 transition count 2425
Iterating global reduction 3 with 14 rules applied. Total rules applied 1846 place count 896 transition count 2425
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1860 place count 882 transition count 2397
Iterating global reduction 3 with 14 rules applied. Total rules applied 1874 place count 882 transition count 2397
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1885 place count 871 transition count 2375
Iterating global reduction 3 with 11 rules applied. Total rules applied 1896 place count 871 transition count 2375
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1954 place count 813 transition count 2151
Iterating global reduction 3 with 58 rules applied. Total rules applied 2012 place count 813 transition count 2151
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2068 place count 757 transition count 1927
Iterating global reduction 3 with 56 rules applied. Total rules applied 2124 place count 757 transition count 1927
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2180 place count 701 transition count 1807
Iterating global reduction 3 with 56 rules applied. Total rules applied 2236 place count 701 transition count 1807
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2292 place count 645 transition count 1695
Iterating global reduction 3 with 56 rules applied. Total rules applied 2348 place count 645 transition count 1695
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2404 place count 589 transition count 1583
Iterating global reduction 3 with 56 rules applied. Total rules applied 2460 place count 589 transition count 1583
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2516 place count 533 transition count 1471
Iterating global reduction 3 with 56 rules applied. Total rules applied 2572 place count 533 transition count 1471
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2627 place count 478 transition count 1361
Iterating global reduction 3 with 55 rules applied. Total rules applied 2682 place count 478 transition count 1361
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2686 place count 474 transition count 1353
Iterating global reduction 3 with 4 rules applied. Total rules applied 2690 place count 474 transition count 1353
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 2706 place count 474 transition count 1337
Applied a total of 2706 rules in 1152 ms. Remains 474 /1628 variables (removed 1154) and now considering 1337/5962 (removed 4625) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1170 ms. Remains : 474/1628 places, 1337/5962 transitions.
[2024-05-31 21:22:07] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {255=1, 258=1, 267=1, 391=1, 724=1, 767=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 388=1, 593=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :[1, 0, 0, 0, 0, 2, 3, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 6, 6, 0, 2, 8, 0, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:22:07] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
// Phase 1: matrix 776 rows 474 cols
[2024-05-31 21:22:07] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 6, 6, 0, 2, 8, 0, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2354 ms. (424 steps per ms)
BEST_FIRST walk for 9000009 steps (18 resets) in 5284 ms. (1702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 7, 1547, 0, 3, 510, 5, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:22:15] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:22:15] [INFO ] Invariant cache hit.
[2024-05-31 21:22:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:15] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:22:15] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-31 21:22:15] [INFO ] [Real]Added 98 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:16] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:22:16] [INFO ] [Nat]Added 98 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:22:16] [INFO ] Deduced a trap composed of 102 places in 213 ms of which 3 ms to minimize.
[2024-05-31 21:22:16] [INFO ] Deduced a trap composed of 90 places in 199 ms of which 3 ms to minimize.
[2024-05-31 21:22:16] [INFO ] Deduced a trap composed of 88 places in 203 ms of which 3 ms to minimize.
[2024-05-31 21:22:16] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:22:17] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 4 ms to minimize.
[2024-05-31 21:22:17] [INFO ] Deduced a trap composed of 147 places in 175 ms of which 3 ms to minimize.
[2024-05-31 21:22:17] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1387 ms
[2024-05-31 21:22:17] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:22:17] [INFO ] Added : 2 causal constraints over 1 iterations in 163 ms. Result :sat
Minimization took 277 ms.
[2024-05-31 21:22:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:18] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:22:18] [INFO ] [Real]Added 98 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:18] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:22:18] [INFO ] [Nat]Added 98 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:22:18] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 74 ms.
[2024-05-31 21:22:18] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:22:19] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Real]Added 98 Read/Feed constraints in 37 ms returned sat
[2024-05-31 21:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:22:19] [INFO ] [Nat]Added 98 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:22:19] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 69 ms.
[2024-05-31 21:22:19] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 268 ms.
[2024-05-31 21:22:20] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:22:20] [INFO ] [Real]Added 98 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:22:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:20] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:22:20] [INFO ] [Nat]Added 98 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:22:20] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:22:20] [INFO ] Added : 2 causal constraints over 1 iterations in 172 ms. Result :sat
Minimization took 265 ms.
[2024-05-31 21:22:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:21] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:22:21] [INFO ] [Real]Added 98 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:21] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:22:21] [INFO ] [Nat]Added 98 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:22:21] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 69 ms.
[2024-05-31 21:22:21] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 252 ms.
[2024-05-31 21:22:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:22] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:22:22] [INFO ] [Real]Added 98 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:22] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2024-05-31 21:22:22] [INFO ] [Nat]Added 98 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:22:22] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 71 ms.
[2024-05-31 21:22:22] [INFO ] Added : 2 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 21:22:23] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Real]Added 98 Read/Feed constraints in 54 ms returned sat
[2024-05-31 21:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:22:23] [INFO ] [Nat]Added 98 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:22:23] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 71 ms.
[2024-05-31 21:22:23] [INFO ] Added : 2 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 252 ms.
[2024-05-31 21:22:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:24] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:22:24] [INFO ] [Real]Added 98 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:22:24] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:22:24] [INFO ] [Nat]Added 98 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:22:24] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 71 ms.
[2024-05-31 21:22:24] [INFO ] Added : 1 causal constraints over 1 iterations in 160 ms. Result :sat
Minimization took 255 ms.
[2024-05-31 21:22:25] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:25] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:22:25] [INFO ] [Real]Added 98 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:22:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:22:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:22:25] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:22:25] [INFO ] [Nat]Added 98 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:22:25] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 76 ms.
[2024-05-31 21:22:25] [INFO ] Added : 2 causal constraints over 1 iterations in 165 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 7, 1547, 0, 3, 510, 5, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 4, 7, 1547, 0, 3, 510, 5, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 9 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1337/1337 transitions.
Applied a total of 0 rules in 54 ms. Remains 474 /474 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 474/474 places, 1337/1337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1337/1337 transitions.
Applied a total of 0 rules in 62 ms. Remains 474 /474 variables (removed 0) and now considering 1337/1337 (removed 0) transitions.
[2024-05-31 21:22:33] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:22:33] [INFO ] Invariant cache hit.
[2024-05-31 21:22:33] [INFO ] Implicit Places using invariants in 495 ms returned []
[2024-05-31 21:22:33] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:22:33] [INFO ] Invariant cache hit.
[2024-05-31 21:22:34] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-31 21:22:35] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2024-05-31 21:22:35] [INFO ] Redundant transitions in 85 ms returned []
Running 1335 sub problems to find dead transitions.
[2024-05-31 21:22:35] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:22:35] [INFO ] Invariant cache hit.
[2024-05-31 21:22:35] [INFO ] State equation strengthened by 98 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
[2024-05-31 21:22:52] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/1250 variables, and 4 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/474 constraints, ReadFeed: 0/98 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/474 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 3 (OVERLAPS) 776/1250 variables, 474/478 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1250 variables, 98/576 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1250 variables, 1335/1911 constraints. Problems are: Problem set: 0 solved, 1335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1250/1250 variables, and 1911 constraints, problems are : Problem set: 0 solved, 1335 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 474/474 constraints, ReadFeed: 98/98 constraints, PredecessorRefiner: 1335/1335 constraints, Known Traps: 1/1 constraints]
After SMT, in 65141ms problems are : Problem set: 0 solved, 1335 unsolved
Search for dead transitions found 0 dead transitions in 65171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67281 ms. Remains : 474/474 places, 1337/1337 transitions.
[2024-05-31 21:23:40] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
Found an invariant !
This invariant on transitions {255=1, 258=1, 267=1, 391=1, 724=1, 767=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 388=1, 593=1, 756=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 9) seen :[0, 0, 2147483647, 0, 4, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 4, +inf, 1547, 4, 3, 510, 5, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:23:41] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:23:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 4, +inf, 1547, 4, 3, 510, 5, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2349 ms. (425 steps per ms)
FORMULA FunctionPointer-PT-c002-UpperBounds-03 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 8000008 steps (16 resets) in 4706 ms. (1699 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 4, 1571, 7, 492, 1576, 3856, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:23:48] [INFO ] Flow matrix only has 776 transitions (discarded 561 similar events)
[2024-05-31 21:23:48] [INFO ] Invariant cache hit.
[2024-05-31 21:23:48] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:48] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:23:48] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-05-31 21:23:48] [INFO ] [Real]Added 98 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:23:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:48] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:23:48] [INFO ] [Nat]Added 98 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:23:48] [INFO ] Deduced a trap composed of 102 places in 208 ms of which 3 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 90 places in 200 ms of which 3 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 88 places in 205 ms of which 3 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 3 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 78 places in 205 ms of which 3 ms to minimize.
[2024-05-31 21:23:49] [INFO ] Deduced a trap composed of 147 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:23:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1399 ms
[2024-05-31 21:23:50] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:23:50] [INFO ] Added : 2 causal constraints over 1 iterations in 182 ms. Result :sat
Minimization took 272 ms.
[2024-05-31 21:23:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:50] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:23:50] [INFO ] [Real]Added 98 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:23:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Nat]Added 98 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:23:51] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:23:51] [INFO ] Added : 2 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2024-05-31 21:23:51] [INFO ] [Real]Added 98 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:23:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:23:52] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:23:52] [INFO ] [Nat]Added 98 Read/Feed constraints in 40 ms returned sat
[2024-05-31 21:23:52] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 72 ms.
[2024-05-31 21:23:52] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 21:23:52] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:52] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2024-05-31 21:23:52] [INFO ] [Real]Added 98 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:53] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:23:53] [INFO ] [Nat]Added 98 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:23:53] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 95 ms.
[2024-05-31 21:23:53] [INFO ] Added : 2 causal constraints over 1 iterations in 189 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:23:53] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:53] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:23:53] [INFO ] [Real]Added 98 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:23:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:54] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:23:54] [INFO ] [Nat]Added 98 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:23:54] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:23:54] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:23:54] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:54] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2024-05-31 21:23:54] [INFO ] [Real]Added 98 Read/Feed constraints in 57 ms returned sat
[2024-05-31 21:23:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Nat]Added 98 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:23:55] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 71 ms.
[2024-05-31 21:23:55] [INFO ] Added : 2 causal constraints over 1 iterations in 161 ms. Result :sat
Minimization took 255 ms.
[2024-05-31 21:23:55] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:23:55] [INFO ] [Real]Added 98 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:56] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:23:56] [INFO ] [Nat]Added 98 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:23:56] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 70 ms.
[2024-05-31 21:23:56] [INFO ] Added : 1 causal constraints over 1 iterations in 164 ms. Result :sat
Minimization took 255 ms.
[2024-05-31 21:23:56] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:23:56] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:23:56] [INFO ] [Real]Added 98 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:23:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:23:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:23:57] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2024-05-31 21:23:57] [INFO ] [Nat]Added 98 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:23:57] [INFO ] Computed and/alt/rep : 104/107/84 causal constraints (skipped 690 transitions) in 71 ms.
[2024-05-31 21:23:57] [INFO ] Added : 2 causal constraints over 1 iterations in 166 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 4, 1571, 7, 492, 1576, 3856, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 1571, 7, 492, 1576, 3856, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 8 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1337/1337 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 473 transition count 1335
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 473 transition count 1335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 473 transition count 1333
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 472 transition count 1331
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 472 transition count 1331
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 471 transition count 1329
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 471 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 470 transition count 1325
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 470 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 469 transition count 1323
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 469 transition count 1323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 468 transition count 1321
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 468 transition count 1321
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 467 transition count 1319
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 467 transition count 1319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 466 transition count 1317
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 466 transition count 1317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 465 transition count 1315
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 465 transition count 1315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 464 transition count 1313
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 464 transition count 1313
Applied a total of 22 rules in 135 ms. Remains 464 /474 variables (removed 10) and now considering 1313/1337 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 136 ms. Remains : 464/474 places, 1313/1337 transitions.
[2024-05-31 21:24:11] [INFO ] Flow matrix only has 760 transitions (discarded 553 similar events)
Found an invariant !
This invariant on transitions {255=1, 381=1, 585=1, 745=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {248=1, 374=1, 706=1, 751=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :[0, 0, 0, 2147483647, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 4, 1571, +inf, 492, +inf, 3856, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:24:12] [INFO ] Flow matrix only has 760 transitions (discarded 553 similar events)
// Phase 1: matrix 760 rows 464 cols
[2024-05-31 21:24:12] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 4, 1571, +inf, 492, +inf, 3856, 4] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000003 steps (2 resets) in 2423 ms. (412 steps per ms)
FORMULA FunctionPointer-PT-c002-UpperBounds-12 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FunctionPointer-PT-c002-UpperBounds-05 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 6000005 steps (12 resets) in 3423 ms. (1752 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 4, 1571, 492, 3856, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:24:18] [INFO ] Flow matrix only has 760 transitions (discarded 553 similar events)
[2024-05-31 21:24:18] [INFO ] Invariant cache hit.
[2024-05-31 21:24:18] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:18] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:24:18] [INFO ] State equation strengthened by 95 read => feed constraints.
[2024-05-31 21:24:18] [INFO ] [Real]Added 95 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:24:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:18] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:24:18] [INFO ] [Nat]Added 95 Read/Feed constraints in 46 ms returned sat
[2024-05-31 21:24:18] [INFO ] Deduced a trap composed of 128 places in 201 ms of which 3 ms to minimize.
[2024-05-31 21:24:19] [INFO ] Deduced a trap composed of 129 places in 191 ms of which 3 ms to minimize.
[2024-05-31 21:24:19] [INFO ] Deduced a trap composed of 86 places in 193 ms of which 2 ms to minimize.
[2024-05-31 21:24:19] [INFO ] Deduced a trap composed of 151 places in 168 ms of which 3 ms to minimize.
[2024-05-31 21:24:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 865 ms
[2024-05-31 21:24:19] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 68 ms.
[2024-05-31 21:24:19] [INFO ] Added : 2 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:24:19] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:20] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:24:20] [INFO ] [Real]Added 95 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:24:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:20] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:24:20] [INFO ] [Nat]Added 95 Read/Feed constraints in 52 ms returned sat
[2024-05-31 21:24:20] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 3 ms to minimize.
[2024-05-31 21:24:20] [INFO ] Deduced a trap composed of 128 places in 201 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 129 places in 196 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 92 places in 184 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 90 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Deduced a trap composed of 82 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:24:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1540 ms
[2024-05-31 21:24:22] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 71 ms.
[2024-05-31 21:24:22] [INFO ] Added : 8 causal constraints over 3 iterations in 248 ms. Result :sat
Minimization took 267 ms.
[2024-05-31 21:24:22] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:22] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:24:22] [INFO ] [Real]Added 95 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:23] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:24:23] [INFO ] [Nat]Added 95 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:24:23] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 68 ms.
[2024-05-31 21:24:23] [INFO ] Added : 13 causal constraints over 4 iterations in 272 ms. Result :sat
Minimization took 256 ms.
[2024-05-31 21:24:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:23] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:24:23] [INFO ] [Real]Added 95 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:24] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:24:24] [INFO ] [Nat]Added 95 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:24:24] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 72 ms.
[2024-05-31 21:24:24] [INFO ] Added : 5 causal constraints over 3 iterations in 230 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 21:24:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:24] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:24:24] [INFO ] [Real]Added 95 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:25] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2024-05-31 21:24:25] [INFO ] [Nat]Added 95 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:24:25] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 69 ms.
[2024-05-31 21:24:25] [INFO ] Added : 1 causal constraints over 1 iterations in 154 ms. Result :sat
Minimization took 251 ms.
[2024-05-31 21:24:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:25] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:24:25] [INFO ] [Real]Added 95 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:26] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2024-05-31 21:24:26] [INFO ] [Nat]Added 95 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:24:26] [INFO ] Computed and/alt/rep : 111/242/98 causal constraints (skipped 660 transitions) in 68 ms.
[2024-05-31 21:24:26] [INFO ] Added : 5 causal constraints over 2 iterations in 210 ms. Result :sat
Minimization took 261 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 4, 1571, 492, 3856, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 4, 1571, 492, 3856, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 1313/1313 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 462 transition count 1309
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 462 transition count 1309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 462 transition count 1307
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 460 transition count 1303
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 460 transition count 1303
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 458 transition count 1299
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 458 transition count 1299
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 456 transition count 1293
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 456 transition count 1293
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 454 transition count 1289
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 454 transition count 1289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 452 transition count 1285
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 452 transition count 1285
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 451 transition count 1283
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 451 transition count 1283
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 450 transition count 1281
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 450 transition count 1281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 449 transition count 1279
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 449 transition count 1279
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 448 transition count 1277
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 448 transition count 1277
Applied a total of 34 rules in 150 ms. Remains 448 /464 variables (removed 16) and now considering 1277/1313 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 448/464 places, 1277/1313 transitions.
[2024-05-31 21:24:33] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {255=1, 367=1, 697=1, 728=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 364=1, 566=1, 724=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :[0, 0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 4, 1571, 492, 3856, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:24:33] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
// Phase 1: matrix 734 rows 448 cols
[2024-05-31 21:24:33] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 4, 1571, 492, 3856, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2178 ms. (458 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3369 ms. (1780 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 5, 1571, 492, 4041, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:24:39] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:24:39] [INFO ] Invariant cache hit.
[2024-05-31 21:24:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:39] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2024-05-31 21:24:39] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 21:24:39] [INFO ] [Real]Added 89 Read/Feed constraints in 36 ms returned sat
[2024-05-31 21:24:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:39] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:24:39] [INFO ] [Nat]Added 89 Read/Feed constraints in 44 ms returned sat
[2024-05-31 21:24:40] [INFO ] Deduced a trap composed of 145 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:24:40] [INFO ] Deduced a trap composed of 139 places in 192 ms of which 3 ms to minimize.
[2024-05-31 21:24:40] [INFO ] Deduced a trap composed of 99 places in 187 ms of which 5 ms to minimize.
[2024-05-31 21:24:40] [INFO ] Deduced a trap composed of 94 places in 184 ms of which 3 ms to minimize.
[2024-05-31 21:24:41] [INFO ] Deduced a trap composed of 92 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:24:41] [INFO ] Deduced a trap composed of 88 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:24:41] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 2 ms to minimize.
[2024-05-31 21:24:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1459 ms
[2024-05-31 21:24:41] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 64 ms.
[2024-05-31 21:24:41] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 2 ms to minimize.
[2024-05-31 21:24:42] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:24:42] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:24:42] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:24:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 895 ms
[2024-05-31 21:24:42] [INFO ] Added : 4 causal constraints over 2 iterations in 1107 ms. Result :sat
Minimization took 322 ms.
[2024-05-31 21:24:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:43] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:24:43] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:24:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:43] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:24:43] [INFO ] [Nat]Added 89 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:24:43] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 66 ms.
[2024-05-31 21:24:43] [INFO ] Added : 7 causal constraints over 3 iterations in 276 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:24:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Real]Added 89 Read/Feed constraints in 58 ms returned sat
[2024-05-31 21:24:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:24:44] [INFO ] [Nat]Added 89 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:24:44] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 68 ms.
[2024-05-31 21:24:44] [INFO ] Added : 12 causal constraints over 3 iterations in 238 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 21:24:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:45] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:24:45] [INFO ] [Real]Added 89 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:24:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:45] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:24:45] [INFO ] [Nat]Added 89 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:24:45] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 65 ms.
[2024-05-31 21:24:45] [INFO ] Added : 27 causal constraints over 7 iterations in 381 ms. Result :sat
Minimization took 273 ms.
[2024-05-31 21:24:46] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:46] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:24:46] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:24:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:46] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:24:46] [INFO ] [Nat]Added 89 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:24:46] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 67 ms.
[2024-05-31 21:24:47] [INFO ] Added : 5 causal constraints over 3 iterations in 258 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:24:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:24:47] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:24:47] [INFO ] [Real]Added 89 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:24:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:24:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:24:47] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:24:47] [INFO ] [Nat]Added 89 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:24:47] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 66 ms.
[2024-05-31 21:24:48] [INFO ] Added : 11 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 5, 1571, 492, 4041, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 5, 1571, 492, 4041, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1277/1277 transitions.
Applied a total of 0 rules in 46 ms. Remains 448 /448 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 448/448 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1277/1277 transitions.
Applied a total of 0 rules in 46 ms. Remains 448 /448 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2024-05-31 21:24:48] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:24:48] [INFO ] Invariant cache hit.
[2024-05-31 21:24:48] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-31 21:24:48] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:24:48] [INFO ] Invariant cache hit.
[2024-05-31 21:24:49] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 21:24:50] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2024-05-31 21:24:50] [INFO ] Redundant transitions in 25 ms returned []
Running 1275 sub problems to find dead transitions.
[2024-05-31 21:24:50] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:24:50] [INFO ] Invariant cache hit.
[2024-05-31 21:24:50] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
[2024-05-31 21:25:04] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1182 variables, and 4 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/448 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 3 (OVERLAPS) 734/1182 variables, 448/452 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 89/541 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 1275/1816 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1816 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 448/448 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints]
After SMT, in 63993ms problems are : Problem set: 0 solved, 1275 unsolved
Search for dead transitions found 0 dead transitions in 64005ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65709 ms. Remains : 448/448 places, 1277/1277 transitions.
[2024-05-31 21:25:54] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {255=1, 367=1, 697=1, 728=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 364=1, 566=1, 724=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :[0, 0, 0, 2, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 5, 1571, 492, 4041, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:25:54] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:25:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 5, 1571, 492, 4041, 5] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2342 ms. (426 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 3333 ms. (1799 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 5, 1571, 492, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:26:00] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:26:00] [INFO ] Invariant cache hit.
[2024-05-31 21:26:00] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:00] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:26:00] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 21:26:00] [INFO ] [Real]Added 89 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:26:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:00] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:26:00] [INFO ] [Nat]Added 89 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:26:00] [INFO ] Deduced a trap composed of 145 places in 200 ms of which 3 ms to minimize.
[2024-05-31 21:26:01] [INFO ] Deduced a trap composed of 139 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:26:01] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:26:01] [INFO ] Deduced a trap composed of 94 places in 179 ms of which 2 ms to minimize.
[2024-05-31 21:26:01] [INFO ] Deduced a trap composed of 92 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:26:01] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:26:02] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 3 ms to minimize.
[2024-05-31 21:26:02] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1458 ms
[2024-05-31 21:26:02] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 64 ms.
[2024-05-31 21:26:02] [INFO ] Deduced a trap composed of 90 places in 192 ms of which 2 ms to minimize.
[2024-05-31 21:26:02] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:26:02] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:26:03] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:26:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 888 ms
[2024-05-31 21:26:03] [INFO ] Added : 4 causal constraints over 2 iterations in 1092 ms. Result :sat
Minimization took 311 ms.
[2024-05-31 21:26:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:03] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:26:03] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:26:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:04] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:26:04] [INFO ] [Nat]Added 89 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:26:04] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 66 ms.
[2024-05-31 21:26:04] [INFO ] Added : 7 causal constraints over 3 iterations in 276 ms. Result :sat
Minimization took 254 ms.
[2024-05-31 21:26:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:04] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:26:04] [INFO ] [Real]Added 89 Read/Feed constraints in 72 ms returned sat
[2024-05-31 21:26:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:05] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 21:26:05] [INFO ] [Nat]Added 89 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:26:05] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 67 ms.
[2024-05-31 21:26:05] [INFO ] Added : 12 causal constraints over 3 iterations in 236 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:26:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:26:05] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:26:05] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:26:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:06] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:26:06] [INFO ] [Nat]Added 89 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:26:06] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 65 ms.
[2024-05-31 21:26:06] [INFO ] Added : 27 causal constraints over 7 iterations in 364 ms. Result :sat
Minimization took 270 ms.
[2024-05-31 21:26:06] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:07] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:26:07] [INFO ] [Real]Added 89 Read/Feed constraints in 33 ms returned sat
[2024-05-31 21:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:07] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:26:07] [INFO ] [Nat]Added 89 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:26:07] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 65 ms.
[2024-05-31 21:26:07] [INFO ] Added : 5 causal constraints over 3 iterations in 240 ms. Result :sat
Minimization took 253 ms.
[2024-05-31 21:26:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:26:08] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:26:08] [INFO ] [Real]Added 89 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:26:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:26:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:26:08] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:26:08] [INFO ] [Nat]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:26:08] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 66 ms.
[2024-05-31 21:26:08] [INFO ] Added : 11 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 5, 1571, 492, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 5, 1571, 492, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Support contains 6 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1277/1277 transitions.
Applied a total of 0 rules in 47 ms. Remains 448 /448 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 448/448 places, 1277/1277 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1277/1277 transitions.
Applied a total of 0 rules in 46 ms. Remains 448 /448 variables (removed 0) and now considering 1277/1277 (removed 0) transitions.
[2024-05-31 21:26:14] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:26:14] [INFO ] Invariant cache hit.
[2024-05-31 21:26:14] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-31 21:26:14] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:26:14] [INFO ] Invariant cache hit.
[2024-05-31 21:26:14] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 21:26:15] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1618 ms to find 0 implicit places.
[2024-05-31 21:26:15] [INFO ] Redundant transitions in 21 ms returned []
Running 1275 sub problems to find dead transitions.
[2024-05-31 21:26:15] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:26:15] [INFO ] Invariant cache hit.
[2024-05-31 21:26:15] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
[2024-05-31 21:26:29] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 1.0)
(s167 0.0)
(s168 0.0)
(s169 1.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 1.0)
(s199 1.0)
(s200 1.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 0.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 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 448/1182 variables, and 4 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/448 constraints, ReadFeed: 0/89 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/448 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 3 (OVERLAPS) 734/1182 variables, 448/452 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1182 variables, 89/541 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1182 variables, 1275/1816 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1182/1182 variables, and 1816 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 448/448 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints]
After SMT, in 64194ms problems are : Problem set: 0 solved, 1275 unsolved
Search for dead transitions found 0 dead transitions in 64205ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65896 ms. Remains : 448/448 places, 1277/1277 transitions.
[2024-05-31 21:27:19] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
Found an invariant !
This invariant on transitions {255=1, 367=1, 697=1, 728=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 364=1, 566=1, 724=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :[0, 0, 0, 2147483647, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 5, 1571, +inf, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:27:20] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:27:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 5, 1571, +inf, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2271 ms. (440 steps per ms)
FORMULA FunctionPointer-PT-c002-UpperBounds-10 +inf TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 5000004 steps (10 resets) in 2742 ms. (1822 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 5, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:27:25] [INFO ] Flow matrix only has 734 transitions (discarded 543 similar events)
[2024-05-31 21:27:25] [INFO ] Invariant cache hit.
[2024-05-31 21:27:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:25] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:27:25] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-31 21:27:25] [INFO ] [Real]Added 89 Read/Feed constraints in 35 ms returned sat
[2024-05-31 21:27:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:25] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:27:25] [INFO ] [Nat]Added 89 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:27:25] [INFO ] Deduced a trap composed of 145 places in 200 ms of which 9 ms to minimize.
[2024-05-31 21:27:26] [INFO ] Deduced a trap composed of 139 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:27:26] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:27:26] [INFO ] Deduced a trap composed of 94 places in 191 ms of which 2 ms to minimize.
[2024-05-31 21:27:26] [INFO ] Deduced a trap composed of 92 places in 183 ms of which 3 ms to minimize.
[2024-05-31 21:27:26] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:27:27] [INFO ] Deduced a trap composed of 131 places in 166 ms of which 3 ms to minimize.
[2024-05-31 21:27:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1486 ms
[2024-05-31 21:27:27] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 65 ms.
[2024-05-31 21:27:27] [INFO ] Deduced a trap composed of 90 places in 191 ms of which 3 ms to minimize.
[2024-05-31 21:27:27] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:27:27] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:27:28] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:27:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 893 ms
[2024-05-31 21:27:28] [INFO ] Added : 4 causal constraints over 2 iterations in 1105 ms. Result :sat
Minimization took 316 ms.
[2024-05-31 21:27:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:28] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2024-05-31 21:27:28] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:27:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:27:29] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:27:29] [INFO ] [Nat]Added 89 Read/Feed constraints in 20 ms returned sat
[2024-05-31 21:27:29] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 65 ms.
[2024-05-31 21:27:29] [INFO ] Added : 7 causal constraints over 3 iterations in 277 ms. Result :sat
Minimization took 264 ms.
[2024-05-31 21:27:29] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:27:29] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:27:29] [INFO ] [Real]Added 89 Read/Feed constraints in 59 ms returned sat
[2024-05-31 21:27:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:27:30] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:27:30] [INFO ] [Nat]Added 89 Read/Feed constraints in 43 ms returned sat
[2024-05-31 21:27:30] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 68 ms.
[2024-05-31 21:27:30] [INFO ] Added : 12 causal constraints over 3 iterations in 246 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 21:27:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-31 21:27:30] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:27:31] [INFO ] [Real]Added 89 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:27:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:27:31] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:27:31] [INFO ] [Nat]Added 89 Read/Feed constraints in 39 ms returned sat
[2024-05-31 21:27:31] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 70 ms.
[2024-05-31 21:27:31] [INFO ] Added : 5 causal constraints over 3 iterations in 249 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:27:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:32] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:27:32] [INFO ] [Real]Added 89 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:27:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:32] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:27:32] [INFO ] [Nat]Added 89 Read/Feed constraints in 34 ms returned sat
[2024-05-31 21:27:32] [INFO ] Computed and/alt/rep : 225/1324/218 causal constraints (skipped 514 transitions) in 67 ms.
[2024-05-31 21:27:32] [INFO ] Added : 11 causal constraints over 4 iterations in 280 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 5, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 5, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1277/1277 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 447 transition count 1275
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 447 transition count 1275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 447 transition count 1273
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 446 transition count 1271
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 446 transition count 1271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 445 transition count 1269
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 445 transition count 1269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 444 transition count 1265
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 444 transition count 1265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 443 transition count 1263
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 443 transition count 1263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 442 transition count 1261
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 442 transition count 1261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 441 transition count 1259
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 441 transition count 1259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 440 transition count 1257
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 440 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 439 transition count 1255
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 439 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 438 transition count 1253
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 438 transition count 1253
Applied a total of 22 rules in 144 ms. Remains 438 /448 variables (removed 10) and now considering 1253/1277 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 438/448 places, 1253/1277 transitions.
[2024-05-31 21:27:37] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {224=1, 326=1, 527=1, 708=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 683=1, 714=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 5, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:27:37] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
// Phase 1: matrix 718 rows 438 cols
[2024-05-31 21:27:37] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 5, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2150 ms. (464 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 2756 ms. (1813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:27:42] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:27:42] [INFO ] Invariant cache hit.
[2024-05-31 21:27:42] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:43] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:27:43] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:27:43] [INFO ] [Real]Added 86 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:27:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:43] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:27:43] [INFO ] [Nat]Added 86 Read/Feed constraints in 52 ms returned sat
[2024-05-31 21:27:43] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2024-05-31 21:27:43] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 61 ms.
[2024-05-31 21:27:43] [INFO ] Deduced a trap composed of 131 places in 185 ms of which 3 ms to minimize.
[2024-05-31 21:27:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-31 21:27:44] [INFO ] Added : 7 causal constraints over 3 iterations in 482 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:27:44] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:44] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2024-05-31 21:27:44] [INFO ] [Real]Added 86 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:27:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:44] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:27:44] [INFO ] [Nat]Added 86 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:27:45] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 2 ms to minimize.
[2024-05-31 21:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2024-05-31 21:27:45] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 63 ms.
[2024-05-31 21:27:45] [INFO ] Added : 4 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 260 ms.
[2024-05-31 21:27:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:45] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:27:45] [INFO ] [Real]Added 86 Read/Feed constraints in 55 ms returned sat
[2024-05-31 21:27:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:46] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:27:46] [INFO ] [Nat]Added 86 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:27:46] [INFO ] Deduced a trap composed of 82 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-31 21:27:46] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 65 ms.
[2024-05-31 21:27:46] [INFO ] Added : 11 causal constraints over 4 iterations in 274 ms. Result :sat
Minimization took 259 ms.
[2024-05-31 21:27:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:47] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:27:47] [INFO ] [Real]Added 86 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:47] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:27:47] [INFO ] [Nat]Added 86 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:27:47] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2024-05-31 21:27:47] [INFO ] Deduced a trap composed of 74 places in 178 ms of which 3 ms to minimize.
[2024-05-31 21:27:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 434 ms
[2024-05-31 21:27:47] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 64 ms.
[2024-05-31 21:27:48] [INFO ] Added : 5 causal constraints over 2 iterations in 225 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 21:27:48] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Real]Added 86 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:27:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:27:48] [INFO ] [Nat]Added 86 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 89 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-31 21:27:49] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 65 ms.
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 88 places in 189 ms of which 3 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 3 ms to minimize.
[2024-05-31 21:27:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 674 ms
[2024-05-31 21:27:49] [INFO ] Added : 4 causal constraints over 1 iterations in 882 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 44 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 438/438 places, 1253/1253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 55 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 21:27:59] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:27:59] [INFO ] Invariant cache hit.
[2024-05-31 21:28:00] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 21:28:00] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:00] [INFO ] Invariant cache hit.
[2024-05-31 21:28:00] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:28:01] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1595 ms to find 0 implicit places.
[2024-05-31 21:28:01] [INFO ] Redundant transitions in 20 ms returned []
Running 1251 sub problems to find dead transitions.
[2024-05-31 21:28:01] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:01] [INFO ] Invariant cache hit.
[2024-05-31 21:28:01] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
[2024-05-31 21:28:15] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
At refinement iteration 3 (OVERLAPS) 718/1156 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
SMT process timed out in 34271ms, After SMT, problems are : Problem set: 0 solved, 1251 unsolved
Search for dead transitions found 0 dead transitions in 34282ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35959 ms. Remains : 438/438 places, 1253/1253 transitions.
[2024-05-31 21:28:35] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {224=1, 326=1, 527=1, 708=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 683=1, 714=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:28:36] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2163 ms. (462 steps per ms)
BEST_FIRST walk for 5000002 steps (10 resets) in 2740 ms. (1824 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
[2024-05-31 21:28:41] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:41] [INFO ] Invariant cache hit.
[2024-05-31 21:28:41] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:41] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:28:41] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:28:41] [INFO ] [Real]Added 86 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:28:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:41] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:28:41] [INFO ] [Nat]Added 86 Read/Feed constraints in 61 ms returned sat
[2024-05-31 21:28:41] [INFO ] Deduced a trap composed of 80 places in 186 ms of which 3 ms to minimize.
[2024-05-31 21:28:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 21:28:41] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 65 ms.
[2024-05-31 21:28:42] [INFO ] Deduced a trap composed of 131 places in 182 ms of which 3 ms to minimize.
[2024-05-31 21:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-31 21:28:42] [INFO ] Added : 7 causal constraints over 3 iterations in 478 ms. Result :sat
Minimization took 257 ms.
[2024-05-31 21:28:42] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:28:42] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:28:42] [INFO ] [Real]Added 86 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:28:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:42] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:28:43] [INFO ] [Nat]Added 86 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:28:43] [INFO ] Deduced a trap composed of 89 places in 184 ms of which 3 ms to minimize.
[2024-05-31 21:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-31 21:28:43] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 65 ms.
[2024-05-31 21:28:43] [INFO ] Added : 4 causal constraints over 1 iterations in 174 ms. Result :sat
Minimization took 261 ms.
[2024-05-31 21:28:43] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:43] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:28:43] [INFO ] [Real]Added 86 Read/Feed constraints in 59 ms returned sat
[2024-05-31 21:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:44] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:28:44] [INFO ] [Nat]Added 86 Read/Feed constraints in 47 ms returned sat
[2024-05-31 21:28:44] [INFO ] Deduced a trap composed of 82 places in 190 ms of which 3 ms to minimize.
[2024-05-31 21:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
[2024-05-31 21:28:44] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 63 ms.
[2024-05-31 21:28:44] [INFO ] Added : 11 causal constraints over 4 iterations in 273 ms. Result :sat
Minimization took 262 ms.
[2024-05-31 21:28:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:45] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-31 21:28:45] [INFO ] [Real]Added 86 Read/Feed constraints in 30 ms returned sat
[2024-05-31 21:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:45] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:28:45] [INFO ] [Nat]Added 86 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:28:45] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 3 ms to minimize.
[2024-05-31 21:28:45] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 3 ms to minimize.
[2024-05-31 21:28:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 441 ms
[2024-05-31 21:28:46] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 71 ms.
[2024-05-31 21:28:46] [INFO ] Added : 5 causal constraints over 2 iterations in 229 ms. Result :sat
Minimization took 263 ms.
[2024-05-31 21:28:46] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:46] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:28:46] [INFO ] [Real]Added 86 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:28:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:28:46] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:28:47] [INFO ] [Nat]Added 86 Read/Feed constraints in 38 ms returned sat
[2024-05-31 21:28:47] [INFO ] Deduced a trap composed of 89 places in 193 ms of which 3 ms to minimize.
[2024-05-31 21:28:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-31 21:28:47] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 68 ms.
[2024-05-31 21:28:47] [INFO ] Deduced a trap composed of 88 places in 197 ms of which 3 ms to minimize.
[2024-05-31 21:28:47] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 2 ms to minimize.
[2024-05-31 21:28:48] [INFO ] Deduced a trap composed of 79 places in 177 ms of which 3 ms to minimize.
[2024-05-31 21:28:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 685 ms
[2024-05-31 21:28:48] [INFO ] Added : 4 causal constraints over 1 iterations in 893 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Support contains 5 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 43 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 438/438 places, 1253/1253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 43 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 21:28:58] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:58] [INFO ] Invariant cache hit.
[2024-05-31 21:28:58] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-31 21:28:58] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:58] [INFO ] Invariant cache hit.
[2024-05-31 21:28:58] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:28:59] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
[2024-05-31 21:28:59] [INFO ] Redundant transitions in 18 ms returned []
Running 1251 sub problems to find dead transitions.
[2024-05-31 21:28:59] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:28:59] [INFO ] Invariant cache hit.
[2024-05-31 21:28:59] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
[2024-05-31 21:29:13] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
At refinement iteration 3 (OVERLAPS) 718/1156 variables, 438/442 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
SMT process timed out in 34001ms, After SMT, problems are : Problem set: 0 solved, 1251 unsolved
Search for dead transitions found 0 dead transitions in 34012ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35627 ms. Remains : 438/438 places, 1253/1253 transitions.
[2024-05-31 21:29:33] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
Found an invariant !
This invariant on transitions {224=1, 326=1, 527=1, 708=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 354=1, 683=1, 714=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :[0, 0, 0, 0, 0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
RANDOM walk for 40002 steps (8 resets) in 1162 ms. (34 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 212402 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 5
Probabilistic random walk after 212402 steps, saw 133848 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) properties seen :0
[2024-05-31 21:29:37] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:29:37] [INFO ] Invariant cache hit.
[2024-05-31 21:29:37] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 380/400 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/409 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 614/1023 variables, 346/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1023 variables, 84/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 62/1085 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1085 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 70/1155 variables, 69/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1155 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/1156 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1156 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1156 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1156/1156 variables, and 527 constraints, problems are : Problem set: 0 solved, 5 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 438/438 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 380/400 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/409 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 614/1023 variables, 346/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 84/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1023 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1023 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 62/1085 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1085 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 70/1155 variables, 69/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1155 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/1156 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1156 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1156 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1156/1156 variables, and 532 constraints, problems are : Problem set: 0 solved, 5 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 438/438 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1544ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 5 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 45 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 438/438 places, 1253/1253 transitions.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 68 ms. (579 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 266738 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 5
Probabilistic random walk after 266738 steps, saw 167164 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-31 21:30:12] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:30:12] [INFO ] Invariant cache hit.
[2024-05-31 21:30:12] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 380/400 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 9/409 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 614/1023 variables, 346/372 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1023 variables, 84/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 62/1085 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1085 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 70/1155 variables, 69/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1155 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1/1156 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1156 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1156 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1156/1156 variables, and 527 constraints, problems are : Problem set: 0 solved, 5 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 438/438 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 380/400 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 9/409 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 614/1023 variables, 346/375 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 84/459 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1023 variables, 2/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1023 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 62/1085 variables, 1/462 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1085 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 70/1155 variables, 69/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1155 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1/1156 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1156 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/1156 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1156/1156 variables, and 532 constraints, problems are : Problem set: 0 solved, 5 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 438/438 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1554ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 30001 ms.
Support contains 5 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 49 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 438/438 places, 1253/1253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Applied a total of 0 rules in 49 ms. Remains 438 /438 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2024-05-31 21:30:44] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:30:44] [INFO ] Invariant cache hit.
[2024-05-31 21:30:44] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-31 21:30:44] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:30:44] [INFO ] Invariant cache hit.
[2024-05-31 21:30:44] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:30:45] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1598 ms to find 0 implicit places.
[2024-05-31 21:30:45] [INFO ] Redundant transitions in 16 ms returned []
Running 1251 sub problems to find dead transitions.
[2024-05-31 21:30:45] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:30:45] [INFO ] Invariant cache hit.
[2024-05-31 21:30:45] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/438 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
[2024-05-31 21:30:59] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/438 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/438 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1251 unsolved
SMT process timed out in 34216ms, After SMT, problems are : Problem set: 0 solved, 1251 unsolved
Search for dead transitions found 0 dead transitions in 34237ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35911 ms. Remains : 438/438 places, 1253/1253 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 1333, 1571, 4041, 1365] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Starting property specific reduction for FunctionPointer-PT-c002-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:31:19] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:31:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10003 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:31:19] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:31:19] [INFO ] Invariant cache hit.
[2024-05-31 21:31:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:20] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:31:20] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:31:20] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:31:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:20] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:31:20] [INFO ] [Nat]Added 86 Read/Feed constraints in 41 ms returned sat
[2024-05-31 21:31:20] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 66 ms.
[2024-05-31 21:31:20] [INFO ] Added : 2 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 434 transition count 1243
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 434 transition count 1243
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 431 transition count 1235
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 431 transition count 1235
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 428 transition count 1229
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 428 transition count 1229
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 425 transition count 1223
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 425 transition count 1223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 422 transition count 1217
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 422 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 419 transition count 1211
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 419 transition count 1211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 417 transition count 1207
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 417 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 416 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 416 transition count 1205
Applied a total of 44 rules in 111 ms. Remains 416 /438 variables (removed 22) and now considering 1205/1253 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 416/438 places, 1205/1253 transitions.
[2024-05-31 21:31:21] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:31:21] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
// Phase 1: matrix 680 rows 416 cols
[2024-05-31 21:31:21] [INFO ] Computed 3 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2044 ms. (488 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:31:23] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:31:23] [INFO ] Invariant cache hit.
[2024-05-31 21:31:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:24] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:31:24] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:31:24] [INFO ] [Real]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:31:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:31:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:31:24] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-31 21:31:24] [INFO ] [Nat]Added 75 Read/Feed constraints in 49 ms returned sat
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 71 places in 172 ms of which 2 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 3 ms to minimize.
[2024-05-31 21:31:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 391 ms
[2024-05-31 21:31:24] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 61 ms.
[2024-05-31 21:31:25] [INFO ] Deduced a trap composed of 132 places in 171 ms of which 2 ms to minimize.
[2024-05-31 21:31:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2024-05-31 21:31:25] [INFO ] Added : 4 causal constraints over 2 iterations in 420 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 41 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 21:31:25] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:31:25] [INFO ] Invariant cache hit.
[2024-05-31 21:31:25] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-31 21:31:25] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:31:25] [INFO ] Invariant cache hit.
[2024-05-31 21:31:26] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:31:26] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
[2024-05-31 21:31:26] [INFO ] Redundant transitions in 20 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 21:31:26] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:31:26] [INFO ] Invariant cache hit.
[2024-05-31 21:31:26] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 21:31:39] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 33524ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 33534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34965 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 21:32:00] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:32:00] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1999 ms. (500 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 523 ms. (1908 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:32:03] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:03] [INFO ] Invariant cache hit.
[2024-05-31 21:32:03] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-31 21:32:03] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:32:03] [INFO ] [Real]Added 75 Read/Feed constraints in 25 ms returned sat
[2024-05-31 21:32:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2024-05-31 21:32:03] [INFO ] [Nat]Added 75 Read/Feed constraints in 48 ms returned sat
[2024-05-31 21:32:04] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 3 ms to minimize.
[2024-05-31 21:32:04] [INFO ] Deduced a trap composed of 74 places in 169 ms of which 3 ms to minimize.
[2024-05-31 21:32:04] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2024-05-31 21:32:04] [INFO ] Deduced a trap composed of 135 places in 149 ms of which 2 ms to minimize.
[2024-05-31 21:32:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 790 ms
[2024-05-31 21:32:04] [INFO ] Computed and/alt/rep : 333/1252/331 causal constraints (skipped 347 transitions) in 61 ms.
[2024-05-31 21:32:04] [INFO ] Added : 6 causal constraints over 2 iterations in 189 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 40 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 39 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 21:32:05] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:05] [INFO ] Invariant cache hit.
[2024-05-31 21:32:05] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-31 21:32:05] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:05] [INFO ] Invariant cache hit.
[2024-05-31 21:32:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:32:06] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-31 21:32:06] [INFO ] Redundant transitions in 14 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 21:32:06] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:06] [INFO ] Invariant cache hit.
[2024-05-31 21:32:06] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 21:32:19] [INFO ] Deduced a trap composed of 131 places in 141 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34076ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34086ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35479 ms. Remains : 416/416 places, 1205/1205 transitions.
[2024-05-31 21:32:40] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
Found an invariant !
This invariant on transitions {219=1, 303=1, 501=1, 675=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {256=1, 340=1, 666=1, 678=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 513550 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 513550 steps, saw 318493 distinct states, run finished after 3003 ms. (steps per millisecond=171 ) properties seen :0
[2024-05-31 21:32:43] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:43] [INFO ] Invariant cache hit.
[2024-05-31 21:32:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:32:44] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 891ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 44 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 416/416 places, 1205/1205 transitions.
RANDOM walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 508346 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 508346 steps, saw 315301 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-31 21:32:47] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:47] [INFO ] Invariant cache hit.
[2024-05-31 21:32:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1014 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 68/1082 variables, 66/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1082 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1090 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1090 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1096 variables, 4/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1096 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1096/1096 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/348 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/354 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 598/952 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/952 variables, 74/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/952 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/952 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1014 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:32:48] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1082 variables, 66/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1082 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/1090 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1090 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/1096 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1096 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1096/1096 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 416/416 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 891ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 54 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 416/416 places, 1205/1205 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 1205/1205 transitions.
Applied a total of 0 rules in 50 ms. Remains 416 /416 variables (removed 0) and now considering 1205/1205 (removed 0) transitions.
[2024-05-31 21:32:48] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:48] [INFO ] Invariant cache hit.
[2024-05-31 21:32:49] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 21:32:49] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:49] [INFO ] Invariant cache hit.
[2024-05-31 21:32:49] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:32:50] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1420 ms to find 0 implicit places.
[2024-05-31 21:32:50] [INFO ] Redundant transitions in 20 ms returned []
Running 1203 sub problems to find dead transitions.
[2024-05-31 21:32:50] [INFO ] Flow matrix only has 680 transitions (discarded 525 similar events)
[2024-05-31 21:32:50] [INFO ] Invariant cache hit.
[2024-05-31 21:32:50] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
[2024-05-31 21:33:04] [INFO ] Deduced a trap composed of 131 places in 162 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/416 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/416 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
At refinement iteration 3 (OVERLAPS) 680/1096 variables, 416/420 constraints. Problems are: Problem set: 0 solved, 1203 unsolved
SMT process timed out in 34760ms, After SMT, problems are : Problem set: 0 solved, 1203 unsolved
Search for dead transitions found 0 dead transitions in 34773ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36270 ms. Remains : 416/416 places, 1205/1205 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 525 transitions
Reduce isomorphic transitions removed 525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 536 rules applied. Total rules applied 536 place count 416 transition count 669
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 548 place count 405 transition count 668
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 549 place count 404 transition count 668
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 549 place count 404 transition count 600
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 685 place count 336 transition count 600
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 939 place count 209 transition count 473
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 1003 place count 145 transition count 345
Iterating global reduction 3 with 64 rules applied. Total rules applied 1067 place count 145 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1068 place count 145 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1068 place count 145 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1070 place count 144 transition count 343
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1133 place count 81 transition count 217
Iterating global reduction 4 with 63 rules applied. Total rules applied 1196 place count 81 transition count 217
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1259 place count 18 transition count 91
Iterating global reduction 4 with 63 rules applied. Total rules applied 1322 place count 18 transition count 91
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1385 place count 18 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1385 place count 18 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1387 place count 17 transition count 27
Applied a total of 1387 rules in 67 ms. Remains 17 /416 variables (removed 399) and now considering 27/1205 (removed 1178) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 17 cols
[2024-05-31 21:33:25] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:33:25] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:33:25] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:33:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:33:25] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:33:25] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:33:25] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:33:25] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 132 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c002-UpperBounds-00 in 125361 ms.
Starting property specific reduction for FunctionPointer-PT-c002-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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:33:25] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
// Phase 1: matrix 718 rows 438 cols
[2024-05-31 21:33:25] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:33:25] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:33:25] [INFO ] Invariant cache hit.
[2024-05-31 21:33:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:25] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:33:25] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:33:25] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:33:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:25] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-31 21:33:25] [INFO ] [Nat]Added 86 Read/Feed constraints in 21 ms returned sat
[2024-05-31 21:33:25] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 75 ms.
[2024-05-31 21:33:26] [INFO ] Added : 21 causal constraints over 5 iterations in 378 ms. Result :sat
Minimization took 298 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Graph (complete) has 2161 edges and 438 vertex of which 435 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 432 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 432 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 430 transition count 1236
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 428 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 424 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 422 transition count 1220
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 421 transition count 1218
Applied a total of 34 rules in 159 ms. Remains 421 /438 variables (removed 17) and now considering 1218/1253 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 421/438 places, 1218/1253 transitions.
[2024-05-31 21:33:26] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:33:27] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
// Phase 1: matrix 688 rows 421 cols
[2024-05-31 21:33:27] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2227 ms. (448 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 602 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:33:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:33:29] [INFO ] Invariant cache hit.
[2024-05-31 21:33:29] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-31 21:33:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:33:30] [INFO ] [Real]Added 75 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:33:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:33:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-31 21:33:30] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2024-05-31 21:33:30] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 87 ms.
[2024-05-31 21:33:30] [INFO ] Added : 13 causal constraints over 5 iterations in 339 ms. Result :sat
Minimization took 268 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 53 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 61 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:33:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-31 21:33:31] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:33:31] [INFO ] Invariant cache hit.
[2024-05-31 21:33:31] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:33:32] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1641 ms to find 0 implicit places.
[2024-05-31 21:33:32] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:33:32] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:33:32] [INFO ] Invariant cache hit.
[2024-05-31 21:33:32] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:33:47] [INFO ] Deduced a trap composed of 131 places in 164 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34926ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34938ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36667 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 21:34:07] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:34:08] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2386 ms. (418 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 655 ms. (1524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:34:11] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:11] [INFO ] Invariant cache hit.
[2024-05-31 21:34:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:11] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:34:11] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:34:11] [INFO ] [Real]Added 75 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:34:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:11] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:34:11] [INFO ] [Nat]Added 75 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 2 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2024-05-31 21:34:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 411 ms
[2024-05-31 21:34:12] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 82 ms.
[2024-05-31 21:34:12] [INFO ] Added : 15 causal constraints over 5 iterations in 346 ms. Result :sat
Minimization took 306 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 59 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 45 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:34:12] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:12] [INFO ] Invariant cache hit.
[2024-05-31 21:34:13] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 21:34:13] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:13] [INFO ] Invariant cache hit.
[2024-05-31 21:34:13] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:34:14] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
[2024-05-31 21:34:14] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:34:14] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:14] [INFO ] Invariant cache hit.
[2024-05-31 21:34:14] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:34:28] [INFO ] Deduced a trap composed of 131 places in 156 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.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 1.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.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 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 1.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 35074ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 35087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36806 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 21:34:49] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:34:49] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2077 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 535 ms. (1865 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-31 21:34:52] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:52] [INFO ] Invariant cache hit.
[2024-05-31 21:34:52] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:52] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:34:52] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:34:52] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:34:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:34:52] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:34:52] [INFO ] [Nat]Added 75 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:34:53] [INFO ] Deduced a trap composed of 70 places in 188 ms of which 3 ms to minimize.
[2024-05-31 21:34:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
[2024-05-31 21:34:53] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 354 transitions) in 61 ms.
[2024-05-31 21:34:53] [INFO ] Added : 9 causal constraints over 3 iterations in 245 ms. Result :sat
Minimization took 240 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 44 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:34:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:53] [INFO ] Invariant cache hit.
[2024-05-31 21:34:54] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-31 21:34:54] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:54] [INFO ] Invariant cache hit.
[2024-05-31 21:34:54] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:34:55] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2024-05-31 21:34:55] [INFO ] Redundant transitions in 20 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:34:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:34:55] [INFO ] Invariant cache hit.
[2024-05-31 21:34:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:35:08] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34384ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36058 ms. Remains : 421/421 places, 1218/1218 transitions.
[2024-05-31 21:35:29] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Found an invariant !
This invariant on transitions {233=1, 324=1, 522=1, 683=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 343=1, 541=1, 684=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40005 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 509451 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 509451 steps, saw 312389 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2024-05-31 21:35:33] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:35:33] [INFO ] Invariant cache hit.
[2024-05-31 21:35:33] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 543ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 41 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
RANDOM walk for 40001 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502637 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502637 steps, saw 308211 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-31 21:35:36] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:35:36] [INFO ] Invariant cache hit.
[2024-05-31 21:35:36] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/378 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 604/982 variables, 337/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/982 variables, 74/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 65/1109 variables, 66/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 352/371 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 604/982 variables, 337/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/982 variables, 74/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/982 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1044 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 65/1109 variables, 66/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1109 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 299 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 42 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 51 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2024-05-31 21:35:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:35:37] [INFO ] Invariant cache hit.
[2024-05-31 21:35:37] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-31 21:35:37] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:35:37] [INFO ] Invariant cache hit.
[2024-05-31 21:35:37] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:35:39] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-05-31 21:35:39] [INFO ] Redundant transitions in 19 ms returned []
Running 1216 sub problems to find dead transitions.
[2024-05-31 21:35:39] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2024-05-31 21:35:39] [INFO ] Invariant cache hit.
[2024-05-31 21:35:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
[2024-05-31 21:35:52] [INFO ] Deduced a trap composed of 131 places in 142 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 34570ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 34580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36257 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 950 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1014 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1078 place count 147 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1079 place count 147 transition count 349
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1142 place count 84 transition count 223
Iterating global reduction 3 with 63 rules applied. Total rules applied 1205 place count 84 transition count 223
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1268 place count 21 transition count 97
Iterating global reduction 3 with 63 rules applied. Total rules applied 1331 place count 21 transition count 97
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1394 place count 21 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1394 place count 21 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1398 place count 19 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1399 place count 19 transition count 31
Applied a total of 1399 rules in 21 ms. Remains 19 /421 variables (removed 402) and now considering 31/1218 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:36:13] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:36:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:36:13] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 21:36:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:36:13] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:13] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:36:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:36:13] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:13] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:36:13] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:36:13] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 92 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c002-UpperBounds-02 in 168400 ms.
Starting property specific reduction for FunctionPointer-PT-c002-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:36:13] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
// Phase 1: matrix 718 rows 438 cols
[2024-05-31 21:36:13] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:36:13] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:36:13] [INFO ] Invariant cache hit.
[2024-05-31 21:36:13] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:36:13] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2024-05-31 21:36:13] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:36:14] [INFO ] [Real]Added 86 Read/Feed constraints in 27 ms returned sat
[2024-05-31 21:36:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:36:14] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:36:14] [INFO ] [Nat]Added 86 Read/Feed constraints in 17 ms returned sat
[2024-05-31 21:36:14] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 65 ms.
[2024-05-31 21:36:14] [INFO ] Added : 4 causal constraints over 1 iterations in 170 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Graph (complete) has 2161 edges and 438 vertex of which 435 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 432 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 432 transition count 1240
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 430 transition count 1234
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 430 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 428 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 428 transition count 1230
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 426 transition count 1226
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 426 transition count 1226
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 424 transition count 1222
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 424 transition count 1222
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 422 transition count 1218
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 422 transition count 1218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 420 transition count 1214
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 420 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 419 transition count 1212
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 419 transition count 1212
Applied a total of 38 rules in 107 ms. Remains 419 /438 variables (removed 19) and now considering 1212/1253 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 419/438 places, 1212/1253 transitions.
[2024-05-31 21:36:14] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:36:15] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
// Phase 1: matrix 685 rows 419 cols
[2024-05-31 21:36:15] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000002 steps (2 resets) in 2191 ms. (456 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 544 ms. (1834 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 21:36:17] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:17] [INFO ] Invariant cache hit.
[2024-05-31 21:36:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:36:18] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-31 21:36:18] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:36:18] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:36:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-31 21:36:18] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-31 21:36:18] [INFO ] [Nat]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:36:18] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 3 ms to minimize.
[2024-05-31 21:36:18] [INFO ] Deduced a trap composed of 70 places in 175 ms of which 2 ms to minimize.
[2024-05-31 21:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 418 ms
[2024-05-31 21:36:18] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 61 ms.
[2024-05-31 21:36:19] [INFO ] Added : 17 causal constraints over 5 iterations in 351 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:36:19] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:19] [INFO ] Invariant cache hit.
[2024-05-31 21:36:19] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 21:36:19] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:19] [INFO ] Invariant cache hit.
[2024-05-31 21:36:19] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:36:21] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1587 ms to find 0 implicit places.
[2024-05-31 21:36:21] [INFO ] Redundant transitions in 16 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:36:21] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:21] [INFO ] Invariant cache hit.
[2024-05-31 21:36:21] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:36:34] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34487ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34497ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36152 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 21:36:55] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 21:36:55] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2101 ms. (475 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 569 ms. (1754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[7] Max Struct:[+inf]
[2024-05-31 21:36:58] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:36:58] [INFO ] Invariant cache hit.
[2024-05-31 21:36:58] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:36:58] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-05-31 21:36:58] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:36:58] [INFO ] [Real]Added 75 Read/Feed constraints in 28 ms returned sat
[2024-05-31 21:36:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:36:59] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:36:59] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 3 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 2 ms to minimize.
[2024-05-31 21:36:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 448 ms
[2024-05-31 21:36:59] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 351 transitions) in 63 ms.
[2024-05-31 21:36:59] [INFO ] Added : 17 causal constraints over 5 iterations in 356 ms. Result :sat
Minimization took 258 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7] Max Struct:[+inf]
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 41 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 42 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:37:00] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:00] [INFO ] Invariant cache hit.
[2024-05-31 21:37:00] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-05-31 21:37:00] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:00] [INFO ] Invariant cache hit.
[2024-05-31 21:37:00] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:37:01] [INFO ] Implicit Places using invariants and state equation in 1277 ms returned []
Implicit Place search using SMT with State Equation took 1575 ms to find 0 implicit places.
[2024-05-31 21:37:01] [INFO ] Redundant transitions in 19 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:37:01] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:01] [INFO ] Invariant cache hit.
[2024-05-31 21:37:01] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34406ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34417ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36059 ms. Remains : 419/419 places, 1212/1212 transitions.
[2024-05-31 21:37:36] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
Found an invariant !
This invariant on transitions {252=1, 340=1, 538=1, 680=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {250=1, 338=1, 664=1, 683=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[7] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463536 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463536 steps, saw 284237 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-31 21:37:39] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:39] [INFO ] Invariant cache hit.
[2024-05-31 21:37:39] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 809ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 65 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 419/419 places, 1212/1212 transitions.
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 467734 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 467734 steps, saw 286813 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-31 21:37:43] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:43] [INFO ] Invariant cache hit.
[2024-05-31 21:37:43] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/361 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 605/966 variables, 337/350 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 74/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1028 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1028 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1098 variables, 68/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1098 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1104 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1104/1104 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 350/354 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/361 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 605/966 variables, 337/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/966 variables, 74/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/966 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1028 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1028 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 70/1098 variables, 68/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1098 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1104 variables, 4/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1104 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1104/1104 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 419/419 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 613ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 419 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 49 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 419/419 places, 1212/1212 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 419/419 places, 1212/1212 transitions.
Applied a total of 0 rules in 46 ms. Remains 419 /419 variables (removed 0) and now considering 1212/1212 (removed 0) transitions.
[2024-05-31 21:37:44] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:44] [INFO ] Invariant cache hit.
[2024-05-31 21:37:44] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-31 21:37:44] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:44] [INFO ] Invariant cache hit.
[2024-05-31 21:37:44] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:37:45] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2024-05-31 21:37:45] [INFO ] Redundant transitions in 20 ms returned []
Running 1210 sub problems to find dead transitions.
[2024-05-31 21:37:45] [INFO ] Flow matrix only has 685 transitions (discarded 527 similar events)
[2024-05-31 21:37:45] [INFO ] Invariant cache hit.
[2024-05-31 21:37:45] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
[2024-05-31 21:37:59] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/419 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 3 (OVERLAPS) 685/1104 variables, 419/423 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
SMT process timed out in 34805ms, After SMT, problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 34818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36483 ms. Remains : 419/419 places, 1212/1212 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 527 transitions
Reduce isomorphic transitions removed 527 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 419 transition count 673
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 551 place count 407 transition count 673
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 551 place count 407 transition count 604
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 689 place count 338 transition count 604
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 945 place count 210 transition count 476
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1009 place count 146 transition count 348
Iterating global reduction 2 with 64 rules applied. Total rules applied 1073 place count 146 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1074 place count 146 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1074 place count 146 transition count 346
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1076 place count 145 transition count 346
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1139 place count 82 transition count 220
Iterating global reduction 3 with 63 rules applied. Total rules applied 1202 place count 82 transition count 220
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1265 place count 19 transition count 94
Iterating global reduction 3 with 63 rules applied. Total rules applied 1328 place count 19 transition count 94
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1391 place count 19 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1391 place count 19 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1393 place count 18 transition count 30
Applied a total of 1393 rules in 22 ms. Remains 18 /419 variables (removed 401) and now considering 30/1212 (removed 1182) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 18 cols
[2024-05-31 21:38:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:38:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:38:20] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:38:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:38:20] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:38:20] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:38:20] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:38:20] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[7] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c002-UpperBounds-04 in 127125 ms.
Starting property specific reduction for FunctionPointer-PT-c002-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:20] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
// Phase 1: matrix 718 rows 438 cols
[2024-05-31 21:38:20] [INFO ] Computed 3 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:20] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:38:20] [INFO ] Invariant cache hit.
[2024-05-31 21:38:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:21] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-31 21:38:21] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:38:21] [INFO ] [Real]Added 86 Read/Feed constraints in 26 ms returned sat
[2024-05-31 21:38:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-31 21:38:21] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-31 21:38:21] [INFO ] [Nat]Added 86 Read/Feed constraints in 22 ms returned sat
[2024-05-31 21:38:21] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 69 ms.
[2024-05-31 21:38:21] [INFO ] Added : 4 causal constraints over 2 iterations in 220 ms. Result :sat
Minimization took 322 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Graph (complete) has 2161 edges and 438 vertex of which 435 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 432 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 432 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 429 transition count 1232
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 429 transition count 1232
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 426 transition count 1226
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 426 transition count 1226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 423 transition count 1220
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 423 transition count 1220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 420 transition count 1214
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 420 transition count 1214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 417 transition count 1208
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 417 transition count 1208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 415 transition count 1204
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 415 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 414 transition count 1202
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 414 transition count 1202
Applied a total of 48 rules in 108 ms. Remains 414 /438 variables (removed 24) and now considering 1202/1253 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 414/438 places, 1202/1253 transitions.
[2024-05-31 21:38:22] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:22] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
// Phase 1: matrix 678 rows 414 cols
[2024-05-31 21:38:22] [INFO ] Computed 3 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 2135 ms. (468 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 602 ms. (1658 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:38:25] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:38:25] [INFO ] Invariant cache hit.
[2024-05-31 21:38:25] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:25] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2024-05-31 21:38:25] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:38:25] [INFO ] [Real]Added 74 Read/Feed constraints in 51 ms returned sat
[2024-05-31 21:38:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:25] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2024-05-31 21:38:25] [INFO ] [Nat]Added 74 Read/Feed constraints in 32 ms returned sat
[2024-05-31 21:38:25] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 85 ms.
[2024-05-31 21:38:25] [INFO ] Added : 3 causal constraints over 2 iterations in 204 ms. Result :sat
Minimization took 247 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 45 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 44 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 21:38:26] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:38:26] [INFO ] Invariant cache hit.
[2024-05-31 21:38:26] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 21:38:26] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:38:26] [INFO ] Invariant cache hit.
[2024-05-31 21:38:26] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:38:27] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
[2024-05-31 21:38:27] [INFO ] Redundant transitions in 21 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 21:38:27] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:38:27] [INFO ] Invariant cache hit.
[2024-05-31 21:38:27] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 21:38:41] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/418 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34764ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34776ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36404 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 21:39:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:39:02] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2096 ms. (476 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 554 ms. (1801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-31 21:39:05] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:05] [INFO ] Invariant cache hit.
[2024-05-31 21:39:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:05] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:39:05] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:39:05] [INFO ] [Real]Added 74 Read/Feed constraints in 42 ms returned sat
[2024-05-31 21:39:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:05] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-05-31 21:39:06] [INFO ] [Nat]Added 74 Read/Feed constraints in 45 ms returned sat
[2024-05-31 21:39:06] [INFO ] Deduced a trap composed of 73 places in 182 ms of which 2 ms to minimize.
[2024-05-31 21:39:06] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 3 ms to minimize.
[2024-05-31 21:39:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 443 ms
[2024-05-31 21:39:06] [INFO ] Computed and/alt/rep : 333/1251/331 causal constraints (skipped 345 transitions) in 71 ms.
[2024-05-31 21:39:06] [INFO ] Added : 8 causal constraints over 4 iterations in 304 ms. Result :sat
Minimization took 321 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 414/414 places, 1202/1202 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 42 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
[2024-05-31 21:39:07] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:07] [INFO ] Invariant cache hit.
[2024-05-31 21:39:07] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-31 21:39:07] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:07] [INFO ] Invariant cache hit.
[2024-05-31 21:39:07] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-31 21:39:08] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2024-05-31 21:39:08] [INFO ] Redundant transitions in 16 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-05-31 21:39:08] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:08] [INFO ] Invariant cache hit.
[2024-05-31 21:39:08] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-31 21:39:22] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 3 (OVERLAPS) 678/1092 variables, 414/418 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 34328ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 34338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35951 ms. Remains : 414/414 places, 1202/1202 transitions.
[2024-05-31 21:39:43] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
Found an invariant !
This invariant on transitions {222=1, 307=1, 504=1, 674=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 337=1, 534=1, 674=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520624 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520624 steps, saw 319240 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-31 21:39:46] [INFO ] Flow matrix only has 678 transitions (discarded 524 similar events)
[2024-05-31 21:39:46] [INFO ] Invariant cache hit.
[2024-05-31 21:39:46] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1011 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 67/1078 variables, 65/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1078 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1086 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1086 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1092 variables, 4/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1092 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1092/1092 variables, and 491 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 343/347 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/353 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 596/949 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 74/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1011 variables, 1/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1011 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 67/1078 variables, 65/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1078 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1086 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1086 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1092 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1092 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1092/1092 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1202/1202 transitions.
Applied a total of 0 rules in 41 ms. Remains 414 /414 variables (removed 0) and now considering 1202/1202 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 414/414 places, 1202/1202 transitions.
RANDOM walk for 36737 steps (8 resets) in 130 ms. (280 steps per ms) remains 0/1 properties
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c002-UpperBounds-13 in 86300 ms.
Starting property specific reduction for FunctionPointer-PT-c002-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:39:47] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
// Phase 1: matrix 718 rows 438 cols
[2024-05-31 21:39:47] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:39:47] [INFO ] Flow matrix only has 718 transitions (discarded 535 similar events)
[2024-05-31 21:39:47] [INFO ] Invariant cache hit.
[2024-05-31 21:39:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:47] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2024-05-31 21:39:47] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-05-31 21:39:47] [INFO ] [Real]Added 86 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:39:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:47] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2024-05-31 21:39:47] [INFO ] [Nat]Added 86 Read/Feed constraints in 19 ms returned sat
[2024-05-31 21:39:47] [INFO ] Computed and/alt/rep : 342/2315/342 causal constraints (skipped 374 transitions) in 64 ms.
[2024-05-31 21:39:48] [INFO ] Added : 24 causal constraints over 6 iterations in 342 ms. Result :sat
Minimization took 275 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1253/1253 transitions.
Graph (complete) has 2161 edges and 438 vertex of which 435 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 435 transition count 1248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 432 transition count 1242
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 432 transition count 1242
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 430 transition count 1236
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 430 transition count 1236
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 428 transition count 1232
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 428 transition count 1232
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 426 transition count 1228
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 426 transition count 1228
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 424 transition count 1224
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 424 transition count 1224
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 422 transition count 1220
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 422 transition count 1220
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 421 transition count 1218
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 421 transition count 1218
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 420 transition count 1216
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 420 transition count 1216
Applied a total of 36 rules in 110 ms. Remains 420 /438 variables (removed 18) and now considering 1216/1253 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 420/438 places, 1216/1253 transitions.
[2024-05-31 21:39:48] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:39:48] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
// Phase 1: matrix 687 rows 420 cols
[2024-05-31 21:39:48] [INFO ] Computed 3 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 2062 ms. (484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 545 ms. (1831 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2024-05-31 21:39:51] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:39:51] [INFO ] Invariant cache hit.
[2024-05-31 21:39:51] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:51] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-31 21:39:51] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:51] [INFO ] [Real]Added 75 Read/Feed constraints in 24 ms returned sat
[2024-05-31 21:39:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:39:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-31 21:39:51] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-31 21:39:51] [INFO ] [Nat]Added 75 Read/Feed constraints in 29 ms returned sat
[2024-05-31 21:39:51] [INFO ] Computed and/alt/rep : 332/1248/332 causal constraints (skipped 353 transitions) in 62 ms.
[2024-05-31 21:39:52] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 3 ms to minimize.
[2024-05-31 21:39:52] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 3 ms to minimize.
[2024-05-31 21:39:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 424 ms
[2024-05-31 21:39:52] [INFO ] Added : 10 causal constraints over 3 iterations in 674 ms. Result :sat
Minimization took 259 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[+inf]
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 55 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 41 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:39:52] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:39:52] [INFO ] Invariant cache hit.
[2024-05-31 21:39:53] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-31 21:39:53] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:39:53] [INFO ] Invariant cache hit.
[2024-05-31 21:39:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:39:54] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1530 ms to find 0 implicit places.
[2024-05-31 21:39:54] [INFO ] Redundant transitions in 18 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:39:54] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:39:54] [INFO ] Invariant cache hit.
[2024-05-31 21:39:54] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:40:07] [INFO ] Deduced a trap composed of 131 places in 137 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 33759ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 33769ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35370 ms. Remains : 420/420 places, 1216/1216 transitions.
[2024-05-31 21:40:28] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
Found an invariant !
This invariant on transitions {244=1, 334=1, 660=1, 685=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {252=1, 342=1, 668=1, 685=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :[0]
Current structural bounds on expressions (after cover walk) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505403 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505403 steps, saw 309907 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-31 21:40:31] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:40:31] [INFO ] Invariant cache hit.
[2024-05-31 21:40:31] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 531ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 43 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 420/420 places, 1216/1216 transitions.
RANDOM walk for 40002 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 482617 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :0 out of 1
Probabilistic random walk after 482617 steps, saw 295936 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
[2024-05-31 21:40:35] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:40:35] [INFO ] Invariant cache hit.
[2024-05-31 21:40:35] [INFO ] State equation strengthened by 75 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/372 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/372 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 605/977 variables, 337/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/977 variables, 74/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1039 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1039 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/1107 variables, 68/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1107 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1107 variables, and 498 constraints, problems are : Problem set: 0 solved, 1 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/13 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 352/365 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/372 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/372 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/372 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 605/977 variables, 337/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 74/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/977 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 62/1039 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1039 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 68/1107 variables, 68/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1107 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1107 variables, and 499 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 420/420 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 570ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 420/420 places, 1216/1216 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 1216/1216 transitions.
Applied a total of 0 rules in 40 ms. Remains 420 /420 variables (removed 0) and now considering 1216/1216 (removed 0) transitions.
[2024-05-31 21:40:35] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:40:35] [INFO ] Invariant cache hit.
[2024-05-31 21:40:36] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-31 21:40:36] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:40:36] [INFO ] Invariant cache hit.
[2024-05-31 21:40:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-31 21:40:37] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1455 ms to find 0 implicit places.
[2024-05-31 21:40:37] [INFO ] Redundant transitions in 20 ms returned []
Running 1214 sub problems to find dead transitions.
[2024-05-31 21:40:37] [INFO ] Flow matrix only has 687 transitions (discarded 529 similar events)
[2024-05-31 21:40:37] [INFO ] Invariant cache hit.
[2024-05-31 21:40:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
[2024-05-31 21:40:50] [INFO ] Deduced a trap composed of 131 places in 138 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
At refinement iteration 3 (OVERLAPS) 687/1107 variables, 420/424 constraints. Problems are: Problem set: 0 solved, 1214 unsolved
SMT process timed out in 34302ms, After SMT, problems are : Problem set: 0 solved, 1214 unsolved
Search for dead transitions found 0 dead transitions in 34313ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35833 ms. Remains : 420/420 places, 1216/1216 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 529 transitions
Reduce isomorphic transitions removed 529 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 539 rules applied. Total rules applied 539 place count 420 transition count 677
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 549 place count 410 transition count 677
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 549 place count 410 transition count 605
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 693 place count 338 transition count 605
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 947 place count 211 transition count 478
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1011 place count 147 transition count 350
Iterating global reduction 2 with 64 rules applied. Total rules applied 1075 place count 147 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1077 place count 147 transition count 348
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 84 transition count 222
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 84 transition count 222
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1266 place count 21 transition count 96
Iterating global reduction 3 with 63 rules applied. Total rules applied 1329 place count 21 transition count 96
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1392 place count 21 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1392 place count 21 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1394 place count 20 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1396 place count 19 transition count 31
Applied a total of 1396 rules in 19 ms. Remains 19 /420 variables (removed 401) and now considering 31/1216 (removed 1185) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 19 cols
[2024-05-31 21:41:11] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:41:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:41:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 21:41:11] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 21:41:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:41:11] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:41:11] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:41:11] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 84 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[+inf]
Ending property specific reduction for FunctionPointer-PT-c002-UpperBounds-14 in 84535 ms.
[2024-05-31 21:41:11] [INFO ] Flatten gal took : 109 ms
[2024-05-31 21:41:11] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:41:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 438 places, 1253 transitions and 5140 arcs took 9 ms.
Total runtime 1189654 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-c002-UpperBounds-00
Could not compute solution for formula : FunctionPointer-PT-c002-UpperBounds-02
Could not compute solution for formula : FunctionPointer-PT-c002-UpperBounds-04
Could not compute solution for formula : FunctionPointer-PT-c002-UpperBounds-13
Could not compute solution for formula : FunctionPointer-PT-c002-UpperBounds-14

BK_STOP 1717191672238

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name FunctionPointer-PT-c002-UpperBounds-00
ub formula formula --maxsum=/tmp/1938/ub_0_
ub formula name FunctionPointer-PT-c002-UpperBounds-02
ub formula formula --maxsum=/tmp/1938/ub_1_
ub formula name FunctionPointer-PT-c002-UpperBounds-04
ub formula formula --maxsum=/tmp/1938/ub_2_
ub formula name FunctionPointer-PT-c002-UpperBounds-13
ub formula formula --maxsum=/tmp/1938/ub_3_
ub formula name FunctionPointer-PT-c002-UpperBounds-14
ub formula formula --maxsum=/tmp/1938/ub_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="FunctionPointer-PT-c002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-c002, 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 r496-tall-171640603000277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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