About the Execution of GreatSPN+red for CANInsertWithFailure-PT-050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
14975.191 | 3600000.00 | 4141772.00 | 6781.90 | ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r069-tall-171620503900133.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 greatspnxred
Input is CANInsertWithFailure-PT-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503900133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716398387207
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:19:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 17:19:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:19:49] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2024-05-22 17:19:49] [INFO ] Transformed 5604 places.
[2024-05-22 17:19:49] [INFO ] Transformed 15300 transitions.
[2024-05-22 17:19:49] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 15300 rows 5604 cols
[2024-05-22 17:19:50] [INFO ] Computed 53 invariants in 1218 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1]
RANDOM walk for 10000 steps (7 resets) in 196 ms. (50 steps per ms)
FORMULA CANInsertWithFailure-PT-050-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150014 steps (30 resets) in 200 ms. (746 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-22 17:19:51] [INFO ] Invariant cache hit.
[2024-05-22 17:19:51] [INFO ] [Real]Absence check using 51 positive place invariants in 132 ms returned sat
[2024-05-22 17:19:51] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-22 17:19:56] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:19:56] [INFO ] [Real]Absence check using 51 positive place invariants in 129 ms returned sat
[2024-05-22 17:19:56] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 46 ms returned sat
[2024-05-22 17:20:00] [INFO ] [Real]Absence check using state equation in 4175 ms returned sat
[2024-05-22 17:20:01] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2024-05-22 17:20:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:01] [INFO ] [Real]Absence check using 51 positive place invariants in 119 ms returned sat
[2024-05-22 17:20:01] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:06] [INFO ] [Real]Absence check using state equation in 4238 ms returned unknown
[2024-05-22 17:20:06] [INFO ] [Real]Absence check using 51 positive place invariants in 106 ms returned sat
[2024-05-22 17:20:06] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:11] [INFO ] [Real]Absence check using state equation in 4294 ms returned sat
[2024-05-22 17:20:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:11] [INFO ] [Real]Absence check using 51 positive place invariants in 113 ms returned sat
[2024-05-22 17:20:12] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:16] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:16] [INFO ] [Real]Absence check using 51 positive place invariants in 116 ms returned sat
[2024-05-22 17:20:16] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-22 17:20:21] [INFO ] [Real]Absence check using state equation in 4352 ms returned sat
[2024-05-22 17:20:21] [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: Broken pipe ... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:21] [INFO ] [Real]Absence check using 51 positive place invariants in 101 ms returned sat
[2024-05-22 17:20:21] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:26] [INFO ] [Real]Absence check using state equation in 4249 ms returned sat
[2024-05-22 17:20:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:26] [INFO ] [Real]Absence check using 51 positive place invariants in 99 ms returned sat
[2024-05-22 17:20:26] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-22 17:20:31] [INFO ] [Real]Absence check using state equation in 4398 ms returned unknown
[2024-05-22 17:20:32] [INFO ] [Real]Absence check using 51 positive place invariants in 100 ms returned sat
[2024-05-22 17:20:32] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 47 ms returned sat
[2024-05-22 17:20:36] [INFO ] [Real]Absence check using state equation in 4246 ms returned sat
[2024-05-22 17:20:36] [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: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:37] [INFO ] [Real]Absence check using 51 positive place invariants in 111 ms returned sat
[2024-05-22 17:20:37] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:41] [INFO ] [Real]Absence check using state equation in 4282 ms returned unknown
[2024-05-22 17:20:41] [INFO ] [Real]Absence check using 51 positive place invariants in 98 ms returned sat
[2024-05-22 17:20:42] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 45 ms returned sat
[2024-05-22 17:20:46] [INFO ] [Real]Absence check using state equation in 4358 ms returned unknown
[2024-05-22 17:20:47] [INFO ] [Real]Absence check using 51 positive place invariants in 106 ms returned sat
[2024-05-22 17:20:47] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 56 ms returned sat
[2024-05-22 17:20:51] [INFO ] [Real]Absence check using state equation in 4233 ms returned unknown
[2024-05-22 17:20:52] [INFO ] [Real]Absence check using 51 positive place invariants in 102 ms returned sat
[2024-05-22 17:20:52] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 43 ms returned sat
[2024-05-22 17:20:56] [INFO ] [Real]Absence check using state equation in 4322 ms returned sat
[2024-05-22 17:20:56] [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: Broken pipe ... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:860)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 17:20:57] [INFO ] [Real]Absence check using 51 positive place invariants in 97 ms returned sat
[2024-05-22 17:20:57] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-22 17:21:01] [INFO ] [Real]Absence check using state equation in 4343 ms returned unknown
[2024-05-22 17:21:02] [INFO ] [Real]Absence check using 51 positive place invariants in 104 ms returned sat
[2024-05-22 17:21:02] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 44 ms returned sat
[2024-05-22 17:21:06] [INFO ] [Real]Absence check using state equation in 4343 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 5604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.25 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 350 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 699 place count 5254 transition count 14951
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 699 place count 5254 transition count 14950
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 701 place count 5253 transition count 14950
Performed 2438 Post agglomeration using F-continuation condition.Transition count delta: 2438
Deduced a syphon composed of 2438 places in 11 ms
Reduce places removed 2438 places and 0 transitions.
Iterating global reduction 2 with 4876 rules applied. Total rules applied 5577 place count 2815 transition count 12512
Drop transitions (Redundant composition of simpler transitions.) removed 2341 transitions
Redundant transition composition rules discarded 2341 transitions
Iterating global reduction 2 with 2341 rules applied. Total rules applied 7918 place count 2815 transition count 10171
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7919 place count 2815 transition count 10170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7920 place count 2814 transition count 10170
Partial Free-agglomeration rule applied 2549 times.
Drop transitions (Partial Free agglomeration) removed 2549 transitions
Iterating global reduction 3 with 2549 rules applied. Total rules applied 10469 place count 2814 transition count 10170
Partial Free-agglomeration rule applied 50 times.
Drop transitions (Partial Free agglomeration) removed 50 transitions
Iterating global reduction 3 with 50 rules applied. Total rules applied 10519 place count 2814 transition count 10170
Applied a total of 10519 rules in 5410 ms. Remains 2814 /5604 variables (removed 2790) and now considering 10170/15300 (removed 5130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5452 ms. Remains : 2814/5604 places, 10170/15300 transitions.
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:21:12] [INFO ] Computed 52 invariants in 410 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4321 resets) in 15404 ms. (64 steps per ms)
BEST_FIRST walk for 15000014 steps (1025 resets) in 23589 ms. (635 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-22 17:21:51] [INFO ] Invariant cache hit.
[2024-05-22 17:21:51] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:21:51] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 17:21:53] [INFO ] [Real]Absence check using state equation in 1919 ms returned sat
[2024-05-22 17:21:54] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:21:55] [INFO ] [Real]Added 9984 Read/Feed constraints in 1031 ms returned sat
[2024-05-22 17:21:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:21:55] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:21:55] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:21:57] [INFO ] [Nat]Absence check using state equation in 1990 ms returned sat
[2024-05-22 17:21:58] [INFO ] [Nat]Added 9984 Read/Feed constraints in 860 ms returned sat
[2024-05-22 17:21:59] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 632 ms.
[2024-05-22 17:22:01] [INFO ] Added : 8 causal constraints over 2 iterations in 2264 ms. Result :sat
Minimization took 5691 ms.
[2024-05-22 17:22:07] [INFO ] [Real]Absence check using 50 positive place invariants in 106 ms returned sat
[2024-05-22 17:22:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-22 17:22:09] [INFO ] [Real]Absence check using state equation in 1970 ms returned sat
[2024-05-22 17:22:10] [INFO ] [Real]Added 9984 Read/Feed constraints in 802 ms returned sat
[2024-05-22 17:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-22 17:22:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 40 ms returned sat
[2024-05-22 17:22:12] [INFO ] [Nat]Absence check using state equation in 1983 ms returned sat
[2024-05-22 17:22:14] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1617 ms returned sat
[2024-05-22 17:22:15] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 701 ms.
[2024-05-22 17:22:17] [INFO ] Added : 10 causal constraints over 2 iterations in 2256 ms. Result :sat
Minimization took 5610 ms.
[2024-05-22 17:22:23] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:22:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-22 17:22:25] [INFO ] [Real]Absence check using state equation in 1996 ms returned sat
[2024-05-22 17:22:26] [INFO ] [Real]Added 9984 Read/Feed constraints in 989 ms returned sat
[2024-05-22 17:22:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:22:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:22:28] [INFO ] [Nat]Absence check using state equation in 2202 ms returned sat
[2024-05-22 17:22:30] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1138 ms returned sat
[2024-05-22 17:22:30] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 607 ms.
[2024-05-22 17:22:32] [INFO ] Added : 8 causal constraints over 2 iterations in 2095 ms. Result :sat
Minimization took 5571 ms.
[2024-05-22 17:22:38] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:22:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:22:40] [INFO ] [Real]Absence check using state equation in 2006 ms returned sat
[2024-05-22 17:22:41] [INFO ] [Real]Added 9984 Read/Feed constraints in 850 ms returned sat
[2024-05-22 17:22:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:22:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:22:43] [INFO ] [Nat]Absence check using state equation in 1889 ms returned sat
[2024-05-22 17:22:44] [INFO ] [Nat]Added 9984 Read/Feed constraints in 871 ms returned sat
[2024-05-22 17:22:45] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 547 ms.
[2024-05-22 17:22:46] [INFO ] Added : 8 causal constraints over 2 iterations in 1953 ms. Result :sat
Minimization took 5615 ms.
[2024-05-22 17:22:52] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:22:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:22:54] [INFO ] [Real]Absence check using state equation in 1974 ms returned sat
[2024-05-22 17:22:55] [INFO ] [Real]Added 9984 Read/Feed constraints in 846 ms returned sat
[2024-05-22 17:22:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:22:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:22:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:22:58] [INFO ] [Nat]Absence check using state equation in 1986 ms returned sat
[2024-05-22 17:22:59] [INFO ] [Nat]Added 9984 Read/Feed constraints in 962 ms returned sat
[2024-05-22 17:23:00] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 571 ms.
[2024-05-22 17:23:01] [INFO ] Added : 7 causal constraints over 2 iterations in 2186 ms. Result :sat
Minimization took 7739 ms.
[2024-05-22 17:23:09] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:23:09] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:23:11] [INFO ] [Real]Absence check using state equation in 2052 ms returned sat
[2024-05-22 17:23:12] [INFO ] [Real]Added 9984 Read/Feed constraints in 952 ms returned sat
[2024-05-22 17:23:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:23:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:23:15] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2024-05-22 17:23:16] [INFO ] [Nat]Added 9984 Read/Feed constraints in 888 ms returned sat
[2024-05-22 17:23:17] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 519 ms.
[2024-05-22 17:23:18] [INFO ] Added : 6 causal constraints over 2 iterations in 1912 ms. Result :sat
Minimization took 5683 ms.
[2024-05-22 17:23:24] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:23:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:23:26] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2024-05-22 17:23:27] [INFO ] [Real]Added 9984 Read/Feed constraints in 802 ms returned sat
[2024-05-22 17:23:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 50 ms returned sat
[2024-05-22 17:23:28] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:23:30] [INFO ] [Nat]Absence check using state equation in 2020 ms returned sat
[2024-05-22 17:23:31] [INFO ] [Nat]Added 9984 Read/Feed constraints in 929 ms returned sat
[2024-05-22 17:23:31] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 524 ms.
[2024-05-22 17:23:33] [INFO ] Added : 11 causal constraints over 3 iterations in 2377 ms. Result :sat
Minimization took 5617 ms.
[2024-05-22 17:23:39] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:23:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:23:41] [INFO ] [Real]Absence check using state equation in 1976 ms returned sat
[2024-05-22 17:23:42] [INFO ] [Real]Added 9984 Read/Feed constraints in 796 ms returned sat
[2024-05-22 17:23:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:23:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:23:45] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2024-05-22 17:23:46] [INFO ] [Nat]Added 9984 Read/Feed constraints in 881 ms returned sat
[2024-05-22 17:23:46] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 495 ms.
[2024-05-22 17:23:48] [INFO ] Added : 8 causal constraints over 2 iterations in 1926 ms. Result :sat
Minimization took 5769 ms.
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:23:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:23:56] [INFO ] [Real]Absence check using state equation in 2014 ms returned sat
[2024-05-22 17:23:57] [INFO ] [Real]Added 9984 Read/Feed constraints in 870 ms returned sat
[2024-05-22 17:23:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:23:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:23:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:23:59] [INFO ] [Nat]Absence check using state equation in 2024 ms returned sat
[2024-05-22 17:24:00] [INFO ] [Nat]Added 9984 Read/Feed constraints in 897 ms returned sat
[2024-05-22 17:24:01] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 483 ms.
[2024-05-22 17:24:02] [INFO ] Added : 8 causal constraints over 2 iterations in 1879 ms. Result :sat
Minimization took 5610 ms.
[2024-05-22 17:24:08] [INFO ] [Real]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-22 17:24:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:24:10] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2024-05-22 17:24:12] [INFO ] [Real]Added 9984 Read/Feed constraints in 870 ms returned sat
[2024-05-22 17:24:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2024-05-22 17:24:12] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:24:14] [INFO ] [Nat]Absence check using state equation in 1994 ms returned sat
[2024-05-22 17:24:15] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1031 ms returned sat
[2024-05-22 17:24:16] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 513 ms.
[2024-05-22 17:24:17] [INFO ] Added : 9 causal constraints over 2 iterations in 1967 ms. Result :sat
Minimization took 5690 ms.
[2024-05-22 17:24:23] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:24:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:24:25] [INFO ] [Real]Absence check using state equation in 1988 ms returned sat
[2024-05-22 17:24:26] [INFO ] [Real]Added 9984 Read/Feed constraints in 964 ms returned sat
[2024-05-22 17:24:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 77 ms returned sat
[2024-05-22 17:24:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:24:29] [INFO ] [Nat]Absence check using state equation in 2005 ms returned sat
[2024-05-22 17:24:30] [INFO ] [Nat]Added 9984 Read/Feed constraints in 914 ms returned sat
[2024-05-22 17:24:31] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 450 ms.
[2024-05-22 17:24:32] [INFO ] Added : 8 causal constraints over 2 iterations in 1937 ms. Result :sat
Minimization took 5631 ms.
[2024-05-22 17:24:38] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:24:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:24:40] [INFO ] [Real]Absence check using state equation in 1981 ms returned sat
[2024-05-22 17:24:41] [INFO ] [Real]Added 9984 Read/Feed constraints in 839 ms returned sat
[2024-05-22 17:24:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 50 ms returned sat
[2024-05-22 17:24:42] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:24:44] [INFO ] [Nat]Absence check using state equation in 1922 ms returned sat
[2024-05-22 17:24:46] [INFO ] [Nat]Added 9984 Read/Feed constraints in 2637 ms returned sat
[2024-05-22 17:24:47] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 487 ms.
[2024-05-22 17:24:49] [INFO ] Added : 14 causal constraints over 3 iterations in 2313 ms. Result :sat
Minimization took 5597 ms.
[2024-05-22 17:24:55] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:24:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:24:57] [INFO ] [Real]Absence check using state equation in 1986 ms returned sat
[2024-05-22 17:24:58] [INFO ] [Real]Added 9984 Read/Feed constraints in 817 ms returned sat
[2024-05-22 17:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:24:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 53 ms returned sat
[2024-05-22 17:24:58] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:25:00] [INFO ] [Nat]Absence check using state equation in 2013 ms returned sat
[2024-05-22 17:25:01] [INFO ] [Nat]Added 9984 Read/Feed constraints in 855 ms returned sat
[2024-05-22 17:25:02] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 479 ms.
[2024-05-22 17:25:03] [INFO ] Added : 7 causal constraints over 2 iterations in 1909 ms. Result :sat
Minimization took 5694 ms.
[2024-05-22 17:25:09] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:25:09] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:25:11] [INFO ] [Real]Absence check using state equation in 1947 ms returned sat
[2024-05-22 17:25:12] [INFO ] [Real]Added 9984 Read/Feed constraints in 833 ms returned sat
[2024-05-22 17:25:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:25:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:25:15] [INFO ] [Nat]Absence check using state equation in 2033 ms returned sat
[2024-05-22 17:25:15] [INFO ] [Nat]Added 9984 Read/Feed constraints in 842 ms returned sat
[2024-05-22 17:25:16] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 464 ms.
[2024-05-22 17:25:18] [INFO ] Added : 8 causal constraints over 2 iterations in 1911 ms. Result :sat
Minimization took 5688 ms.
[2024-05-22 17:25:24] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:25:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:25:26] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2024-05-22 17:25:27] [INFO ] [Real]Added 9984 Read/Feed constraints in 842 ms returned sat
[2024-05-22 17:25:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:25:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:25:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2024-05-22 17:25:29] [INFO ] [Nat]Absence check using state equation in 2005 ms returned sat
[2024-05-22 17:25:30] [INFO ] [Nat]Added 9984 Read/Feed constraints in 922 ms returned sat
[2024-05-22 17:25:31] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 497 ms.
[2024-05-22 17:25:32] [INFO ] Added : 8 causal constraints over 2 iterations in 1942 ms. Result :sat
Minimization took 5761 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 416 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 415 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-22 17:25:39] [INFO ] Invariant cache hit.
[2024-05-22 17:25:43] [INFO ] Implicit Places using invariants in 3856 ms returned []
Implicit Place search using SMT only with invariants took 3858 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-22 17:25:43] [INFO ] Invariant cache hit.
[2024-05-22 17:25:43] [INFO ] State equation strengthened by 9984 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 44949ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 45120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49452 ms. Remains : 2814/2814 places, 10170/10170 transitions.
[2024-05-22 17:26:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
RANDOM walk for 1000000 steps (4328 resets) in 16342 ms. (61 steps per ms)
BEST_FIRST walk for 15000015 steps (1030 resets) in 24644 ms. (608 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
[2024-05-22 17:27:09] [INFO ] Invariant cache hit.
[2024-05-22 17:27:09] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:27:09] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:27:11] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2024-05-22 17:27:12] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:27:12] [INFO ] [Real]Added 9984 Read/Feed constraints in 881 ms returned sat
[2024-05-22 17:27:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:27:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:27:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:27:15] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2024-05-22 17:27:16] [INFO ] [Nat]Added 9984 Read/Feed constraints in 957 ms returned sat
[2024-05-22 17:27:17] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 556 ms.
[2024-05-22 17:27:18] [INFO ] Added : 8 causal constraints over 2 iterations in 2130 ms. Result :sat
Minimization took 6124 ms.
[2024-05-22 17:27:25] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:27:25] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:27:27] [INFO ] [Real]Absence check using state equation in 2001 ms returned sat
[2024-05-22 17:27:28] [INFO ] [Real]Added 9984 Read/Feed constraints in 827 ms returned sat
[2024-05-22 17:27:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:27:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:27:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:27:31] [INFO ] [Nat]Absence check using state equation in 2298 ms returned sat
[2024-05-22 17:27:33] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1879 ms returned sat
[2024-05-22 17:27:34] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 602 ms.
[2024-05-22 17:27:35] [INFO ] Added : 10 causal constraints over 2 iterations in 2340 ms. Result :sat
Minimization took 5878 ms.
[2024-05-22 17:27:41] [INFO ] [Real]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-22 17:27:42] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:27:44] [INFO ] [Real]Absence check using state equation in 2060 ms returned sat
[2024-05-22 17:27:45] [INFO ] [Real]Added 9984 Read/Feed constraints in 876 ms returned sat
[2024-05-22 17:27:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:27:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:27:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:27:47] [INFO ] [Nat]Absence check using state equation in 1968 ms returned sat
[2024-05-22 17:27:48] [INFO ] [Nat]Added 9984 Read/Feed constraints in 951 ms returned sat
[2024-05-22 17:27:49] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 482 ms.
[2024-05-22 17:27:50] [INFO ] Added : 8 causal constraints over 2 iterations in 1997 ms. Result :sat
Minimization took 6847 ms.
[2024-05-22 17:27:58] [INFO ] [Real]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 17:27:58] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:28:00] [INFO ] [Real]Absence check using state equation in 1952 ms returned sat
[2024-05-22 17:28:01] [INFO ] [Real]Added 9984 Read/Feed constraints in 877 ms returned sat
[2024-05-22 17:28:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:28:01] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:28:03] [INFO ] [Nat]Absence check using state equation in 2062 ms returned sat
[2024-05-22 17:28:04] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1032 ms returned sat
[2024-05-22 17:28:05] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 591 ms.
[2024-05-22 17:28:07] [INFO ] Added : 8 causal constraints over 2 iterations in 2174 ms. Result :sat
Minimization took 6917 ms.
[2024-05-22 17:28:14] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:28:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:28:16] [INFO ] [Real]Absence check using state equation in 2307 ms returned sat
[2024-05-22 17:28:17] [INFO ] [Real]Added 9984 Read/Feed constraints in 998 ms returned sat
[2024-05-22 17:28:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:28:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:28:20] [INFO ] [Nat]Absence check using state equation in 2169 ms returned sat
[2024-05-22 17:28:21] [INFO ] [Nat]Added 9984 Read/Feed constraints in 907 ms returned sat
[2024-05-22 17:28:22] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 560 ms.
[2024-05-22 17:28:23] [INFO ] Added : 7 causal constraints over 2 iterations in 2122 ms. Result :sat
Minimization took 6908 ms.
[2024-05-22 17:28:31] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:28:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-22 17:28:33] [INFO ] [Real]Absence check using state equation in 2138 ms returned sat
[2024-05-22 17:28:34] [INFO ] [Real]Added 9984 Read/Feed constraints in 927 ms returned sat
[2024-05-22 17:28:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:28:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:28:37] [INFO ] [Nat]Absence check using state equation in 2149 ms returned sat
[2024-05-22 17:28:37] [INFO ] [Nat]Added 9984 Read/Feed constraints in 885 ms returned sat
[2024-05-22 17:28:38] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 547 ms.
[2024-05-22 17:28:40] [INFO ] Added : 6 causal constraints over 2 iterations in 1981 ms. Result :sat
Minimization took 6426 ms.
[2024-05-22 17:28:46] [INFO ] [Real]Absence check using 50 positive place invariants in 55 ms returned sat
[2024-05-22 17:28:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:28:48] [INFO ] [Real]Absence check using state equation in 2093 ms returned sat
[2024-05-22 17:28:49] [INFO ] [Real]Added 9984 Read/Feed constraints in 787 ms returned sat
[2024-05-22 17:28:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:28:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:28:50] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:28:52] [INFO ] [Nat]Absence check using state equation in 2028 ms returned sat
[2024-05-22 17:28:53] [INFO ] [Nat]Added 9984 Read/Feed constraints in 838 ms returned sat
[2024-05-22 17:28:54] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 539 ms.
[2024-05-22 17:28:55] [INFO ] Added : 11 causal constraints over 3 iterations in 2368 ms. Result :sat
Minimization took 6443 ms.
[2024-05-22 17:29:02] [INFO ] [Real]Absence check using 50 positive place invariants in 67 ms returned sat
[2024-05-22 17:29:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:29:04] [INFO ] [Real]Absence check using state equation in 1942 ms returned sat
[2024-05-22 17:29:05] [INFO ] [Real]Added 9984 Read/Feed constraints in 791 ms returned sat
[2024-05-22 17:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:29:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:29:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-22 17:29:08] [INFO ] [Nat]Absence check using state equation in 1998 ms returned sat
[2024-05-22 17:29:09] [INFO ] [Nat]Added 9984 Read/Feed constraints in 888 ms returned sat
[2024-05-22 17:29:09] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 505 ms.
[2024-05-22 17:29:11] [INFO ] Added : 8 causal constraints over 2 iterations in 1978 ms. Result :sat
Minimization took 6570 ms.
[2024-05-22 17:29:18] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:29:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:29:20] [INFO ] [Real]Absence check using state equation in 1967 ms returned sat
[2024-05-22 17:29:21] [INFO ] [Real]Added 9984 Read/Feed constraints in 837 ms returned sat
[2024-05-22 17:29:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:29:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:29:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:29:23] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2024-05-22 17:29:24] [INFO ] [Nat]Added 9984 Read/Feed constraints in 884 ms returned sat
[2024-05-22 17:29:25] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 523 ms.
[2024-05-22 17:29:26] [INFO ] Added : 8 causal constraints over 2 iterations in 1974 ms. Result :sat
Minimization took 6538 ms.
[2024-05-22 17:29:33] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:29:33] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:29:35] [INFO ] [Real]Absence check using state equation in 1967 ms returned sat
[2024-05-22 17:29:36] [INFO ] [Real]Added 9984 Read/Feed constraints in 842 ms returned sat
[2024-05-22 17:29:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:29:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:29:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:29:39] [INFO ] [Nat]Absence check using state equation in 2009 ms returned sat
[2024-05-22 17:29:40] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1028 ms returned sat
[2024-05-22 17:29:40] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 517 ms.
[2024-05-22 17:29:42] [INFO ] Added : 9 causal constraints over 2 iterations in 2009 ms. Result :sat
Minimization took 6215 ms.
[2024-05-22 17:29:49] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:29:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:29:51] [INFO ] [Real]Absence check using state equation in 2020 ms returned sat
[2024-05-22 17:29:52] [INFO ] [Real]Added 9984 Read/Feed constraints in 969 ms returned sat
[2024-05-22 17:29:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:29:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:29:52] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 17:29:54] [INFO ] [Nat]Absence check using state equation in 2057 ms returned sat
[2024-05-22 17:29:55] [INFO ] [Nat]Added 9984 Read/Feed constraints in 922 ms returned sat
[2024-05-22 17:29:56] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 493 ms.
[2024-05-22 17:29:57] [INFO ] Added : 8 causal constraints over 2 iterations in 2002 ms. Result :sat
Minimization took 6221 ms.
[2024-05-22 17:30:04] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:30:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:30:06] [INFO ] [Real]Absence check using state equation in 1950 ms returned sat
[2024-05-22 17:30:07] [INFO ] [Real]Added 9984 Read/Feed constraints in 934 ms returned sat
[2024-05-22 17:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:30:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 17:30:10] [INFO ] [Nat]Absence check using state equation in 2089 ms returned sat
[2024-05-22 17:30:12] [INFO ] [Nat]Added 9984 Read/Feed constraints in 2749 ms returned sat
[2024-05-22 17:30:13] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 563 ms.
[2024-05-22 17:30:15] [INFO ] Added : 14 causal constraints over 3 iterations in 2541 ms. Result :sat
Minimization took 6194 ms.
[2024-05-22 17:30:22] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:30:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:30:24] [INFO ] [Real]Absence check using state equation in 2093 ms returned sat
[2024-05-22 17:30:25] [INFO ] [Real]Added 9984 Read/Feed constraints in 881 ms returned sat
[2024-05-22 17:30:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:30:25] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:30:28] [INFO ] [Nat]Absence check using state equation in 2179 ms returned sat
[2024-05-22 17:30:29] [INFO ] [Nat]Added 9984 Read/Feed constraints in 874 ms returned sat
[2024-05-22 17:30:29] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 557 ms.
[2024-05-22 17:30:31] [INFO ] Added : 7 causal constraints over 2 iterations in 2000 ms. Result :sat
Minimization took 5750 ms.
[2024-05-22 17:30:37] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:30:37] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:30:39] [INFO ] [Real]Absence check using state equation in 2098 ms returned sat
[2024-05-22 17:30:40] [INFO ] [Real]Added 9984 Read/Feed constraints in 930 ms returned sat
[2024-05-22 17:30:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:30:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:30:43] [INFO ] [Nat]Absence check using state equation in 1987 ms returned sat
[2024-05-22 17:30:43] [INFO ] [Nat]Added 9984 Read/Feed constraints in 855 ms returned sat
[2024-05-22 17:30:44] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 524 ms.
[2024-05-22 17:30:46] [INFO ] Added : 8 causal constraints over 2 iterations in 2007 ms. Result :sat
Minimization took 5762 ms.
[2024-05-22 17:30:52] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:30:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:30:54] [INFO ] [Real]Absence check using state equation in 2127 ms returned sat
[2024-05-22 17:30:55] [INFO ] [Real]Added 9984 Read/Feed constraints in 953 ms returned sat
[2024-05-22 17:30:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:30:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:30:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:30:58] [INFO ] [Nat]Absence check using state equation in 2308 ms returned sat
[2024-05-22 17:30:59] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1040 ms returned sat
[2024-05-22 17:31:00] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 550 ms.
[2024-05-22 17:31:01] [INFO ] Added : 8 causal constraints over 2 iterations in 2107 ms. Result :sat
Minimization took 7871 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 410 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 417 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-22 17:31:10] [INFO ] Invariant cache hit.
[2024-05-22 17:31:14] [INFO ] Implicit Places using invariants in 3669 ms returned []
Implicit Place search using SMT only with invariants took 3672 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-22 17:31:14] [INFO ] Invariant cache hit.
[2024-05-22 17:31:14] [INFO ] State equation strengthened by 9984 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 44111ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 44215ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48337 ms. Remains : 2814/2814 places, 10170/10170 transitions.
RANDOM walk for 40000 steps (170 resets) in 2168 ms. (18 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 73878 steps, run timeout after 3001 ms. (steps per millisecond=24 ) properties seen :0 out of 30
Probabilistic random walk after 73878 steps, saw 29023 distinct states, run finished after 3004 ms. (steps per millisecond=24 ) properties seen :0
[2024-05-22 17:32:02] [INFO ] Invariant cache hit.
[2024-05-22 17:32:02] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 2697/2712 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-22 17:32:02] [INFO ] Deduced a trap composed of 2 places in 76 ms of which 8 ms to minimize.
Problem MAX0 is UNSAT
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 82 ms of which 2 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 75 ms of which 2 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 80 ms of which 1 ms to minimize.
[2024-05-22 17:32:03] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:32:04] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2712 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 98/2810 variables, 49/70 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/12984 variables, and 70 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/2814 constraints, ReadFeed: 0/9984 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 15 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2697/2712 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 20/21 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-22 17:32:07] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 2 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 0 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 0 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-22 17:32:08] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 61 ms of which 3 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2712 variables, 20/41 constraints. Problems are: Problem set: 15 solved, 15 unsolved
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
[2024-05-22 17:32:09] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 0 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 1 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 0 ms to minimize.
[2024-05-22 17:32:10] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/2712 variables, 9/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2712 variables, 0/50 constraints. Problems are: Problem set: 15 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 98/2810 variables, 49/99 constraints. Problems are: Problem set: 15 solved, 15 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 1)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 1)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 2)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 1)
(s206 0)
(s207 0)
(s208 0)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 1)
(s248 0)
(s249 0)
(s250 0)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s300 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 2)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 2)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 0)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 0)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 0)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 0)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 2)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 2)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)
(s1290 0)
(s1291 0)
(s1292 0)
(s1293 0)
(s1294 0)
(s1295 0)
(s1296 0)
(s1297 0)
(s1298 0)
(s1299 0)
(s1300 0)
(s1301 0)
(s1302 0)
(s1303 0)
(s1304 0)
(s1305 0)
(s1306 0)
(s1307 0)
(s1308 0)
(s1309 0)
(s1310 0)
(s1311 0)
(s1312 0)
(s1313 0)
(s1314 0)
(s1315 0)
(s1316 0)
(s1317 0)
(s1318 0)
(s1319 0)
(s1320 0)
(s1321 0)
(s1322 0)
(s1323 0)
(s1324 0)
(s1325 0)
(s1326 0)
(s1327 0)
(s1328 0)
(s1329 0)
(s1330 0)
(s1331 0)
(s1332 0)
(s1333 0)
(s1334 0)
(s1335 0)
(s1336 0)
(s1337 0)
(s1338 0)
(s1339 0)
(s1340 0)
(s1341 0)
(s1342 0)
(s1343 0)
(s1344 0)
(s1345 0)
(s1346 0)
(s1347 0)
(s1348 0)
(s1349 0)
(s1350 0)
(s1351 0)
(s1352 0)
(s1353 0)
(s1354 0)
(s1355 0)
(s1356 0)
(s1357 0)
(s1358 0)
(s1359 0)
(s1360 0)
(s1361 0)
(s1362 0)
(s1363 0)
(s1364 0)
(s1365 0)
(s1366 0)
(s1367 0)
(s1368 0)
(s1369 0)
(s1370 0)
(s1371 0)
(s1372 0)
(s1373 0)
(s1374 0)
(s1375 0)
(s1376 0)
(s1377 0)
(s1378 0)
(s1379 0)
(s1380 0)
(s1381 0)
(s1382 0)
(s1383 0)
(s1384 0)
(s1385 0)
(s1386 0)
(s1387 0)
(s1388 0)
(s1389 0)
(s1390 0)
(s1391 0)
(s1392 0)
(s1393 0)
(s1394 0)
(s1395 0)
(s1396 0)
(s1397 0)
(s1398 0)
(s1399 0)
(s1400 0)
(s1401 0)
(s1402 0)
(s1403 0)
(s1404 0)
(s1405 0)
(s1406 0)
(s1407 0)
(s1408 0)
(s1409 0)
(s1410 0)
(s1411 0)
(s1412 0)
(s1413 0)
(s1414 0)
(s1415 0)
(s1416 0)
(s1417 0)
(s1418 0)
(s1419 0)
(s1420 0)
(s1421 0)
(s1422 0)
(s1423 0)
(s1424 0)
(s1425 0)
(s1426 0)
(s1427 0)
(s1428 0)
(s1429 0)
(s1430 0)
(s1431 0)
(s1432 0)
(s1433 0)
(s1434 0)
(s1435 0)
(s1436 0)
(s1437 0)
(s1438 0)
(s1439 0)
(s1440 0)
(s1441 0)
(s1442 0)
(s1443 0)
(s1444 0)
(s1445 0)
(s1446 0)
(s1447 0)
(s1448 0)
(s1449 0)
(s1450 0)
(s1451 0)
(s1452 0)
(s1453 0)
(s1454 0)
(s1455 0)
(s1456 0)
(s1457 0)
(s1458 0)
(s1459 0)
(s1460 0)
(s1461 0)
(s1462 0)
(s1463 0)
(s1464 0)
(s1465 0)
(s1466 0)
(s1467 2)
(s1468 0)
(s1469 0)
(s1470 0)
(s1471 0)
(s1472 0)
(s1473 0)
(s1474 0)
(s1475 0)
(s1476 0)
(s1477 0)
(s1478 0)
(s1479 0)
(s1480 0)
(s1481 0)
(s1482 0)
(s1483 0)
(s1484 0)
(s1485 0)
(s1486 0)
(s1487 0)
(s1488 0)
(s1489 0)
(s1490 0)
(s1491 0)
(s1492 0)
(s1493 0)
(s1494 0)
(s1495 0)
(s1496 0)
(s1497 0)
(s1498 0)
(s1499 0)
(s1500 0)
(s1501 0)
(s1502 0)
(s1503 0)
(s1504 0)
(s1505 0)
(s1506 0)
(s1507 0)
(s1508 0)
(s1509 0)
(s1510 0)
(s1511 0)
(s1512 0)
(s1513 0)
(s1514 0)
(s1515 0)
(s1516 0)
(s1517 0)
(s1518 0)
(s1519 0)
(s1520 0)
(s1521 0)
(s1522 0)
(s1523 0)
(s1524 0)
(s1525 0)
(s1526 0)
(s1527 0)
(s1528 0)
(s1529 0)
(s1530 0)
(s1531 0)
(s1532 0)
(s1533 0)
(s1534 0)
(s1535 0)
(s1536 0)
(s1537 0)
(s1538 0)
(s1539 0)
(s1540 0)
(s1541 0)
(s1542 0)
(s1543 0)
(s1544 0)
(s1545 0)
(s1546 0)
(s1547 0)
(s1548 0)
(s1549 0)
(s1550 0)
(s1551 0)
(s1552 0)
(s1553 0)
(s1554 0)
(s1555 0)
(s1556 0)
(s1557 0)
(s1558 0)
(s1559 0)
(s1560 0)
(s1561 0)
(s1562 0)
(s1563 0)
(s1564 0)
(s1565 0)
(s1566 0)
(s1567 0)
(s1568 0)
(s1569 0)
(s1570 0)
(s1571 0)
(s1572 0)
(s1573 0)
(s1574 0)
(s1575 0)
(s1576 0)
(s1577 0)
(s1578 0)
(s1579 0)
(s1580 0)
(s1581 0)
(s1582 0)
(s1583 0)
(s1584 0)
(s1585 0)
(s1586 0)
(s1587 0)
(s1588 0)
(s1589 0)
(s1590 0)
(s1591 0)
(s1592 0)
(s1593 0)
(s1594 0)
(s1595 0)
(s1596 0)
(s1597 0)
(s1598 0)
(s1599 0)
(s1600 0)
(s1601 0)
(s1602 0)
(s1603 0)
(s1604 0)
(s1605 0)
(s1606 0)
(s1607 0)
(s1608 0)
(s1609 0)
(s1610 0)
(s1611 0)
(s1612 0)
(s1613 0)
(s1614 0)
(s1615 0)
(s1616 0)
(s1617 0)
(s1618 0)
(s1619 0)
(s1620 0)
(s1621 0)
(s1622 0)
(s1623 0)
(s1624 0)
(s1625 0)
(s1626 0)
(s1627 0)
(s1628 0)
(s1629 0)
(s1630 0)
(s1631 0)
(s1632 0)
(s1633 0)
(s1634 0)
(s1635 0)
(s1636 0)
(s1637 0)
(s1638 0)
(s1639 0)
(s1640 0)
(s1641 0)
(s1642 0)
(s1643 0)
(s1644 0)
(s1645 0)
(s1646 0)
(s1647 0)
(s1648 0)
(s1649 0)
(s1650 0)
(s1651 0)
(s1652 0)
(s1653 0)
(s1654 0)
(s1655 0)
(s1656 0)
(s1657 0)
(s1658 0)
(s1659 0)
(s1660 0)
(s1661 0)
(s1662 0)
(s1663 0)
(s1664 0)
(s1665 0)
(s1666 0)
(s1667 0)
(s1668 0)
(s1669 0)
(s1670 0)
(s1671 0)
(s1672 0)
(s1673 0)
(s1674 0)
(s1675 0)
(s1676 0)
(s1677 0)
(s1678 0)
(s1679 0)
(s1680 0)
(s1681 0)
(s1682 0)
(s1683 0)
(s1684 0)
(s1685 0)
(s1686 0)
(s1687 0)
(s1688 0)
(s1689 0)
(s1690 0)
(s1691 0)
(s1692 0)
(s1693 0)
(s1694 0)
(s1695 0)
(s1696 0)
(s1697 0)
(s1698 0)
(s1699 0)
(s1700 0)
(s1701 2)
(s1702 0)
(s1703 0)
(s1704 0)
(s1705 0)
(s1706 0)
(s1707 0)
(s1708 0)
(s1709 0)
(s1710 0)
(s1711 0)
(s1712 0)
(s1713 0)
(s1714 0)
(s1715 0)
(s1716 0)
(s1717 0)
(s1718 0)
(s1719 0)
(s1720 0)
(s1721 0)
(s1722 0)
(s1723 0)
(s1724 0)
(s1725 0)
(s1726 2)
(s1727 0)
(s1728 0)
(s1729 0)
(s1730 0)
(s1731 0)
(s1732 0)
(s1733 0)
(s1734 0)
(s1735 0)
(s1736 0)
(s1737 0)
(s1738 0)
(s1739 0)
(s1740 0)
(s1741 0)
(s1742 0)
(s1743 0)
(s1744 0)
(s1745 0)
(s1746 0)
(s1747 0)
(s1748 0)
(s1749 2)
(s1750 0)
(s1751 0)
(s1752 0)
(s1753 0)
(s1754 0)
(s1755 0)
(s1756 0)
(s1757 0)
(s1758 0)
(s1759 0)
(s1760 0)
(s1761 0)
(s1762 0)
(s1763 0)
(s1764 0)
(s1765 0)
(s1766 0)
(s1767 0)
(s1768 0)
(s1769 0)
(s1770 0)
(s1771 0)
(s1772 0)
(s1773 0)
(s1774 0)
(s1775 0)
(s1776 0)
(s1777 0)
(s1778 0)
(s1779 0)
(s1780 0)
(s1781 0)
(s1782 0)
(s1783 0)
(s1784 0)
(s1785 0)
(s1786 0)
(s1787 0)
(s1788 0)
(s1789 0)
(s1790 0)
(s1791 0)
(s1792 0)
(s1793 0)
(s1794 0)
(s1795 0)
(s1796 0)
(s1797 0)
(s1798 0)
(s1799 0)
(s1800 0)
(s1801 0)
(s1802 0)
(s1803 0)
(s1804 0)
(s1805 0)
(s1806 0)
(s1807 0)
(s1808 0)
(s1809 0)
(s1810 0)
(s1811 0)
(s1812 0)
(s1813 0)
(s1814 0)
(s1815 0)
(s1816 0)
(s1817 0)
(s1818 0)
(s1819 0)
(s1820 0)
(s1821 0)
(s1822 0)
(s1823 0)
(s1824 0)
(s1825 0)
(s1826 0)
(s1827 0)
(s1828 0)
(s1829 0)
(s1830 0)
(s1831 0)
(s1832 0)
(s1833 0)
(s1834 0)
(s1835 0)
(s1836 0)
(s1837 0)
(s1838 0)
(s1839 0)
(s1840 0)
(s1841 0)
(s1842 0)
(s1843 0)
(s1844 0)
(s1845 0)
(s1846 0)
(s1847 0)
(s1848 0)
(s1849 0)
(s1850 0)
(s1851 0)
(s1852 0)
(s1853 0)
(s1854 0)
(s1855 0)
(s1856 0)
(s1857 0)
(s1858 0)
(s1859 0)
(s1860 0)
(s1861 0)
(s1862 0)
(s1863 0)
(s1864 0)
(s1865 0)
(s1866 0)
(s1867 0)
(s1868 0)
(s1869 0)
(s1870 0)
(s1871 0)
(s1872 0)
(s1873 0)
(s1874 0)
(s1875 0)
(s1876 0)
(s1877 0)
(s1878 0)
(s1879 0)
(s1880 0)
(s1881 0)
(s1882 0)
(s1883 0)
(s1884 0)
(s1885 0)
(s1886 0)
(s1887 0)
(s1888 0)
(s1889 0)
(s1890 0)
(s1891 0)
(s1892 0)
(s1893 0)
(s1894 0)
(s1895 0)
(s1896 0)
(s1897 0)
(s1898 0)
(s1899 0)
(s1900 0)
(s1901 0)
(s1902 0)
(s1903 0)
(s1904 0)
(s1905 0)
(s1906 0)
(s1907 0)
(s1908 0)
(s1909 0)
(s1910 0)
(s1911 0)
(s1912 0)
(s1913 0)
(s1914 0)
(s1915 0)
(s1916 0)
(s1917 0)
(s1918 0)
(s1919 0)
(s1920 0)
(s1921 0)
(s1922 0)
(s1923 0)
(s1924 0)
(s1925 0)
(s1926 0)
(s1927 0)
(s1928 0)
(s1929 0)
(s1930 0)
(s1931 0)
(s1932 0)
(s1933 0)
(s1934 0)
(s1935 0)
(s1936 0)
(s1937 0)
(s1938 0)
(s1939 0)
(s1940 0)
(s1941 0)
(s1942 0)
(s1943 0)
(s1944 2)
(s1945 0)
(s1946 0)
(s1947 0)
(s1948 0)
(s1949 0)
(s1950 0)
(s1951 0)
(s1952 0)
(s1953 0)
(s1954 0)
(s1955 0)
(s1956 0)
(s1957 0)
(s1958 0)
(s1959 0)
(s1960 0)
(s1961 0)
(s1962 0)
(s1963 0)
(s1964 0)
(s1965 0)
(s1966 0)
(s1967 0)
(s1968 0)
(s1969 0)
(s1970 0)
(s1971 0)
(s1972 0)
(s1973 0)
(s1974 0)
(s1975 0)
(s1976 0)
(s1977 0)
(s1978 0)
(s1979 0)
(s1980 0)
(s1981 0)
(s1982 0)
(s1983 0)
(s1984 0)
(s1985 0)
(s1986 0)
(s1987 0)
(s1988 0)
(s1989 0)
(s1990 0)
(s1991 0)
(s1992 0)
(s1993 0)
(s1994 0)
(s1995 0)
(s1996 0)
(s1997 0)
(s1998 0)
(s1999 0)
(s2000 0)
(s2001 0)
(s2002 0)
(s2003 0)
(s2004 0)
(s2005 0)
(s2006 0)
(s2007 0)
(s2008 0)
(s2009 0)
(s2010 0)
(s2011 0)
(s2012 0)
(s2013 0)
(s2014 2)
(s2015 0)
(s2016 0)
(s2017 0)
(s2018 0)
(s2019 0)
(s2020 0)
(s2021 0)
(s2022 0)
(s2023 0)
(s2024 0)
(s2025 0)
(s2026 0)
(s2027 0)
(s2028 0)
(s2029 0)
(s2030 0)
(s2031 0)
(s2032 0)
(s2033 0)
(s2034 0)
(s2035 0)
(s2036 0)
(s2037 0)
(s2038 0)
(s2039 0)
(s2040 0)
(s2041 0)
(s2042 0)
(s2043 0)
(s2044 0)
(s2045 0)
(s2046 0)
(s2047 0)
(s2048 0)
(s2049 0)
(s2050 0)
(s2051 0)
(s2052 0)
(s2053 0)
(s2054 0)
(s2055 0)
(s2056 0)
(s2057 0)
(s2058 0)
(s2059 0)
(s2060 0)
(s2061 0)
(s2062 0)
(s2063 0)
(s2064 0)
(s2065 0)
(s2066 0)
(s2067 0)
(s2068 0)
(s2069 0)
(s2070 0)
(s2071 0)
(s2072 0)
(s2073 0)
(s2074 0)
(s2075 0)
(s2076 0)
(s2077 0)
(s2078 0)
(s2079 0)
(s2080 0)
(s2081 0)
(s2082 0)
(s2083 0)
(s2084 0)
(s2085 0)
(s2086 0)
(s2087 0)
(s2088 0)
(s2089 0)
(s2090 0)
(s2091 0)
(s2092 0)
(s2093 0)
(s2094 0)
(s2095 0)
(s2096 0)
(s2097 0)
(s2098 0)
(s2099 0)
(s2100 0)
(s2101 0)
(s2102 0)
(s2103 0)
(s2104 0)
(s2105 0)
(s2106 0)
(s2107 0)
(s2108 0)
(s2109 0)
(s2110 0)
(s2111 0)
(s2112 0)
(s2113 0)
(s2114 0)
(s2115 0)
(s2116 0)
(s2117 0)
(s2118 0)
(s2119 0)
(s2120 0)
(s2121 0)
(s2122 0)
(s2123 0)
(s2124 0)
(s2125 0)
(s2126 0)
(s2127 0)
(s2128 0)
(s2129 0)
(s2130 0)
(s2131 0)
(s2132 0)
(s2133 0)
(s2134 0)
(s2135 0)
(s2136 0)
(s2137 0)
(s2138 0)
(s2139 0)
(s2140 0)
(s2141 0)
(s2142 0)
(s2143 0)
(s2144 0)
(s2145 0)
(s2146 0)
(s2147 0)
(s2148 0)
(s2149 0)
(s2150 0)
(s2151 0)
(s2152 0)
(s2153 0)
(s2154 0)
(s2155 0)
(s2156 0)
(s2157 0)
(s2158 0)
(s2159 0)
(s2160 0)
(s2161 0)
(s2162 0)
(s2163 0)
(s2164 0)
(s2165 0)
(s2166 0)
(s2167 0)
(s2168 0)
(s2169 0)
(s2170 0)
(s2171 0)
(s2172 0)
(s2173 0)
(s2174 0)
(s2175 0)
(s2176 0)
(s2177 0)
(s2178 0)
(s2179 0)
(s2180 0)
(s2181 0)
(s2182 0)
(s2183 0)
(s2184 0)
(s2185 0)
(s2186 0)
(s2187 0)
(s2188 0)
(s2189 0)
(s2190 0)
(s2191 0)
(s2192 0)
(s2193 0)
(s2194 0)
(s2195 0)
(s2196 0)
(s2197 0)
(s2198 0)
(s2199 0)
(s2200 0)
(s2201 0)
(s2202 0)
(s2203 0)
(s2204 0)
(s2205 0)
(s2206 0)
(s2207 0)
(s2208 0)
(s2209 0)
(s2210 0)
(s2211 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/12984 variables, and 99 constraints, problems are : Problem set: 15 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/2814 constraints, ReadFeed: 0/9984 constraints, PredecessorRefiner: 0/30 constraints, Known Traps: 49/49 constraints]
After SMT, in 10200ms problems are : Problem set: 15 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 402 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 2814/2814 places, 10170/10170 transitions.
RANDOM walk for 40000 steps (173 resets) in 1017 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 75414 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 15
Probabilistic random walk after 75414 steps, saw 29213 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-22 17:32:16] [INFO ] Invariant cache hit.
[2024-05-22 17:32:16] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 2697/2712 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 17:32:16] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2712 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2712 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 98/2810 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2810 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/2812 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-22 17:32:24] [INFO ] Deduced a trap composed of 57 places in 3381 ms of which 19 ms to minimize.
[2024-05-22 17:32:26] [INFO ] Deduced a trap composed of 63 places in 2768 ms of which 17 ms to minimize.
[2024-05-22 17:32:29] [INFO ] Deduced a trap composed of 63 places in 2719 ms of which 18 ms to minimize.
[2024-05-22 17:32:32] [INFO ] Deduced a trap composed of 63 places in 2503 ms of which 16 ms to minimize.
[2024-05-22 17:32:35] [INFO ] Deduced a trap composed of 87 places in 2839 ms of which 16 ms to minimize.
[2024-05-22 17:32:38] [INFO ] Deduced a trap composed of 78 places in 2874 ms of which 17 ms to minimize.
[2024-05-22 17:32:40] [INFO ] Deduced a trap composed of 67 places in 2627 ms of which 18 ms to minimize.
[2024-05-22 17:32:43] [INFO ] Deduced a trap composed of 66 places in 2809 ms of which 17 ms to minimize.
[2024-05-22 17:32:46] [INFO ] Deduced a trap composed of 67 places in 2519 ms of which 16 ms to minimize.
[2024-05-22 17:32:48] [INFO ] Deduced a trap composed of 67 places in 2492 ms of which 16 ms to minimize.
[2024-05-22 17:32:51] [INFO ] Deduced a trap composed of 91 places in 2468 ms of which 15 ms to minimize.
[2024-05-22 17:32:53] [INFO ] Deduced a trap composed of 66 places in 2447 ms of which 15 ms to minimize.
[2024-05-22 17:32:56] [INFO ] Deduced a trap composed of 66 places in 2357 ms of which 15 ms to minimize.
[2024-05-22 17:32:58] [INFO ] Deduced a trap composed of 71 places in 2416 ms of which 15 ms to minimize.
[2024-05-22 17:33:01] [INFO ] Deduced a trap composed of 115 places in 2421 ms of which 15 ms to minimize.
[2024-05-22 17:33:03] [INFO ] Deduced a trap composed of 62 places in 2335 ms of which 17 ms to minimize.
SMT process timed out in 47086ms, After SMT, problems are : Problem set: 0 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 390 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 391 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Applied a total of 0 rules in 393 ms. Remains 2814 /2814 variables (removed 0) and now considering 10170/10170 (removed 0) transitions.
[2024-05-22 17:33:04] [INFO ] Invariant cache hit.
[2024-05-22 17:33:07] [INFO ] Implicit Places using invariants in 3631 ms returned []
Implicit Place search using SMT only with invariants took 3632 ms to find 0 implicit places.
Running 10120 sub problems to find dead transitions.
[2024-05-22 17:33:07] [INFO ] Invariant cache hit.
[2024-05-22 17:33:08] [INFO ] State equation strengthened by 9984 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2813 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10120 unsolved
SMT process timed out in 44040ms, After SMT, problems are : Problem set: 0 solved, 10120 unsolved
Search for dead transitions found 0 dead transitions in 44132ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48182 ms. Remains : 2814/2814 places, 10170/10170 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50]
Starting property specific reduction for CANInsertWithFailure-PT-050-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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
[2024-05-22 17:33:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 155 ms. (64 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 17:33:52] [INFO ] Invariant cache hit.
[2024-05-22 17:33:52] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:33:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:33:54] [INFO ] [Real]Absence check using state equation in 1966 ms returned sat
[2024-05-22 17:33:54] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:33:55] [INFO ] [Real]Added 9984 Read/Feed constraints in 980 ms returned sat
[2024-05-22 17:33:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:33:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:33:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 17:33:58] [INFO ] [Nat]Absence check using state equation in 1977 ms returned sat
[2024-05-22 17:33:59] [INFO ] [Nat]Added 9984 Read/Feed constraints in 898 ms returned sat
[2024-05-22 17:33:59] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 494 ms.
[2024-05-22 17:34:00] [INFO ] Added : 1 causal constraints over 1 iterations in 1434 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1074 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:34:02] [INFO ] Computed 52 invariants in 382 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4347 resets) in 14915 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1569 ms. (636 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:34:18] [INFO ] Invariant cache hit.
[2024-05-22 17:34:19] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:34:19] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:34:21] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2024-05-22 17:34:21] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:34:22] [INFO ] [Real]Added 10007 Read/Feed constraints in 899 ms returned sat
[2024-05-22 17:34:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:34:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:34:23] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:34:25] [INFO ] [Nat]Absence check using state equation in 2144 ms returned sat
[2024-05-22 17:34:26] [INFO ] [Nat]Added 10007 Read/Feed constraints in 916 ms returned sat
[2024-05-22 17:34:26] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 520 ms.
[2024-05-22 17:34:28] [INFO ] Added : 8 causal constraints over 2 iterations in 1981 ms. Result :sat
Minimization took 6064 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 399 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 417 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:34:35] [INFO ] Invariant cache hit.
[2024-05-22 17:34:39] [INFO ] Implicit Places using invariants in 3821 ms returned []
Implicit Place search using SMT only with invariants took 3836 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:34:39] [INFO ] Invariant cache hit.
[2024-05-22 17:34:39] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43315ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43403ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47678 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 17:35:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4344 resets) in 14938 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1665 ms. (600 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:35:39] [INFO ] Invariant cache hit.
[2024-05-22 17:35:39] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:35:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:35:41] [INFO ] [Real]Absence check using state equation in 2218 ms returned sat
[2024-05-22 17:35:41] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:35:42] [INFO ] [Real]Added 10007 Read/Feed constraints in 1007 ms returned sat
[2024-05-22 17:35:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:35:43] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:35:43] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:35:45] [INFO ] [Nat]Absence check using state equation in 2217 ms returned sat
[2024-05-22 17:35:46] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1010 ms returned sat
[2024-05-22 17:35:47] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 550 ms.
[2024-05-22 17:35:49] [INFO ] Added : 8 causal constraints over 2 iterations in 2056 ms. Result :sat
Minimization took 5971 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 400 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 378 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:35:55] [INFO ] Invariant cache hit.
[2024-05-22 17:35:59] [INFO ] Implicit Places using invariants in 3658 ms returned []
Implicit Place search using SMT only with invariants took 3659 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:35:59] [INFO ] Invariant cache hit.
[2024-05-22 17:35:59] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43478ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43558ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47616 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 914 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 84688 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 84688 steps, saw 29444 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 17:36:46] [INFO ] Invariant cache hit.
[2024-05-22 17:36:46] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:36:46] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:36:50] [INFO ] Deduced a trap composed of 102 places in 2867 ms of which 19 ms to minimize.
[2024-05-22 17:36:53] [INFO ] Deduced a trap composed of 84 places in 2865 ms of which 17 ms to minimize.
SMT process timed out in 6688ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 481 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 492 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 685 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 88114 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 88114 steps, saw 29911 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 17:36:56] [INFO ] Invariant cache hit.
[2024-05-22 17:36:56] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:36:57] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:37:00] [INFO ] Deduced a trap composed of 71 places in 2884 ms of which 17 ms to minimize.
[2024-05-22 17:37:03] [INFO ] Deduced a trap composed of 68 places in 2720 ms of which 17 ms to minimize.
[2024-05-22 17:37:06] [INFO ] Deduced a trap composed of 76 places in 2811 ms of which 17 ms to minimize.
[2024-05-22 17:37:08] [INFO ] Deduced a trap composed of 68 places in 2780 ms of which 18 ms to minimize.
[2024-05-22 17:37:11] [INFO ] Deduced a trap composed of 74 places in 2852 ms of which 17 ms to minimize.
[2024-05-22 17:37:14] [INFO ] Deduced a trap composed of 78 places in 2804 ms of which 16 ms to minimize.
[2024-05-22 17:37:17] [INFO ] Deduced a trap composed of 66 places in 2627 ms of which 17 ms to minimize.
[2024-05-22 17:37:20] [INFO ] Deduced a trap composed of 101 places in 2766 ms of which 17 ms to minimize.
[2024-05-22 17:37:22] [INFO ] Deduced a trap composed of 79 places in 2731 ms of which 18 ms to minimize.
[2024-05-22 17:37:25] [INFO ] Deduced a trap composed of 75 places in 2710 ms of which 17 ms to minimize.
[2024-05-22 17:37:28] [INFO ] Deduced a trap composed of 76 places in 2604 ms of which 16 ms to minimize.
[2024-05-22 17:37:31] [INFO ] Deduced a trap composed of 78 places in 2849 ms of which 18 ms to minimize.
[2024-05-22 17:37:34] [INFO ] Deduced a trap composed of 71 places in 2810 ms of which 17 ms to minimize.
[2024-05-22 17:37:36] [INFO ] Deduced a trap composed of 76 places in 2794 ms of which 17 ms to minimize.
[2024-05-22 17:37:39] [INFO ] Deduced a trap composed of 55 places in 2782 ms of which 17 ms to minimize.
[2024-05-22 17:37:42] [INFO ] Deduced a trap composed of 71 places in 2644 ms of which 18 ms to minimize.
SMT process timed out in 45697ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 399 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 423 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:37:43] [INFO ] Invariant cache hit.
[2024-05-22 17:37:47] [INFO ] Implicit Places using invariants in 3792 ms returned []
Implicit Place search using SMT only with invariants took 3795 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:37:47] [INFO ] Invariant cache hit.
[2024-05-22 17:37:47] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.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 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.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 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.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 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 timeout
0.0)
(s1301 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43388ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47708 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00 in 278534 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:38:30] [INFO ] Computed 52 invariants in 374 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 151 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:38:31] [INFO ] Invariant cache hit.
[2024-05-22 17:38:31] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:38:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:38:33] [INFO ] [Real]Absence check using state equation in 2080 ms returned sat
[2024-05-22 17:38:33] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:38:34] [INFO ] [Real]Added 9984 Read/Feed constraints in 855 ms returned sat
[2024-05-22 17:38:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:38:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:38:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-22 17:38:37] [INFO ] [Nat]Absence check using state equation in 2281 ms returned sat
[2024-05-22 17:38:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 17:38:39] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1832 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1038 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1038 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:38:40] [INFO ] Computed 52 invariants in 408 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4335 resets) in 15561 ms. (64 steps per ms)
BEST_FIRST walk for 1000001 steps (57 resets) in 1521 ms. (657 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:38:57] [INFO ] Invariant cache hit.
[2024-05-22 17:38:58] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:38:58] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 37 ms returned sat
[2024-05-22 17:39:00] [INFO ] [Real]Absence check using state equation in 2136 ms returned sat
[2024-05-22 17:39:00] [INFO ] State equation strengthened by 10009 read => feed constraints.
[2024-05-22 17:39:01] [INFO ] [Real]Added 10009 Read/Feed constraints in 861 ms returned sat
[2024-05-22 17:39:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:39:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:39:02] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:39:04] [INFO ] [Nat]Absence check using state equation in 2120 ms returned sat
[2024-05-22 17:39:05] [INFO ] [Nat]Added 10009 Read/Feed constraints in 1189 ms returned sat
[2024-05-22 17:39:06] [INFO ] Computed and/alt/rep : 7365/19590/7365 causal constraints (skipped 2744 transitions) in 500 ms.
[2024-05-22 17:39:07] [INFO ] Added : 8 causal constraints over 2 iterations in 2093 ms. Result :sat
Minimization took 5951 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 383 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 392 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:39:14] [INFO ] Invariant cache hit.
[2024-05-22 17:39:18] [INFO ] Implicit Places using invariants in 3774 ms returned []
Implicit Place search using SMT only with invariants took 3774 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:39:18] [INFO ] Invariant cache hit.
[2024-05-22 17:39:18] [INFO ] State equation strengthened by 10009 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43364ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43462ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47657 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 688 ms. (58 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 82659 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 82659 steps, saw 29030 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 17:40:04] [INFO ] Invariant cache hit.
[2024-05-22 17:40:05] [INFO ] State equation strengthened by 10009 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:40:05] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:40:08] [INFO ] Deduced a trap composed of 63 places in 2956 ms of which 18 ms to minimize.
[2024-05-22 17:40:11] [INFO ] Deduced a trap composed of 60 places in 2863 ms of which 18 ms to minimize.
SMT process timed out in 6731ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 389 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 848 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89892 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89892 steps, saw 30076 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 17:40:15] [INFO ] Invariant cache hit.
[2024-05-22 17:40:15] [INFO ] State equation strengthened by 10009 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:40:15] [INFO ] Deduced a trap composed of 2 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:40:19] [INFO ] Deduced a trap composed of 87 places in 3041 ms of which 18 ms to minimize.
[2024-05-22 17:40:22] [INFO ] Deduced a trap composed of 64 places in 2934 ms of which 17 ms to minimize.
[2024-05-22 17:40:25] [INFO ] Deduced a trap composed of 60 places in 3023 ms of which 17 ms to minimize.
[2024-05-22 17:40:28] [INFO ] Deduced a trap composed of 56 places in 2986 ms of which 18 ms to minimize.
[2024-05-22 17:40:31] [INFO ] Deduced a trap composed of 76 places in 2899 ms of which 17 ms to minimize.
[2024-05-22 17:40:33] [INFO ] Deduced a trap composed of 92 places in 2668 ms of which 16 ms to minimize.
[2024-05-22 17:40:36] [INFO ] Deduced a trap composed of 73 places in 2792 ms of which 18 ms to minimize.
[2024-05-22 17:40:39] [INFO ] Deduced a trap composed of 55 places in 2740 ms of which 17 ms to minimize.
[2024-05-22 17:40:42] [INFO ] Deduced a trap composed of 73 places in 2654 ms of which 17 ms to minimize.
[2024-05-22 17:40:44] [INFO ] Deduced a trap composed of 61 places in 2603 ms of which 17 ms to minimize.
[2024-05-22 17:40:47] [INFO ] Deduced a trap composed of 55 places in 2444 ms of which 17 ms to minimize.
[2024-05-22 17:40:49] [INFO ] Deduced a trap composed of 55 places in 2476 ms of which 18 ms to minimize.
[2024-05-22 17:40:52] [INFO ] Deduced a trap composed of 56 places in 2411 ms of which 25 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 13/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12960/12962 variables, and 12876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45037 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2801/2803 constraints, ReadFeed: 10009/10009 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:41:00] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:41:04] [INFO ] Deduced a trap composed of 71 places in 2874 ms of which 17 ms to minimize.
[2024-05-22 17:41:06] [INFO ] Deduced a trap composed of 58 places in 2775 ms of which 18 ms to minimize.
[2024-05-22 17:41:09] [INFO ] Deduced a trap composed of 64 places in 2641 ms of which 17 ms to minimize.
[2024-05-22 17:41:12] [INFO ] Deduced a trap composed of 61 places in 2639 ms of which 17 ms to minimize.
[2024-05-22 17:41:14] [INFO ] Deduced a trap composed of 66 places in 2622 ms of which 17 ms to minimize.
[2024-05-22 17:41:17] [INFO ] Deduced a trap composed of 61 places in 2369 ms of which 15 ms to minimize.
[2024-05-22 17:41:20] [INFO ] Deduced a trap composed of 63 places in 2744 ms of which 17 ms to minimize.
[2024-05-22 17:41:22] [INFO ] Deduced a trap composed of 63 places in 2732 ms of which 17 ms to minimize.
[2024-05-22 17:41:25] [INFO ] Deduced a trap composed of 62 places in 2612 ms of which 17 ms to minimize.
[2024-05-22 17:41:28] [INFO ] Deduced a trap composed of 58 places in 2631 ms of which 17 ms to minimize.
[2024-05-22 17:41:30] [INFO ] Deduced a trap composed of 56 places in 2619 ms of which 16 ms to minimize.
[2024-05-22 17:41:33] [INFO ] Deduced a trap composed of 54 places in 2641 ms of which 18 ms to minimize.
[2024-05-22 17:41:36] [INFO ] Deduced a trap composed of 64 places in 2534 ms of which 16 ms to minimize.
[2024-05-22 17:41:38] [INFO ] Deduced a trap composed of 121 places in 2631 ms of which 17 ms to minimize.
[2024-05-22 17:41:41] [INFO ] Deduced a trap composed of 68 places in 2574 ms of which 16 ms to minimize.
[2024-05-22 17:41:43] [INFO ] Deduced a trap composed of 61 places in 2429 ms of which 15 ms to minimize.
[2024-05-22 17:41:46] [INFO ] Deduced a trap composed of 76 places in 2494 ms of which 16 ms to minimize.
SMT process timed out in 91045ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 396 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 386 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:41:47] [INFO ] Invariant cache hit.
[2024-05-22 17:41:51] [INFO ] Implicit Places using invariants in 3828 ms returned []
Implicit Place search using SMT only with invariants took 3830 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:41:51] [INFO ] Invariant cache hit.
[2024-05-22 17:41:51] [INFO ] State equation strengthened by 10009 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44031ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48336 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01 in 244570 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:42:35] [INFO ] Computed 52 invariants in 480 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (44 resets) in 183 ms. (54 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 17:42:35] [INFO ] Invariant cache hit.
[2024-05-22 17:42:36] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:42:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:42:38] [INFO ] [Real]Absence check using state equation in 2284 ms returned sat
[2024-05-22 17:42:38] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:42:39] [INFO ] [Real]Added 9984 Read/Feed constraints in 1001 ms returned sat
[2024-05-22 17:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:42:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 57 ms returned sat
[2024-05-22 17:42:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:42:42] [INFO ] [Nat]Absence check using state equation in 2313 ms returned sat
[2024-05-22 17:42:43] [INFO ] [Nat]Added 9984 Read/Feed constraints in 951 ms returned sat
[2024-05-22 17:42:44] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 585 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1025 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1025 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:42:46] [INFO ] Computed 52 invariants in 376 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4344 resets) in 14997 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1560 ms. (640 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:43:03] [INFO ] Invariant cache hit.
[2024-05-22 17:43:03] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2024-05-22 17:43:03] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:43:05] [INFO ] [Real]Absence check using state equation in 2205 ms returned sat
[2024-05-22 17:43:05] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:43:06] [INFO ] [Real]Added 10007 Read/Feed constraints in 952 ms returned sat
[2024-05-22 17:43:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:43:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 40 ms returned sat
[2024-05-22 17:43:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 17:43:09] [INFO ] [Nat]Absence check using state equation in 2291 ms returned sat
[2024-05-22 17:43:11] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1341 ms returned sat
[2024-05-22 17:43:11] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 585 ms.
[2024-05-22 17:43:13] [INFO ] Added : 12 causal constraints over 3 iterations in 2557 ms. Result :sat
Minimization took 6365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 388 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 437 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:43:21] [INFO ] Invariant cache hit.
[2024-05-22 17:43:24] [INFO ] Implicit Places using invariants in 3965 ms returned []
Implicit Place search using SMT only with invariants took 3966 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:43:25] [INFO ] Invariant cache hit.
[2024-05-22 17:43:25] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44212ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48711 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 17:44:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4351 resets) in 15882 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1669 ms. (598 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:44:26] [INFO ] Invariant cache hit.
[2024-05-22 17:44:27] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:44:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:44:29] [INFO ] [Real]Absence check using state equation in 2181 ms returned sat
[2024-05-22 17:44:29] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:44:30] [INFO ] [Real]Added 10007 Read/Feed constraints in 931 ms returned sat
[2024-05-22 17:44:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:44:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:44:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:44:33] [INFO ] [Nat]Absence check using state equation in 2194 ms returned sat
[2024-05-22 17:44:34] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1366 ms returned sat
[2024-05-22 17:44:35] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 618 ms.
[2024-05-22 17:44:37] [INFO ] Added : 12 causal constraints over 3 iterations in 2587 ms. Result :sat
Minimization took 7459 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 408 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 405 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:44:45] [INFO ] Invariant cache hit.
[2024-05-22 17:44:49] [INFO ] Implicit Places using invariants in 3721 ms returned []
Implicit Place search using SMT only with invariants took 3735 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:44:49] [INFO ] Invariant cache hit.
[2024-05-22 17:44:49] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43970ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48231 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 715 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 81350 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 81350 steps, saw 28969 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 17:45:37] [INFO ] Invariant cache hit.
[2024-05-22 17:45:37] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:45:37] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:45:41] [INFO ] Deduced a trap composed of 65 places in 3134 ms of which 20 ms to minimize.
[2024-05-22 17:45:44] [INFO ] Deduced a trap composed of 66 places in 2976 ms of which 18 ms to minimize.
SMT process timed out in 7073ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 393 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 730 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89697 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89697 steps, saw 30114 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 17:45:47] [INFO ] Invariant cache hit.
[2024-05-22 17:45:47] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:45:48] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:45:51] [INFO ] Deduced a trap composed of 60 places in 3073 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9280 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:45:57] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:46:00] [INFO ] Deduced a trap composed of 103 places in 3129 ms of which 19 ms to minimize.
[2024-05-22 17:46:03] [INFO ] Deduced a trap composed of 65 places in 2871 ms of which 18 ms to minimize.
[2024-05-22 17:46:06] [INFO ] Deduced a trap composed of 59 places in 2860 ms of which 18 ms to minimize.
[2024-05-22 17:46:09] [INFO ] Deduced a trap composed of 65 places in 2767 ms of which 17 ms to minimize.
[2024-05-22 17:46:12] [INFO ] Deduced a trap composed of 60 places in 2777 ms of which 21 ms to minimize.
[2024-05-22 17:46:15] [INFO ] Deduced a trap composed of 56 places in 2743 ms of which 17 ms to minimize.
[2024-05-22 17:46:17] [INFO ] Deduced a trap composed of 60 places in 2732 ms of which 17 ms to minimize.
[2024-05-22 17:46:20] [INFO ] Deduced a trap composed of 57 places in 2750 ms of which 17 ms to minimize.
[2024-05-22 17:46:23] [INFO ] Deduced a trap composed of 89 places in 2806 ms of which 17 ms to minimize.
[2024-05-22 17:46:26] [INFO ] Deduced a trap composed of 67 places in 2593 ms of which 16 ms to minimize.
[2024-05-22 17:46:28] [INFO ] Deduced a trap composed of 90 places in 2626 ms of which 16 ms to minimize.
[2024-05-22 17:46:31] [INFO ] Deduced a trap composed of 77 places in 2751 ms of which 16 ms to minimize.
[2024-05-22 17:46:34] [INFO ] Deduced a trap composed of 63 places in 2577 ms of which 16 ms to minimize.
[2024-05-22 17:46:37] [INFO ] Deduced a trap composed of 62 places in 2686 ms of which 16 ms to minimize.
[2024-05-22 17:46:39] [INFO ] Deduced a trap composed of 68 places in 2612 ms of which 16 ms to minimize.
[2024-05-22 17:46:42] [INFO ] Deduced a trap composed of 68 places in 2622 ms of which 16 ms to minimize.
SMT process timed out in 54707ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 452 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:46:43] [INFO ] Invariant cache hit.
[2024-05-22 17:46:46] [INFO ] Implicit Places using invariants in 3655 ms returned []
Implicit Place search using SMT only with invariants took 3655 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:46:47] [INFO ] Invariant cache hit.
[2024-05-22 17:46:47] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43601ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47820 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02 in 295473 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:47:31] [INFO ] Computed 52 invariants in 457 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 221 ms. (45 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 17:47:31] [INFO ] Invariant cache hit.
[2024-05-22 17:47:31] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:47:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:47:33] [INFO ] [Real]Absence check using state equation in 2253 ms returned sat
[2024-05-22 17:47:34] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:47:35] [INFO ] [Real]Added 9984 Read/Feed constraints in 1011 ms returned sat
[2024-05-22 17:47:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:47:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-22 17:47:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:47:38] [INFO ] [Nat]Absence check using state equation in 2172 ms returned sat
[2024-05-22 17:47:38] [INFO ] [Nat]Added 9984 Read/Feed constraints in 952 ms returned sat
[2024-05-22 17:47:39] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 718 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1037 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1038 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:47:41] [INFO ] Computed 52 invariants in 359 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4340 resets) in 16186 ms. (61 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1588 ms. (629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:47:59] [INFO ] Invariant cache hit.
[2024-05-22 17:48:00] [INFO ] [Real]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 17:48:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:48:02] [INFO ] [Real]Absence check using state equation in 2158 ms returned sat
[2024-05-22 17:48:02] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:48:03] [INFO ] [Real]Added 10007 Read/Feed constraints in 901 ms returned sat
[2024-05-22 17:48:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:48:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 52 ms returned sat
[2024-05-22 17:48:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:48:06] [INFO ] [Nat]Absence check using state equation in 2107 ms returned sat
[2024-05-22 17:48:07] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1117 ms returned sat
[2024-05-22 17:48:08] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 552 ms.
[2024-05-22 17:48:09] [INFO ] Added : 9 causal constraints over 2 iterations in 2190 ms. Result :sat
Minimization took 6056 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 388 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 391 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:48:16] [INFO ] Invariant cache hit.
[2024-05-22 17:48:20] [INFO ] Implicit Places using invariants in 3840 ms returned []
Implicit Place search using SMT only with invariants took 3841 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:48:20] [INFO ] Invariant cache hit.
[2024-05-22 17:48:20] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43551ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43623ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47872 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 17:49:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4353 resets) in 15948 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1606 ms. (622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:49:21] [INFO ] Invariant cache hit.
[2024-05-22 17:49:21] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:49:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:49:24] [INFO ] [Real]Absence check using state equation in 2286 ms returned sat
[2024-05-22 17:49:24] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:49:25] [INFO ] [Real]Added 10007 Read/Feed constraints in 997 ms returned sat
[2024-05-22 17:49:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:49:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 17:49:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:49:28] [INFO ] [Nat]Absence check using state equation in 1980 ms returned sat
[2024-05-22 17:49:29] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1048 ms returned sat
[2024-05-22 17:49:29] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 511 ms.
[2024-05-22 17:49:31] [INFO ] Added : 9 causal constraints over 2 iterations in 1952 ms. Result :sat
Minimization took 7839 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 397 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 392 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:49:39] [INFO ] Invariant cache hit.
[2024-05-22 17:49:43] [INFO ] Implicit Places using invariants in 3648 ms returned []
Implicit Place search using SMT only with invariants took 3648 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:49:43] [INFO ] Invariant cache hit.
[2024-05-22 17:49:43] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43703ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43791ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47847 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 1420 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 85274 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 85274 steps, saw 29524 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 17:50:30] [INFO ] Invariant cache hit.
[2024-05-22 17:50:30] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:50:31] [INFO ] Deduced a trap composed of 2 places in 83 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:50:34] [INFO ] Deduced a trap composed of 65 places in 2971 ms of which 18 ms to minimize.
[2024-05-22 17:50:37] [INFO ] Deduced a trap composed of 66 places in 2882 ms of which 20 ms to minimize.
SMT process timed out in 6779ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 394 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 915 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89945 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89945 steps, saw 30139 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 17:50:41] [INFO ] Invariant cache hit.
[2024-05-22 17:50:41] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:50:41] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:50:45] [INFO ] Deduced a trap composed of 89 places in 2997 ms of which 19 ms to minimize.
[2024-05-22 17:50:48] [INFO ] Deduced a trap composed of 61 places in 2860 ms of which 17 ms to minimize.
[2024-05-22 17:50:51] [INFO ] Deduced a trap composed of 60 places in 2893 ms of which 17 ms to minimize.
[2024-05-22 17:50:54] [INFO ] Deduced a trap composed of 57 places in 2905 ms of which 17 ms to minimize.
[2024-05-22 17:50:56] [INFO ] Deduced a trap composed of 59 places in 2703 ms of which 17 ms to minimize.
[2024-05-22 17:50:59] [INFO ] Deduced a trap composed of 60 places in 2758 ms of which 16 ms to minimize.
[2024-05-22 17:51:02] [INFO ] Deduced a trap composed of 64 places in 2674 ms of which 16 ms to minimize.
[2024-05-22 17:51:04] [INFO ] Deduced a trap composed of 79 places in 2577 ms of which 17 ms to minimize.
[2024-05-22 17:51:07] [INFO ] Deduced a trap composed of 59 places in 2519 ms of which 16 ms to minimize.
[2024-05-22 17:51:10] [INFO ] Deduced a trap composed of 64 places in 2595 ms of which 16 ms to minimize.
[2024-05-22 17:51:12] [INFO ] Deduced a trap composed of 80 places in 2366 ms of which 15 ms to minimize.
[2024-05-22 17:51:15] [INFO ] Deduced a trap composed of 78 places in 2431 ms of which 15 ms to minimize.
[2024-05-22 17:51:17] [INFO ] Deduced a trap composed of 77 places in 2514 ms of which 16 ms to minimize.
[2024-05-22 17:51:20] [INFO ] Deduced a trap composed of 68 places in 2378 ms of which 16 ms to minimize.
[2024-05-22 17:51:22] [INFO ] Deduced a trap composed of 65 places in 2253 ms of which 16 ms to minimize.
[2024-05-22 17:51:24] [INFO ] Deduced a trap composed of 63 places in 2252 ms of which 14 ms to minimize.
[2024-05-22 17:51:26] [INFO ] Deduced a trap composed of 64 places in 2229 ms of which 14 ms to minimize.
SMT process timed out in 45538ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 398 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:51:27] [INFO ] Invariant cache hit.
[2024-05-22 17:51:31] [INFO ] Implicit Places using invariants in 3849 ms returned []
Implicit Place search using SMT only with invariants took 3852 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:51:31] [INFO ] Invariant cache hit.
[2024-05-22 17:51:31] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43416ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43501ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47757 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03 in 284412 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:52:15] [INFO ] Computed 52 invariants in 406 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 151 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 20 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:52:15] [INFO ] Invariant cache hit.
[2024-05-22 17:52:15] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:52:15] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:52:18] [INFO ] [Real]Absence check using state equation in 2195 ms returned sat
[2024-05-22 17:52:18] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:52:19] [INFO ] [Real]Added 9984 Read/Feed constraints in 948 ms returned sat
[2024-05-22 17:52:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:52:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:52:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2024-05-22 17:52:22] [INFO ] [Nat]Absence check using state equation in 2201 ms returned sat
[2024-05-22 17:52:23] [INFO ] [Nat]Added 9984 Read/Feed constraints in 945 ms returned sat
[2024-05-22 17:52:23] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 552 ms.
[2024-05-22 17:52:24] [INFO ] Added : 7 causal constraints over 2 iterations in 1308 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1047 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:52:26] [INFO ] Computed 52 invariants in 343 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4355 resets) in 15494 ms. (64 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1613 ms. (619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:52:43] [INFO ] Invariant cache hit.
[2024-05-22 17:52:43] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:52:43] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:52:45] [INFO ] [Real]Absence check using state equation in 2132 ms returned sat
[2024-05-22 17:52:46] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:52:46] [INFO ] [Real]Added 10007 Read/Feed constraints in 928 ms returned sat
[2024-05-22 17:52:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:52:47] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 17:52:47] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 25 ms returned sat
[2024-05-22 17:52:49] [INFO ] [Nat]Absence check using state equation in 2235 ms returned sat
[2024-05-22 17:52:50] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1104 ms returned sat
[2024-05-22 17:52:51] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 558 ms.
[2024-05-22 17:52:53] [INFO ] Added : 10 causal constraints over 2 iterations in 2240 ms. Result :sat
Minimization took 5929 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 409 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 391 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:53:00] [INFO ] Invariant cache hit.
[2024-05-22 17:53:04] [INFO ] Implicit Places using invariants in 3936 ms returned []
Implicit Place search using SMT only with invariants took 3963 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:53:04] [INFO ] Invariant cache hit.
[2024-05-22 17:53:04] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43773ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48223 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 1013 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 83544 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83544 steps, saw 29266 distinct states, run finished after 3002 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 17:53:51] [INFO ] Invariant cache hit.
[2024-05-22 17:53:51] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:53:51] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:53:55] [INFO ] Deduced a trap composed of 65 places in 3020 ms of which 18 ms to minimize.
[2024-05-22 17:53:58] [INFO ] Deduced a trap composed of 66 places in 2957 ms of which 17 ms to minimize.
SMT process timed out in 6860ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 385 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (170 resets) in 738 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89565 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89565 steps, saw 30094 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 17:54:01] [INFO ] Invariant cache hit.
[2024-05-22 17:54:01] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:54:02] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:54:05] [INFO ] Deduced a trap composed of 63 places in 2813 ms of which 17 ms to minimize.
[2024-05-22 17:54:08] [INFO ] Deduced a trap composed of 58 places in 3134 ms of which 18 ms to minimize.
[2024-05-22 17:54:08] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12866 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11751 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:54:14] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:54:17] [INFO ] Deduced a trap composed of 102 places in 3019 ms of which 17 ms to minimize.
[2024-05-22 17:54:20] [INFO ] Deduced a trap composed of 64 places in 3103 ms of which 19 ms to minimize.
[2024-05-22 17:54:23] [INFO ] Deduced a trap composed of 65 places in 2956 ms of which 17 ms to minimize.
[2024-05-22 17:54:26] [INFO ] Deduced a trap composed of 65 places in 2944 ms of which 20 ms to minimize.
[2024-05-22 17:54:29] [INFO ] Deduced a trap composed of 68 places in 2973 ms of which 17 ms to minimize.
[2024-05-22 17:54:32] [INFO ] Deduced a trap composed of 92 places in 3049 ms of which 18 ms to minimize.
[2024-05-22 17:54:35] [INFO ] Deduced a trap composed of 105 places in 2920 ms of which 15 ms to minimize.
[2024-05-22 17:54:38] [INFO ] Deduced a trap composed of 97 places in 3017 ms of which 18 ms to minimize.
[2024-05-22 17:54:41] [INFO ] Deduced a trap composed of 67 places in 2646 ms of which 17 ms to minimize.
[2024-05-22 17:54:44] [INFO ] Deduced a trap composed of 69 places in 3017 ms of which 18 ms to minimize.
[2024-05-22 17:54:47] [INFO ] Deduced a trap composed of 64 places in 3112 ms of which 18 ms to minimize.
[2024-05-22 17:54:50] [INFO ] Deduced a trap composed of 64 places in 3039 ms of which 17 ms to minimize.
[2024-05-22 17:54:53] [INFO ] Deduced a trap composed of 94 places in 2917 ms of which 17 ms to minimize.
[2024-05-22 17:54:56] [INFO ] Deduced a trap composed of 67 places in 2740 ms of which 17 ms to minimize.
[2024-05-22 17:54:59] [INFO ] Deduced a trap composed of 79 places in 2912 ms of which 17 ms to minimize.
SMT process timed out in 57537ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 459 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 460 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 381 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:55:00] [INFO ] Invariant cache hit.
[2024-05-22 17:55:04] [INFO ] Implicit Places using invariants in 3874 ms returned []
Implicit Place search using SMT only with invariants took 3875 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:55:04] [INFO ] Invariant cache hit.
[2024-05-22 17:55:04] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43091ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43167ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47435 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04 in 212161 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 17:55:47] [INFO ] Computed 52 invariants in 408 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 158 ms. (62 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 18 ms. (526 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 17:55:47] [INFO ] Invariant cache hit.
[2024-05-22 17:55:48] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:55:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:55:50] [INFO ] [Real]Absence check using state equation in 2051 ms returned sat
[2024-05-22 17:55:50] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 17:55:51] [INFO ] [Real]Added 9984 Read/Feed constraints in 924 ms returned sat
[2024-05-22 17:55:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:55:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:55:51] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 17:55:54] [INFO ] [Nat]Absence check using state equation in 2164 ms returned sat
[2024-05-22 17:55:55] [INFO ] [Nat]Added 9984 Read/Feed constraints in 906 ms returned sat
[2024-05-22 17:55:55] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 602 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1005 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1005 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 17:55:58] [INFO ] Computed 52 invariants in 334 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4351 resets) in 15888 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1613 ms. (619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:56:15] [INFO ] Invariant cache hit.
[2024-05-22 17:56:15] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 17:56:15] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:56:17] [INFO ] [Real]Absence check using state equation in 2090 ms returned sat
[2024-05-22 17:56:18] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:56:19] [INFO ] [Real]Added 10007 Read/Feed constraints in 881 ms returned sat
[2024-05-22 17:56:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:56:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 17:56:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 17:56:21] [INFO ] [Nat]Absence check using state equation in 2137 ms returned sat
[2024-05-22 17:56:22] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1027 ms returned sat
[2024-05-22 17:56:23] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 598 ms.
[2024-05-22 17:56:25] [INFO ] Added : 8 causal constraints over 2 iterations in 2207 ms. Result :sat
Minimization took 6843 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 412 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 412 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 404 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:56:32] [INFO ] Invariant cache hit.
[2024-05-22 17:56:36] [INFO ] Implicit Places using invariants in 3842 ms returned []
Implicit Place search using SMT only with invariants took 3843 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:56:36] [INFO ] Invariant cache hit.
[2024-05-22 17:56:37] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44610ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44715ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48975 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 17:57:21] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4350 resets) in 16369 ms. (61 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1716 ms. (582 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 17:57:39] [INFO ] Invariant cache hit.
[2024-05-22 17:57:39] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:57:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:57:42] [INFO ] [Real]Absence check using state equation in 2320 ms returned sat
[2024-05-22 17:57:42] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 17:57:43] [INFO ] [Real]Added 10007 Read/Feed constraints in 992 ms returned sat
[2024-05-22 17:57:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 17:57:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 17:57:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 17:57:46] [INFO ] [Nat]Absence check using state equation in 2193 ms returned sat
[2024-05-22 17:57:47] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1051 ms returned sat
[2024-05-22 17:57:48] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 611 ms.
[2024-05-22 17:57:49] [INFO ] Added : 8 causal constraints over 2 iterations in 2306 ms. Result :sat
Minimization took 7437 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 395 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 396 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 407 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:57:58] [INFO ] Invariant cache hit.
[2024-05-22 17:58:02] [INFO ] Implicit Places using invariants in 3866 ms returned []
Implicit Place search using SMT only with invariants took 3866 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 17:58:02] [INFO ] Invariant cache hit.
[2024-05-22 17:58:02] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.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 1.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.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 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.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 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 1.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 1.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 1.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 0.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 0.0)
(s1568 0.0)
(s1569 0.0)
(s1570 0.0)
(s1571 0.0)
(s1572 0.0)
(s1573 0.0)
(s1574 0.0)
(s1575 0.0)
(s1576 0.0)
(s1577 0.0)
(s1578 0.0)
(s1579 0.0)
(s1580 0.0)
(s1581 0.0)
(s1582 0.0)
(s1583 0.0)
(s1584 0.0)
(s1585 0.0)
(s1586 0.0)
(s1587 0.0)
(s1588 0.0)
(s1589 0.0)
(s1590 0.0)
(s1591 0.0)
(s1592 0.0)
(s1593 0.0)
(s1594 0.0)
(s1595 0.0)
(s1596 0.0)
(s1597 0.0)
(s1598 0.0)
(s1599 0.0)
(s1600 0.0)
(s1601 0.0)
(s1602 0.0)
(s1603 0.0)
(s1604 0.0)
(s1605 0.0)
(s1606 0.0)
(s1607 0.0)
(s1608 0.0)
(s1609 0.0)
(s1610 0.0)
(s1611 0.0)
(s1612 0.0)
(s1613 0.0)
(s1614 0.0)
(s1615 0.0)
(s1616 0.0)
(s1617 0.0)
(s1618 0.0)
(s1619 0.0)
(s1620 0.0)
(s1621 0.0)
(s1622 0.0)
(s1623 0.0)
(s1624 0.0)
(s1625 0.0)
(s1626 0.0)
(s1627 0.0)
(s1628 0.0)
(s1629 0.0)
(s1630 0.0)
(s1631 0.0)
(s1632 0.0)
(s1633 0.0)
(s1634 0.0)
(s1635 0.0)
(s1636 0.0)
(s1637 0.0)
(s1638 0.0)
(s1639 0.0)
(s1640 0.0)
(s1641 0.0)
(s1642 0.0)
(s1643 0.0)
(s1644 0.0)
(s1645 0.0)
(s1646 0.0)
(s1647 0.0)
(s1648 0.0)
(s1649 0.0)
(s1650 0.0)
(s1651 0.0)
(s1652 0.0)
(s1653 0.0)
(s1654 0.0)
(s1655 0.0)
(s1656 0.0)
(s1657 0.0)
(s1658 0.0)
(s1659 0.0)
(s1660 0.0)
(s1661 0.0)
(s1662 0.0)
(s1663 0.0)
(s1664 0.0)
(s1665 0.0)
(s1666 0.0)
(s1667 0.0)
(s1668 0.0)
(s1669 0.0)
(s1670 0.0)
(s1671 0.0)
(s1672 0.0)
(s1673 0.0)
(s1674 0.0)
(s1675 0.0)
(s1676 0.0)
(s1677 0.0)
(s1678 0.0)
(s1679 0.0)
(s1680 0.0)
(s1681 0.0)
(s1682 0.0)
(s1683 0.0)
(s1684 0.0)
(s1685 0.0)
(s1686 0.0)
(s1687 0.0)
(s1688 0.0)
(s1689 0.0)
(s1690 0.0)
(s1691 0.0)
(s1692 0.0)
(s1693 0.0)
(s1694 0.0)
(s1695 0.0)
(s1696 0.0)
(s1697 0.0)
(s1698 0.0)
(s1699 0.0)
(s1700 0.0)
(s1701 0.0)
(s1702 0.0)
(s1703 0.0)
(s1704 0.0)
(s1705 0.0)
(s1706 0.0)
(s1707 0.0)
(s1708 0.0)
(s1709 0.0)
(s1710 0.0)
(s1711 0.0)
(s1712 0.0)
(s1713 0.0)
(s1714 0.0)
(s1715 0.0)
(s1716 0.0)
(s1717 0.0)
(s1718 0.0)
(s1719 0.0)
(s1720 0.0)
(s1721 0.0)
(s1722 0.0)
(s1723 0.0)
(s1724 0.0)
(s1725 0.0)
(s1726 0.0)
(s1727 0.0)
(s1728 0.0)
(s1729 0.0)
(s1730 0.0)
(s1731 0.0)
(s1732 0.0)
(s1733 0.0)
(s1734 0.0)
(s1735 0.0)
(s1736 0.0)
(s1737 0.0)
(s1738 0.0)
(s1739 0.0)
(s1740 0.0)
(s1741 0.0)
(s1742 0.0)
(s1743 0.0)
(s1744 0.0)
(s1745 0.0)
(s1746 0.0)
(s1747 0.0)
(s1748 0.0)
(s1749 0.0)
(s1750 0.0)
(s1751 0.0)
(s1752 0.0)
(s1753 0.0)
(s1754 0.0)
(s1755 0.0)
(s1756 0.0)
(s1757 0.0)
(s1758 0.0)
(s1759 0.0)
(s1760 0.0)
(s1761 0.0)
(s1762 0.0)
(s1763 0.0)
(s1764 0.0)
(s1765 0.0)
(s1766 0.0)
(s1767 0.0)
(s1768 0.0)
(s1769 0.0)
(s1770 0.0)
(s1771 0.0)
(s1772 0.0)
(s1773 0.0)
(s1774 0.0)
(s1775 0.0)
(s1776 0.0)
(s1777 0.0)
(s1778 0.0)
(s1779 0.0)
(s1780 0.0)
(s1781 0.0)
(s1782 0.0)
(s1783 0.0)
(s1784 0.0)
(s1785 0.0)
(s1786 0.0)
(s1787 0.0)
(s1788 0.0)
(s1789 0.0)
(s1790 0.0)
(s1791 0.0)
(s1792 0.0)
(s1793 0.0)
(s1794 0.0)
(s1795 0.0)
(s1796 0.0)
(s1797 0.0)
(s1798 0.0)
(s1799 0.0)
(s1800 0.0)
(s1801 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44390ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48764 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 1234 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 85671 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 85671 steps, saw 30474 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 17:58:50] [INFO ] Invariant cache hit.
[2024-05-22 17:58:50] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 17:58:50] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 17:58:53] [INFO ] Deduced a trap composed of 65 places in 3011 ms of which 17 ms to minimize.
[2024-05-22 17:58:56] [INFO ] Deduced a trap composed of 66 places in 2914 ms of which 17 ms to minimize.
SMT process timed out in 6833ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 372 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 374 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (170 resets) in 942 ms. (42 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 91084 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 1
Probabilistic random walk after 91084 steps, saw 31204 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-22 17:59:00] [INFO ] Invariant cache hit.
[2024-05-22 17:59:00] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:59:01] [INFO ] Deduced a trap composed of 2 places in 72 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:59:04] [INFO ] Deduced a trap composed of 60 places in 2922 ms of which 18 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 10534 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:59:11] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 17:59:14] [INFO ] Deduced a trap composed of 102 places in 2944 ms of which 17 ms to minimize.
[2024-05-22 17:59:17] [INFO ] Deduced a trap composed of 64 places in 3128 ms of which 18 ms to minimize.
[2024-05-22 17:59:21] [INFO ] Deduced a trap composed of 65 places in 3022 ms of which 18 ms to minimize.
[2024-05-22 17:59:24] [INFO ] Deduced a trap composed of 65 places in 3049 ms of which 18 ms to minimize.
[2024-05-22 17:59:27] [INFO ] Deduced a trap composed of 68 places in 2859 ms of which 19 ms to minimize.
[2024-05-22 17:59:30] [INFO ] Deduced a trap composed of 92 places in 2962 ms of which 19 ms to minimize.
[2024-05-22 17:59:33] [INFO ] Deduced a trap composed of 64 places in 3015 ms of which 18 ms to minimize.
[2024-05-22 17:59:36] [INFO ] Deduced a trap composed of 64 places in 3043 ms of which 17 ms to minimize.
[2024-05-22 17:59:39] [INFO ] Deduced a trap composed of 63 places in 2931 ms of which 18 ms to minimize.
[2024-05-22 17:59:42] [INFO ] Deduced a trap composed of 63 places in 2888 ms of which 19 ms to minimize.
[2024-05-22 17:59:45] [INFO ] Deduced a trap composed of 63 places in 2876 ms of which 19 ms to minimize.
[2024-05-22 17:59:48] [INFO ] Deduced a trap composed of 62 places in 2941 ms of which 18 ms to minimize.
[2024-05-22 17:59:50] [INFO ] Deduced a trap composed of 63 places in 2814 ms of which 19 ms to minimize.
[2024-05-22 17:59:53] [INFO ] Deduced a trap composed of 66 places in 2930 ms of which 16 ms to minimize.
[2024-05-22 17:59:56] [INFO ] Deduced a trap composed of 65 places in 2951 ms of which 18 ms to minimize.
SMT process timed out in 56262ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 389 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 464 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 17:59:57] [INFO ] Invariant cache hit.
[2024-05-22 18:00:01] [INFO ] Implicit Places using invariants in 3815 ms returned []
Implicit Place search using SMT only with invariants took 3818 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:00:01] [INFO ] Invariant cache hit.
[2024-05-22 18:00:01] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42902ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47283 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05 in 297280 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 18:00:45] [INFO ] Computed 52 invariants in 593 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 147 ms. (67 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:00:45] [INFO ] Invariant cache hit.
[2024-05-22 18:00:45] [INFO ] [Real]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 18:00:45] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 18:00:47] [INFO ] [Real]Absence check using state equation in 1983 ms returned sat
[2024-05-22 18:00:47] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 18:00:48] [INFO ] [Real]Added 9984 Read/Feed constraints in 830 ms returned sat
[2024-05-22 18:00:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:00:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 18:00:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:00:51] [INFO ] [Nat]Absence check using state equation in 2017 ms returned sat
[2024-05-22 18:00:52] [INFO ] [Nat]Added 9984 Read/Feed constraints in 868 ms returned sat
[2024-05-22 18:00:52] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 490 ms.
[2024-05-22 18:00:54] [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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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:929)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 2802 transition count 10158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2802 transition count 10158
Applied a total of 26 rules in 1209 ms. Remains 2802 /2814 variables (removed 12) and now considering 10158/10170 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1210 ms. Remains : 2802/2814 places, 10158/10170 transitions.
// Phase 1: matrix 10158 rows 2802 cols
[2024-05-22 18:00:55] [INFO ] Computed 52 invariants in 356 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4347 resets) in 16886 ms. (59 steps per ms)
BEST_FIRST walk for 1000001 steps (71 resets) in 1714 ms. (583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:01:14] [INFO ] Invariant cache hit.
[2024-05-22 18:01:14] [INFO ] [Real]Absence check using 50 positive place invariants in 51 ms returned sat
[2024-05-22 18:01:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 18:01:16] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2024-05-22 18:01:17] [INFO ] State equation strengthened by 10008 read => feed constraints.
[2024-05-22 18:01:18] [INFO ] [Real]Added 10008 Read/Feed constraints in 1069 ms returned sat
[2024-05-22 18:01:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:01:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 18:01:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:01:20] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2024-05-22 18:01:21] [INFO ] [Nat]Added 10008 Read/Feed constraints in 871 ms returned sat
[2024-05-22 18:01:22] [INFO ] Computed and/alt/rep : 7364/19588/7364 causal constraints (skipped 2744 transitions) in 552 ms.
[2024-05-22 18:01:23] [INFO ] Added : 5 causal constraints over 1 iterations in 1531 ms. Result :sat
Minimization took 7076 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 392 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 376 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-22 18:01:31] [INFO ] Invariant cache hit.
[2024-05-22 18:01:34] [INFO ] Implicit Places using invariants in 3619 ms returned []
Implicit Place search using SMT only with invariants took 3620 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-22 18:01:35] [INFO ] Invariant cache hit.
[2024-05-22 18:01:35] [INFO ] State equation strengthened by 10008 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 43746ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 43820ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47830 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (171 resets) in 1693 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 80801 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 80801 steps, saw 28916 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-22 18:02:22] [INFO ] Invariant cache hit.
[2024-05-22 18:02:22] [INFO ] State equation strengthened by 10008 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:02:22] [INFO ] Deduced a trap composed of 2 places in 81 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 18:02:26] [INFO ] Deduced a trap composed of 59 places in 2981 ms of which 18 ms to minimize.
[2024-05-22 18:02:29] [INFO ] Deduced a trap composed of 60 places in 2916 ms of which 18 ms to minimize.
SMT process timed out in 6853ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 419 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 419 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (173 resets) in 1498 ms. (26 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 86888 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 86888 steps, saw 29757 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 18:02:33] [INFO ] Invariant cache hit.
[2024-05-22 18:02:33] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:02:33] [INFO ] Deduced a trap composed of 2 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:02:37] [INFO ] Deduced a trap composed of 76 places in 3042 ms of which 18 ms to minimize.
[2024-05-22 18:02:39] [INFO ] Deduced a trap composed of 68 places in 2859 ms of which 18 ms to minimize.
[2024-05-22 18:02:42] [INFO ] Deduced a trap composed of 56 places in 2742 ms of which 17 ms to minimize.
[2024-05-22 18:02:45] [INFO ] Deduced a trap composed of 78 places in 2732 ms of which 18 ms to minimize.
[2024-05-22 18:02:48] [INFO ] Deduced a trap composed of 55 places in 2602 ms of which 17 ms to minimize.
[2024-05-22 18:02:50] [INFO ] Deduced a trap composed of 55 places in 2642 ms of which 15 ms to minimize.
[2024-05-22 18:02:53] [INFO ] Deduced a trap composed of 89 places in 2571 ms of which 16 ms to minimize.
[2024-05-22 18:02:56] [INFO ] Deduced a trap composed of 83 places in 2549 ms of which 15 ms to minimize.
[2024-05-22 18:02:58] [INFO ] Deduced a trap composed of 73 places in 2600 ms of which 16 ms to minimize.
[2024-05-22 18:03:01] [INFO ] Deduced a trap composed of 60 places in 2465 ms of which 16 ms to minimize.
[2024-05-22 18:03:03] [INFO ] Deduced a trap composed of 55 places in 2500 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2800 variables, 11/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2800 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10158/12958 variables, 2800/2864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12958 variables, 10008/12872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12958 variables, 0/12872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12960 variables, 2/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12960 variables, 0/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12960 variables, 0/12874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12960/12960 variables, and 12874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36385 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2802/2802 constraints, ReadFeed: 10008/10008 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 12/12 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:03:10] [INFO ] Deduced a trap composed of 2 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2700 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2798 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2798 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2800 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2800 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:03:13] [INFO ] Deduced a trap composed of 70 places in 3113 ms of which 19 ms to minimize.
[2024-05-22 18:03:16] [INFO ] Deduced a trap composed of 66 places in 3076 ms of which 19 ms to minimize.
[2024-05-22 18:03:16] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2800 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2800 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10158/12958 variables, 2800/2868 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12958 variables, 10008/12876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12958 variables, 1/12877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12958 variables, 0/12877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/12960 variables, 2/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/12960 variables, 0/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/12960 variables, 0/12879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12960/12960 variables, and 12879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14673 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2802/2802 constraints, ReadFeed: 10008/10008 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 16/16 constraints]
After SMT, in 51159ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 429 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 422 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-22 18:03:25] [INFO ] Invariant cache hit.
[2024-05-22 18:03:28] [INFO ] Implicit Places using invariants in 3764 ms returned []
Implicit Place search using SMT only with invariants took 3764 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-22 18:03:29] [INFO ] Invariant cache hit.
[2024-05-22 18:03:29] [INFO ] State equation strengthened by 10008 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 44717ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 44803ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49006 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06 in 209290 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 18:04:14] [INFO ] Computed 52 invariants in 393 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 153 ms. (64 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:04:14] [INFO ] Invariant cache hit.
[2024-05-22 18:04:14] [INFO ] [Real]Absence check using 50 positive place invariants in 50 ms returned sat
[2024-05-22 18:04:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 18:04:17] [INFO ] [Real]Absence check using state equation in 2253 ms returned sat
[2024-05-22 18:04:17] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 18:04:18] [INFO ] [Real]Added 9984 Read/Feed constraints in 914 ms returned sat
[2024-05-22 18:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:04:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 18:04:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 18:04:20] [INFO ] [Nat]Absence check using state equation in 2047 ms returned sat
[2024-05-22 18:04:21] [INFO ] [Nat]Added 9984 Read/Feed constraints in 972 ms returned sat
[2024-05-22 18:04:22] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 588 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 2802 transition count 10158
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 2802 transition count 10158
Applied a total of 26 rules in 1067 ms. Remains 2802 /2814 variables (removed 12) and now considering 10158/10170 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1068 ms. Remains : 2802/2814 places, 10158/10170 transitions.
// Phase 1: matrix 10158 rows 2802 cols
[2024-05-22 18:04:25] [INFO ] Computed 52 invariants in 405 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4348 resets) in 18313 ms. (54 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1779 ms. (561 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:04:45] [INFO ] Invariant cache hit.
[2024-05-22 18:04:45] [INFO ] [Real]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-22 18:04:45] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 18:04:47] [INFO ] [Real]Absence check using state equation in 2192 ms returned sat
[2024-05-22 18:04:48] [INFO ] State equation strengthened by 10008 read => feed constraints.
[2024-05-22 18:04:48] [INFO ] [Real]Added 10008 Read/Feed constraints in 954 ms returned sat
[2024-05-22 18:04:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:04:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 48 ms returned sat
[2024-05-22 18:04:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 18:04:51] [INFO ] [Nat]Absence check using state equation in 2178 ms returned sat
[2024-05-22 18:04:52] [INFO ] [Nat]Added 10008 Read/Feed constraints in 962 ms returned sat
[2024-05-22 18:04:53] [INFO ] Computed and/alt/rep : 7364/19588/7364 causal constraints (skipped 2744 transitions) in 593 ms.
[2024-05-22 18:04:55] [INFO ] Added : 6 causal constraints over 2 iterations in 2213 ms. Result :sat
Minimization took 6015 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 402 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 402 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 419 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-22 18:05:02] [INFO ] Invariant cache hit.
[2024-05-22 18:05:05] [INFO ] Implicit Places using invariants in 3744 ms returned []
Implicit Place search using SMT only with invariants took 3745 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-22 18:05:05] [INFO ] Invariant cache hit.
[2024-05-22 18:05:05] [INFO ] State equation strengthened by 10008 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 1.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 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.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 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.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 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.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 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 1.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 0.0)
(s860 0.0)
(s861 0.0)
(s862 0.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 0.0)
(s869 0.0)
(s870 0.0)
(s871 0.0)
(s872 0.0)
(s873 0.0)
(s874 0.0)
(s875 0.0)
(s876 0.0)
(s877 0.0)
(s878 0.0)
(s879 0.0)
(s880 0.0)
(s881 0.0)
(s882 0.0)
(s883 0.0)
(s884 0.0)
(s885 0.0)
(s886 0.0)
(s887 0.0)
(s888 0.0)
(s889 0.0)
(s890 0.0)
(s891 0.0)
(s892 0.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 0.0)
(s898 0.0)
(s899 0.0)
(s900 0.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 0.0)
(s908 0.0)
(s909 0.0)
(s910 0.0)
(s911 0.0)
(s912 0.0)
(s913 0.0)
(s914 0.0)
(s915 0.0)
(s916 0.0)
(s917 0.0)
(s918 0.0)
(s919 0.0)
(s920 0.0)
(s921 0.0)
(s922 0.0)
(s923 0.0)
(s924 0.0)
(s925 0.0)
(s926 0.0)
(s927 0.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 0.0)
(s933 0.0)
(s934 0.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 0.0)
(s939 0.0)
(s940 0.0)
(s941 0.0)
(s942 0.0)
(s943 0.0)
(s944 0.0)
(s945 0.0)
(s946 0.0)
(s947 0.0)
(s948 0.0)
(s949 0.0)
(s950 0.0)
(s951 0.0)
(s952 0.0)
(s953 0.0)
(s954 0.0)
(s955 0.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 0.0)
(s960 0.0)
(s961 0.0)
(s962 0.0)
(s963 0.0)
(s964 0.0)
(s965 0.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 0.0)
(s970 0.0)
(s971 0.0)
(s972 0.0)
(s973 0.0)
(s974 0.0)
(s975 0.0)
(s976 0.0)
(s977 0.0)
(s978 0.0)
(s979 0.0)
(s980 0.0)
(s981 0.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 0.0)
(s986 0.0)
(s987 0.0)
(s988 0.0)
(s989 0.0)
(s990 0.0)
(s991 0.0)
(s992 0.0)
(s993 0.0)
(s994 0.0)
(s995 0.0)
(s996 0.0)
(s997 0.0)
(s998 0.0)
(s999 0.0)
(s1000 0.0)
(s1001 0.0)
(s1002 0.0)
(s1003 0.0)
(s1004 0.0)
(s1005 0.0)
(s1006 0.0)
(s1007 0.0)
(s1008 0.0)
(s1009 0.0)
(s1010 0.0)
(s1011 0.0)
(s1012 0.0)
(s1013 0.0)
(s1014 0.0)
(s1015 0.0)
(s1016 0.0)
(s1017 0.0)
(s1018 0.0)
(s1019 0.0)
(s1020 0.0)
(s1021 0.0)
(s1022 0.0)
(s1023 0.0)
(s1024 0.0)
(s1025 0.0)
(s1026 0.0)
(s1027 0.0)
(s1028 0.0)
(s1029 0.0)
(s1030 0.0)
(s1031 0.0)
(s1032 0.0)
(s1033 0.0)
(s1034 0.0)
(s1035 0.0)
(s1036 0.0)
(s1037 0.0)
(s1038 0.0)
(s1039 0.0)
(s1040 0.0)
(s1041 0.0)
(s1042 0.0)
(s1043 0.0)
(s1044 0.0)
(s1045 0.0)
(s1046 0.0)
(s1047 0.0)
(s1048 0.0)
(s1049 0.0)
(s1050 0.0)
(s1051 0.0)
(s1052 0.0)
(s1053 0.0)
(s1054 0.0)
(s1055 0.0)
(s1056 0.0)
(s1057 0.0)
(s1058 0.0)
(s1059 0.0)
(s1060 0.0)
(s1061 0.0)
(s1062 0.0)
(s1063 0.0)
(s1064 0.0)
(s1065 0.0)
(s1066 0.0)
(s1067 0.0)
(s1068 0.0)
(s1069 0.0)
(s1070 0.0)
(s1071 0.0)
(s1072 0.0)
(s1073 0.0)
(s1074 0.0)
(s1075 0.0)
(s1076 0.0)
(s1077 0.0)
(s1078 0.0)
(s1079 0.0)
(s1080 0.0)
(s1081 0.0)
(s1082 0.0)
(s1083 0.0)
(s1084 0.0)
(s1085 0.0)
(s1086 0.0)
(s1087 0.0)
(s1088 0.0)
(s1089 0.0)
(s1090 0.0)
(s1091 0.0)
(s1092 0.0)
(s1093 0.0)
(s1094 0.0)
(s1095 0.0)
(s1096 0.0)
(s1097 0.0)
(s1098 0.0)
(s1099 0.0)
(s1100 0.0)
(s1101 0.0)
(s1102 0.0)
(s1103 0.0)
(s1104 0.0)
(s1105 0.0)
(s1106 0.0)
(s1107 0.0)
(s1108 0.0)
(s1109 0.0)
(s1110 0.0)
(s1111 0.0)
(s1112 0.0)
(s1113 0.0)
(s1114 0.0)
(s1115 0.0)
(s1116 0.0)
(s1117 0.0)
(s1118 0.0)
(s1119 0.0)
(s1120 0.0)
(s1121 0.0)
(s1122 0.0)
(s1123 0.0)
(s1124 0.0)
(s1125 0.0)
(s1126 0.0)
(s1127 0.0)
(s1128 0.0)
(s1129 0.0)
(s1130 0.0)
(s1131 0.0)
(s1132 0.0)
(s1133 0.0)
(s1134 0.0)
(s1135 0.0)
(s1136 0.0)
(s1137 0.0)
(s1138 0.0)
(s1139 0.0)
(s1140 0.0)
(s1141 0.0)
(s1142 0.0)
(s1143 0.0)
(s1144 0.0)
(s1145 0.0)
(s1146 0.0)
(s1147 0.0)
(s1148 0.0)
(s1149 0.0)
(s1150 0.0)
(s1151 0.0)
(s1152 0.0)
(s1153 0.0)
(s1154 0.0)
(s1155 0.0)
(s1156 0.0)
(s1157 0.0)
(s1158 0.0)
(s1159 0.0)
(s1160 0.0)
(s1161 0.0)
(s1162 0.0)
(s1163 0.0)
(s1164 0.0)
(s1165 0.0)
(s1166 0.0)
(s1167 0.0)
(s1168 0.0)
(s1169 0.0)
(s1170 0.0)
(s1171 0.0)
(s1172 0.0)
(s1173 0.0)
(s1174 0.0)
(s1175 0.0)
(s1176 0.0)
(s1177 0.0)
(s1178 0.0)
(s1179 0.0)
(s1180 0.0)
(s1181 0.0)
(s1182 0.0)
(s1183 0.0)
(s1184 0.0)
(s1185 0.0)
(s1186 0.0)
(s1187 0.0)
(s1188 0.0)
(s1189 0.0)
(s1190 0.0)
(s1191 0.0)
(s1192 0.0)
(s1193 0.0)
(s1194 0.0)
(s1195 0.0)
(s1196 0.0)
(s1197 0.0)
(s1198 0.0)
(s1199 0.0)
(s1200 0.0)
(s1201 0.0)
(s1202 0.0)
(s1203 0.0)
(s1204 0.0)
(s1205 0.0)
(s1206 0.0)
(s1207 0.0)
(s1208 0.0)
(s1209 0.0)
(s1210 0.0)
(s1211 0.0)
(s1212 0.0)
(s1213 0.0)
(s1214 0.0)
(s1215 0.0)
(s1216 0.0)
(s1217 0.0)
(s1218 0.0)
(s1219 0.0)
(s1220 0.0)
(s1221 0.0)
(s1222 0.0)
(s1223 0.0)
(s1224 0.0)
(s1225 0.0)
(s1226 0.0)
(s1227 0.0)
(s1228 0.0)
(s1229 0.0)
(s1230 0.0)
(s1231 0.0)
(s1232 0.0)
(s1233 0.0)
(s1234 0.0)
(s1235 0.0)
(s1236 0.0)
(s1237 0.0)
(s1238 0.0)
(s1239 0.0)
(s1240 0.0)
(s1241 0.0)
(s1242 0.0)
(s1243 0.0)
(s1244 0.0)
(s1245 0.0)
(s1246 0.0)
(s1247 0.0)
(s1248 0.0)
(s1249 0.0)
(s1250 0.0)
(s1251 0.0)
(s1252 0.0)
(s1253 0.0)
(s1254 0.0)
(s1255 0.0)
(s1256 0.0)
(s1257 0.0)
(s1258 0.0)
(s1259 0.0)
(s1260 0.0)
(s1261 0.0)
(s1262 0.0)
(s1263 0.0)
(s1264 0.0)
(s1265 0.0)
(s1266 0.0)
(s1267 0.0)
(s1268 0.0)
(s1269 0.0)
(s1270 0.0)
(s1271 0.0)
(s1272 0.0)
(s1273 0.0)
(s1274 0.0)
(s1275 0.0)
(s1276 0.0)
(s1277 0.0)
(s1278 0.0)
(s1279 0.0)
(s1280 0.0)
(s1281 0.0)
(s1282 0.0)
(s1283 0.0)
(s1284 0.0)
(s1285 0.0)
(s1286 0.0)
(s1287 0.0)
(s1288 0.0)
(s1289 0.0)
(s1290 0.0)
(s1291 0.0)
(s1292 0.0)
(s1293 0.0)
(s1294 0.0)
(s1295 0.0)
(s1296 0.0)
(s1297 0.0)
(s1298 0.0)
(s1299 0.0)
(s1300 0.0)
(s1301 0.0)
(s1302 0.0)
(s1303 0.0)
(s1304 0.0)
(s1305 0.0)
(s1306 0.0)
(s1307 0.0)
(s1308 0.0)
(s1309 0.0)
(s1310 0.0)
(s1311 0.0)
(s1312 0.0)
(s1313 0.0)
(s1314 0.0)
(s1315 0.0)
(s1316 0.0)
(s1317 0.0)
(s1318 0.0)
(s1319 0.0)
(s1320 0.0)
(s1321 0.0)
(s1322 0.0)
(s1323 0.0)
(s1324 0.0)
(s1325 0.0)
(s1326 0.0)
(s1327 0.0)
(s1328 0.0)
(s1329 0.0)
(s1330 0.0)
(s1331 0.0)
(s1332 0.0)
(s1333 0.0)
(s1334 0.0)
(s1335 0.0)
(s1336 0.0)
(s1337 0.0)
(s1338 0.0)
(s1339 0.0)
(s1340 0.0)
(s1341 0.0)
(s1342 0.0)
(s1343 0.0)
(s1344 0.0)
(s1345 0.0)
(s1346 0.0)
(s1347 0.0)
(s1348 0.0)
(s1349 0.0)
(s1350 0.0)
(s1351 0.0)
(s1352 0.0)
(s1353 0.0)
(s1354 0.0)
(s1355 0.0)
(s1356 0.0)
(s1357 0.0)
(s1358 0.0)
(s1359 0.0)
(s1360 0.0)
(s1361 0.0)
(s1362 0.0)
(s1363 0.0)
(s1364 0.0)
(s1365 0.0)
(s1366 0.0)
(s1367 0.0)
(s1368 0.0)
(s1369 0.0)
(s1370 0.0)
(s1371 0.0)
(s1372 0.0)
(s1373 0.0)
(s1374 0.0)
(s1375 0.0)
(s1376 0.0)
(s1377 0.0)
(s1378 0.0)
(s1379 0.0)
(s1380 0.0)
(s1381 0.0)
(s1382 0.0)
(s1383 0.0)
(s1384 0.0)
(s1385 0.0)
(s1386 0.0)
(s1387 0.0)
(s1388 0.0)
(s1389 0.0)
(s1390 0.0)
(s1391 0.0)
(s1392 0.0)
(s1393 0.0)
(s1394 0.0)
(s1395 0.0)
(s1396 0.0)
(s1397 0.0)
(s1398 0.0)
(s1399 0.0)
(s1400 0.0)
(s1401 0.0)
(s1402 0.0)
(s1403 0.0)
(s1404 0.0)
(s1405 0.0)
(s1406 0.0)
(s1407 0.0)
(s1408 0.0)
(s1409 0.0)
(s1410 0.0)
(s1411 0.0)
(s1412 0.0)
(s1413 0.0)
(s1414 0.0)
(s1415 0.0)
(s1416 0.0)
(s1417 0.0)
(s1418 0.0)
(s1419 0.0)
(s1420 0.0)
(s1421 0.0)
(s1422 0.0)
(s1423 0.0)
(s1424 0.0)
(s1425 0.0)
(s1426 0.0)
(s1427 0.0)
(s1428 0.0)
(s1429 0.0)
(s1430 0.0)
(s1431 0.0)
(s1432 0.0)
(s1433 0.0)
(s1434 0.0)
(s1435 0.0)
(s1436 0.0)
(s1437 0.0)
(s1438 0.0)
(s1439 0.0)
(s1440 0.0)
(s1441 0.0)
(s1442 0.0)
(s1443 0.0)
(s1444 0.0)
(s1445 0.0)
(s1446 0.0)
(s1447 0.0)
(s1448 0.0)
(s1449 0.0)
(s1450 0.0)
(s1451 0.0)
(s1452 0.0)
(s1453 0.0)
(s1454 0.0)
(s1455 0.0)
(s1456 0.0)
(s1457 0.0)
(s1458 0.0)
(s1459 0.0)
(s1460 0.0)
(s1461 0.0)
(s1462 0.0)
(s1463 0.0)
(s1464 0.0)
(s1465 0.0)
(s1466 0.0)
(s1467 0.0)
(s1468 0.0)
(s1469 0.0)
(s1470 0.0)
(s1471 0.0)
(s1472 0.0)
(s1473 0.0)
(s1474 0.0)
(s1475 0.0)
(s1476 0.0)
(s1477 0.0)
(s1478 0.0)
(s1479 0.0)
(s1480 0.0)
(s1481 0.0)
(s1482 0.0)
(s1483 0.0)
(s1484 0.0)
(s1485 0.0)
(s1486 0.0)
(s1487 0.0)
(s1488 0.0)
(s1489 0.0)
(s1490 0.0)
(s1491 0.0)
(s1492 0.0)
(s1493 0.0)
(s1494 0.0)
(s1495 0.0)
(s1496 0.0)
(s1497 0.0)
(s1498 0.0)
(s1499 0.0)
(s1500 0.0)
(s1501 0.0)
(s1502 1.0)
(s1503 0.0)
(s1504 0.0)
(s1505 0.0)
(s1506 0.0)
(s1507 0.0)
(s1508 0.0)
(s1509 0.0)
(s1510 0.0)
(s1511 0.0)
(s1512 0.0)
(s1513 0.0)
(s1514 0.0)
(s1515 0.0)
(s1516 0.0)
(s1517 0.0)
(s1518 0.0)
(s1519 0.0)
(s1520 0.0)
(s1521 0.0)
(s1522 0.0)
(s1523 0.0)
(s1524 0.0)
(s1525 0.0)
(s1526 0.0)
(s1527 0.0)
(s1528 0.0)
(s1529 0.0)
(s1530 0.0)
(s1531 0.0)
(s1532 0.0)
(s1533 0.0)
(s1534 0.0)
(s1535 0.0)
(s1536 0.0)
(s1537 0.0)
(s1538 0.0)
(s1539 0.0)
(s1540 0.0)
(s1541 0.0)
(s1542 0.0)
(s1543 0.0)
(s1544 0.0)
(s1545 0.0)
(s1546 0.0)
(s1547 0.0)
(s1548 0.0)
(s1549 0.0)
(s1550 0.0)
(s1551 0.0)
(s1552 0.0)
(s1553 0.0)
(s1554 0.0)
(s1555 0.0)
(s1556 0.0)
(s1557 0.0)
(s1558 0.0)
(s1559 0.0)
(s1560 0.0)
(s1561 0.0)
(s1562 0.0)
(s1563 0.0)
(s1564 0.0)
(s1565 0.0)
(s1566 0.0)
(s1567 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 44601ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 44703ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48880 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (173 resets) in 1707 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 83794 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83794 steps, saw 29308 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 18:05:54] [INFO ] Invariant cache hit.
[2024-05-22 18:05:54] [INFO ] State equation strengthened by 10008 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:05:54] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 18:05:57] [INFO ] Deduced a trap composed of 64 places in 3023 ms of which 17 ms to minimize.
[2024-05-22 18:06:00] [INFO ] Deduced a trap composed of 61 places in 2962 ms of which 19 ms to minimize.
SMT process timed out in 6842ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 381 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 2802/2802 places, 10158/10158 transitions.
RANDOM walk for 40000 steps (172 resets) in 705 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89145 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89145 steps, saw 30053 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 18:06:04] [INFO ] Invariant cache hit.
[2024-05-22 18:06:04] [INFO ] State equation strengthened by 10008 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) 2699/2700 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:06:05] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2700 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2700 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2798 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2798 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2800 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:06:08] [INFO ] Deduced a trap composed of 77 places in 2985 ms of which 18 ms to minimize.
[2024-05-22 18:06:11] [INFO ] Deduced a trap composed of 77 places in 2976 ms of which 16 ms to minimize.
[2024-05-22 18:06:14] [INFO ] Deduced a trap composed of 65 places in 3039 ms of which 18 ms to minimize.
[2024-05-22 18:06:17] [INFO ] Deduced a trap composed of 107 places in 3080 ms of which 17 ms to minimize.
[2024-05-22 18:06:20] [INFO ] Deduced a trap composed of 69 places in 2793 ms of which 18 ms to minimize.
[2024-05-22 18:06:23] [INFO ] Deduced a trap composed of 93 places in 2864 ms of which 18 ms to minimize.
[2024-05-22 18:06:26] [INFO ] Deduced a trap composed of 60 places in 2838 ms of which 17 ms to minimize.
[2024-05-22 18:06:28] [INFO ] Deduced a trap composed of 63 places in 2762 ms of which 17 ms to minimize.
[2024-05-22 18:06:31] [INFO ] Deduced a trap composed of 62 places in 2688 ms of which 16 ms to minimize.
[2024-05-22 18:06:34] [INFO ] Deduced a trap composed of 63 places in 2747 ms of which 16 ms to minimize.
[2024-05-22 18:06:37] [INFO ] Deduced a trap composed of 79 places in 2763 ms of which 16 ms to minimize.
[2024-05-22 18:06:40] [INFO ] Deduced a trap composed of 77 places in 2880 ms of which 18 ms to minimize.
[2024-05-22 18:06:42] [INFO ] Deduced a trap composed of 62 places in 2674 ms of which 16 ms to minimize.
[2024-05-22 18:06:45] [INFO ] Deduced a trap composed of 103 places in 2679 ms of which 16 ms to minimize.
[2024-05-22 18:06:48] [INFO ] Deduced a trap composed of 61 places in 2634 ms of which 16 ms to minimize.
[2024-05-22 18:06:51] [INFO ] Deduced a trap composed of 61 places in 2711 ms of which 16 ms to minimize.
SMT process timed out in 46635ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 382 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2802/2802 places, 10158/10158 transitions.
Applied a total of 0 rules in 379 ms. Remains 2802 /2802 variables (removed 0) and now considering 10158/10158 (removed 0) transitions.
[2024-05-22 18:06:51] [INFO ] Invariant cache hit.
[2024-05-22 18:06:55] [INFO ] Implicit Places using invariants in 3696 ms returned []
Implicit Place search using SMT only with invariants took 3705 ms to find 0 implicit places.
Running 10108 sub problems to find dead transitions.
[2024-05-22 18:06:55] [INFO ] Invariant cache hit.
[2024-05-22 18:06:55] [INFO ] State equation strengthened by 10008 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2801 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10108 unsolved
SMT process timed out in 44133ms, After SMT, problems are : Problem set: 0 solved, 10108 unsolved
Search for dead transitions found 0 dead transitions in 44212ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48309 ms. Remains : 2802/2802 places, 10158/10158 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07 in 206071 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 18:07:40] [INFO ] Computed 52 invariants in 399 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 172 ms. (57 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 18:07:40] [INFO ] Invariant cache hit.
[2024-05-22 18:07:40] [INFO ] [Real]Absence check using 50 positive place invariants in 43 ms returned sat
[2024-05-22 18:07:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 18:07:42] [INFO ] [Real]Absence check using state equation in 2035 ms returned sat
[2024-05-22 18:07:43] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 18:07:43] [INFO ] [Real]Added 9984 Read/Feed constraints in 851 ms returned sat
[2024-05-22 18:07:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:07:44] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 18:07:44] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 18:07:46] [INFO ] [Nat]Absence check using state equation in 2293 ms returned sat
[2024-05-22 18:07:47] [INFO ] [Nat]Added 9984 Read/Feed constraints in 868 ms returned sat
[2024-05-22 18:07:48] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 570 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1007 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1007 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 18:07:50] [INFO ] Computed 52 invariants in 352 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4341 resets) in 16064 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1711 ms. (584 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:08:08] [INFO ] Invariant cache hit.
[2024-05-22 18:08:08] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 18:08:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2024-05-22 18:08:10] [INFO ] [Real]Absence check using state equation in 2166 ms returned sat
[2024-05-22 18:08:11] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 18:08:12] [INFO ] [Real]Added 10007 Read/Feed constraints in 902 ms returned sat
[2024-05-22 18:08:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:08:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 18:08:12] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 18:08:14] [INFO ] [Nat]Absence check using state equation in 2218 ms returned sat
[2024-05-22 18:08:15] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1032 ms returned sat
[2024-05-22 18:08:16] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 622 ms.
[2024-05-22 18:08:18] [INFO ] Added : 9 causal constraints over 2 iterations in 2105 ms. Result :sat
Minimization took 6965 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 385 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 385 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 377 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:08:25] [INFO ] Invariant cache hit.
[2024-05-22 18:08:29] [INFO ] Implicit Places using invariants in 3579 ms returned []
Implicit Place search using SMT only with invariants took 3580 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:08:29] [INFO ] Invariant cache hit.
[2024-05-22 18:08:29] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 42685ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 42756ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46729 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 18:09:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4354 resets) in 15117 ms. (66 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1597 ms. (625 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:09:28] [INFO ] Invariant cache hit.
[2024-05-22 18:09:29] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 18:09:29] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 18:09:31] [INFO ] [Real]Absence check using state equation in 2154 ms returned sat
[2024-05-22 18:09:31] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 18:09:32] [INFO ] [Real]Added 10007 Read/Feed constraints in 949 ms returned sat
[2024-05-22 18:09:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:09:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 18:09:33] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:09:35] [INFO ] [Nat]Absence check using state equation in 2332 ms returned sat
[2024-05-22 18:09:36] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1032 ms returned sat
[2024-05-22 18:09:37] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 682 ms.
[2024-05-22 18:09:39] [INFO ] Added : 9 causal constraints over 2 iterations in 2217 ms. Result :sat
Minimization took 6412 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 434 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 417 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:09:46] [INFO ] Invariant cache hit.
[2024-05-22 18:09:50] [INFO ] Implicit Places using invariants in 3775 ms returned []
Implicit Place search using SMT only with invariants took 3777 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:09:50] [INFO ] Invariant cache hit.
[2024-05-22 18:09:50] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44975ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 45079ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49289 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 1011 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 86948 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 2
Probabilistic random walk after 86948 steps, saw 29767 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-22 18:10:38] [INFO ] Invariant cache hit.
[2024-05-22 18:10:38] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:10:39] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 18:10:42] [INFO ] Deduced a trap composed of 102 places in 2974 ms of which 22 ms to minimize.
[2024-05-22 18:10:45] [INFO ] Deduced a trap composed of 84 places in 3076 ms of which 18 ms to minimize.
SMT process timed out in 6939ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 416 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 417 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (173 resets) in 743 ms. (53 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 89341 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 89341 steps, saw 30077 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 18:10:49] [INFO ] Invariant cache hit.
[2024-05-22 18:10:49] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:10:49] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:10:53] [INFO ] Deduced a trap composed of 60 places in 3157 ms of which 20 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9907 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:10:59] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:11:03] [INFO ] Deduced a trap composed of 69 places in 3135 ms of which 19 ms to minimize.
[2024-05-22 18:11:06] [INFO ] Deduced a trap composed of 67 places in 3184 ms of which 17 ms to minimize.
[2024-05-22 18:11:09] [INFO ] Deduced a trap composed of 71 places in 2962 ms of which 18 ms to minimize.
[2024-05-22 18:11:12] [INFO ] Deduced a trap composed of 66 places in 3174 ms of which 19 ms to minimize.
[2024-05-22 18:11:15] [INFO ] Deduced a trap composed of 66 places in 2722 ms of which 18 ms to minimize.
[2024-05-22 18:11:18] [INFO ] Deduced a trap composed of 66 places in 3095 ms of which 17 ms to minimize.
[2024-05-22 18:11:21] [INFO ] Deduced a trap composed of 62 places in 3047 ms of which 19 ms to minimize.
[2024-05-22 18:11:24] [INFO ] Deduced a trap composed of 66 places in 3107 ms of which 19 ms to minimize.
[2024-05-22 18:11:27] [INFO ] Deduced a trap composed of 69 places in 3040 ms of which 18 ms to minimize.
[2024-05-22 18:11:30] [INFO ] Deduced a trap composed of 75 places in 2985 ms of which 18 ms to minimize.
[2024-05-22 18:11:33] [INFO ] Deduced a trap composed of 73 places in 2970 ms of which 20 ms to minimize.
[2024-05-22 18:11:36] [INFO ] Deduced a trap composed of 73 places in 2936 ms of which 19 ms to minimize.
[2024-05-22 18:11:39] [INFO ] Deduced a trap composed of 71 places in 2927 ms of which 18 ms to minimize.
[2024-05-22 18:11:42] [INFO ] Deduced a trap composed of 73 places in 3004 ms of which 17 ms to minimize.
[2024-05-22 18:11:45] [INFO ] Deduced a trap composed of 69 places in 3025 ms of which 18 ms to minimize.
SMT process timed out in 56587ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 393 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 397 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:11:46] [INFO ] Invariant cache hit.
[2024-05-22 18:11:50] [INFO ] Implicit Places using invariants in 3860 ms returned []
Implicit Place search using SMT only with invariants took 3861 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:11:50] [INFO ] Invariant cache hit.
[2024-05-22 18:11:50] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 1.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.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 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.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 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.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 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44441ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44535ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48810 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08 in 295105 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 18:12:35] [INFO ] Computed 52 invariants in 515 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (43 resets) in 173 ms. (57 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 19 ms. (500 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[50]
[2024-05-22 18:12:35] [INFO ] Invariant cache hit.
[2024-05-22 18:12:36] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 18:12:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 18:12:38] [INFO ] [Real]Absence check using state equation in 2203 ms returned sat
[2024-05-22 18:12:38] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 18:12:39] [INFO ] [Real]Added 9984 Read/Feed constraints in 968 ms returned sat
[2024-05-22 18:12:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:12:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 51 ms returned sat
[2024-05-22 18:12:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 18:12:42] [INFO ] [Nat]Absence check using state equation in 2198 ms returned sat
[2024-05-22 18:12:43] [INFO ] [Nat]Added 9984 Read/Feed constraints in 856 ms returned sat
[2024-05-22 18:12:43] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 547 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1040 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1041 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 18:12:46] [INFO ] Computed 52 invariants in 377 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 1000000 steps (4348 resets) in 14827 ms. (67 steps per ms)
BEST_FIRST walk for 1000001 steps (70 resets) in 1538 ms. (649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:13:02] [INFO ] Invariant cache hit.
[2024-05-22 18:13:02] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 18:13:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:13:04] [INFO ] [Real]Absence check using state equation in 1966 ms returned sat
[2024-05-22 18:13:05] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 18:13:06] [INFO ] [Real]Added 10007 Read/Feed constraints in 797 ms returned sat
[2024-05-22 18:13:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:13:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 42 ms returned sat
[2024-05-22 18:13:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:13:08] [INFO ] [Nat]Absence check using state equation in 1997 ms returned sat
[2024-05-22 18:13:09] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1166 ms returned sat
[2024-05-22 18:13:10] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 568 ms.
[2024-05-22 18:13:12] [INFO ] Added : 11 causal constraints over 3 iterations in 2485 ms. Result :sat
Minimization took 6391 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 390 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 377 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:13:19] [INFO ] Invariant cache hit.
[2024-05-22 18:13:23] [INFO ] Implicit Places using invariants in 3721 ms returned []
Implicit Place search using SMT only with invariants took 3721 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:13:23] [INFO ] Invariant cache hit.
[2024-05-22 18:13:23] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43047ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43122ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47232 ms. Remains : 2803/2803 places, 10159/10159 transitions.
[2024-05-22 18:14:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4357 resets) in 15834 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (69 resets) in 1672 ms. (597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:14:23] [INFO ] Invariant cache hit.
[2024-05-22 18:14:24] [INFO ] [Real]Absence check using 50 positive place invariants in 44 ms returned sat
[2024-05-22 18:14:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 21 ms returned sat
[2024-05-22 18:14:26] [INFO ] [Real]Absence check using state equation in 2177 ms returned sat
[2024-05-22 18:14:26] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 18:14:27] [INFO ] [Real]Added 10007 Read/Feed constraints in 934 ms returned sat
[2024-05-22 18:14:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:14:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 45 ms returned sat
[2024-05-22 18:14:28] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 20 ms returned sat
[2024-05-22 18:14:30] [INFO ] [Nat]Absence check using state equation in 2186 ms returned sat
[2024-05-22 18:14:31] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1295 ms returned sat
[2024-05-22 18:14:32] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 578 ms.
[2024-05-22 18:14:34] [INFO ] Added : 11 causal constraints over 3 iterations in 2498 ms. Result :sat
Minimization took 7519 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 423 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 425 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 392 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:14:42] [INFO ] Invariant cache hit.
[2024-05-22 18:14:46] [INFO ] Implicit Places using invariants in 3865 ms returned []
Implicit Place search using SMT only with invariants took 3867 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:14:46] [INFO ] Invariant cache hit.
[2024-05-22 18:14:46] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43627ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47985 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 851 ms. (46 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 453 ms. (88 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 83434 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 2
Probabilistic random walk after 83434 steps, saw 29250 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 18:15:33] [INFO ] Invariant cache hit.
[2024-05-22 18:15:34] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:15:34] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 18:15:37] [INFO ] Deduced a trap composed of 65 places in 3153 ms of which 19 ms to minimize.
[2024-05-22 18:15:41] [INFO ] Deduced a trap composed of 66 places in 2980 ms of which 19 ms to minimize.
SMT process timed out in 7086ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 394 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 875 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 88444 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 1
Probabilistic random walk after 88444 steps, saw 29963 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 18:15:44] [INFO ] Invariant cache hit.
[2024-05-22 18:15:44] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:15:45] [INFO ] Deduced a trap composed of 2 places in 89 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:15:48] [INFO ] Deduced a trap composed of 71 places in 2895 ms of which 18 ms to minimize.
[2024-05-22 18:15:51] [INFO ] Deduced a trap composed of 67 places in 3020 ms of which 18 ms to minimize.
[2024-05-22 18:15:54] [INFO ] Deduced a trap composed of 64 places in 2778 ms of which 16 ms to minimize.
[2024-05-22 18:15:57] [INFO ] Deduced a trap composed of 64 places in 2935 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12867 constraints, problems are : Problem set: 0 solved, 1 unsolved in 17737 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:16:02] [INFO ] Deduced a trap composed of 2 places in 70 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:16:05] [INFO ] Deduced a trap composed of 102 places in 2762 ms of which 17 ms to minimize.
[2024-05-22 18:16:09] [INFO ] Deduced a trap composed of 68 places in 3034 ms of which 18 ms to minimize.
[2024-05-22 18:16:11] [INFO ] Deduced a trap composed of 64 places in 2727 ms of which 18 ms to minimize.
[2024-05-22 18:16:14] [INFO ] Deduced a trap composed of 66 places in 2892 ms of which 19 ms to minimize.
[2024-05-22 18:16:17] [INFO ] Deduced a trap composed of 66 places in 3006 ms of which 18 ms to minimize.
[2024-05-22 18:16:20] [INFO ] Deduced a trap composed of 65 places in 2962 ms of which 17 ms to minimize.
[2024-05-22 18:16:23] [INFO ] Deduced a trap composed of 67 places in 2729 ms of which 15 ms to minimize.
[2024-05-22 18:16:26] [INFO ] Deduced a trap composed of 98 places in 2922 ms of which 17 ms to minimize.
[2024-05-22 18:16:29] [INFO ] Deduced a trap composed of 70 places in 2669 ms of which 17 ms to minimize.
[2024-05-22 18:16:32] [INFO ] Deduced a trap composed of 61 places in 2714 ms of which 16 ms to minimize.
[2024-05-22 18:16:34] [INFO ] Deduced a trap composed of 59 places in 2591 ms of which 16 ms to minimize.
[2024-05-22 18:16:37] [INFO ] Deduced a trap composed of 61 places in 2786 ms of which 17 ms to minimize.
[2024-05-22 18:16:40] [INFO ] Deduced a trap composed of 66 places in 2678 ms of which 16 ms to minimize.
[2024-05-22 18:16:42] [INFO ] Deduced a trap composed of 68 places in 2618 ms of which 18 ms to minimize.
[2024-05-22 18:16:45] [INFO ] Deduced a trap composed of 61 places in 2629 ms of which 18 ms to minimize.
[2024-05-22 18:16:48] [INFO ] Deduced a trap composed of 70 places in 2625 ms of which 18 ms to minimize.
SMT process timed out in 63476ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 383 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 383 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 383 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:16:48] [INFO ] Invariant cache hit.
[2024-05-22 18:16:52] [INFO ] Implicit Places using invariants in 3698 ms returned []
Implicit Place search using SMT only with invariants took 3701 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:16:52] [INFO ] Invariant cache hit.
[2024-05-22 18:16:52] [INFO ] State equation strengthened by 10007 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 43135ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 43211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47311 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[50]
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09 in 300941 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10
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:[50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[50]
// Phase 1: matrix 10170 rows 2814 cols
[2024-05-22 18:17:36] [INFO ] Computed 52 invariants in 410 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[50]
RANDOM walk for 10000 steps (42 resets) in 146 ms. (68 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:17:36] [INFO ] Invariant cache hit.
[2024-05-22 18:17:36] [INFO ] [Real]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 18:17:36] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 18:17:39] [INFO ] [Real]Absence check using state equation in 2175 ms returned sat
[2024-05-22 18:17:39] [INFO ] State equation strengthened by 9984 read => feed constraints.
[2024-05-22 18:17:40] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 18:17:40] [INFO ] [Real]Added 9984 Read/Feed constraints in 1140 ms returned sat
[2024-05-22 18:17:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:17:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 49 ms returned sat
[2024-05-22 18:17:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 24 ms returned sat
[2024-05-22 18:17:43] [INFO ] [Nat]Absence check using state equation in 2593 ms returned sat
[2024-05-22 18:17:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 18:17:44] [INFO ] [Nat]Added 9984 Read/Feed constraints in 1206 ms returned sat
[2024-05-22 18:17:45] [INFO ] Computed and/alt/rep : 7376/19554/7376 causal constraints (skipped 2744 transitions) in 609 ms.
[2024-05-22 18:17:45] [INFO ] Added : 0 causal constraints over 0 iterations in 613 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10170/10170 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 2803 transition count 10159
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 2803 transition count 10159
Applied a total of 25 rules in 1045 ms. Remains 2803 /2814 variables (removed 11) and now considering 10159/10170 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1046 ms. Remains : 2803/2814 places, 10159/10170 transitions.
// Phase 1: matrix 10159 rows 2803 cols
[2024-05-22 18:17:47] [INFO ] Computed 52 invariants in 335 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[50]
RANDOM walk for 1000000 steps (4350 resets) in 16154 ms. (61 steps per ms)
BEST_FIRST walk for 1000001 steps (68 resets) in 1690 ms. (591 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[50]
[2024-05-22 18:18:04] [INFO ] Invariant cache hit.
[2024-05-22 18:18:05] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2024-05-22 18:18:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 23 ms returned sat
[2024-05-22 18:18:07] [INFO ] [Real]Absence check using state equation in 2342 ms returned sat
[2024-05-22 18:18:07] [INFO ] State equation strengthened by 10007 read => feed constraints.
[2024-05-22 18:18:08] [INFO ] [Real]Added 10007 Read/Feed constraints in 1004 ms returned sat
[2024-05-22 18:18:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:18:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2024-05-22 18:18:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 22 ms returned sat
[2024-05-22 18:18:11] [INFO ] [Nat]Absence check using state equation in 2101 ms returned sat
[2024-05-22 18:18:12] [INFO ] [Nat]Added 10007 Read/Feed constraints in 1090 ms returned sat
[2024-05-22 18:18:13] [INFO ] Computed and/alt/rep : 7365/19586/7365 causal constraints (skipped 2744 transitions) in 596 ms.
[2024-05-22 18:18:15] [INFO ] Added : 11 causal constraints over 3 iterations in 2529 ms. Result :sat
Minimization took 7976 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[50]
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 426 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 426 ms. Remains : 2803/2803 places, 10159/10159 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 401 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
[2024-05-22 18:18:24] [INFO ] Invariant cache hit.
[2024-05-22 18:18:28] [INFO ] Implicit Places using invariants in 3828 ms returned []
Implicit Place search using SMT only with invariants took 3832 ms to find 0 implicit places.
Running 10109 sub problems to find dead transitions.
[2024-05-22 18:18:28] [INFO ] Invariant cache hit.
[2024-05-22 18:18:28] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2802 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 10109 unsolved
SMT process timed out in 44554ms, After SMT, problems are : Problem set: 0 solved, 10109 unsolved
Search for dead transitions found 0 dead transitions in 44650ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48901 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (171 resets) in 713 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 87208 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87208 steps, saw 29805 distinct states, run finished after 3002 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-22 18:19:16] [INFO ] Invariant cache hit.
[2024-05-22 18:19:16] [INFO ] State equation strengthened by 10007 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 18:19:16] [INFO ] Deduced a trap composed of 2 places in 68 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 18:19:20] [INFO ] Deduced a trap composed of 65 places in 3116 ms of which 19 ms to minimize.
[2024-05-22 18:19:22] [INFO ] Deduced a trap composed of 66 places in 2874 ms of which 17 ms to minimize.
SMT process timed out in 6958ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2803/2803 places, 10159/10159 transitions.
Applied a total of 0 rules in 382 ms. Remains 2803 /2803 variables (removed 0) and now considering 10159/10159 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 2803/2803 places, 10159/10159 transitions.
RANDOM walk for 40000 steps (172 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 91130 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 1
Probabilistic random walk after 91130 steps, saw 30327 distinct states, run finished after 3002 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-22 18:19:26] [INFO ] Invariant cache hit.
[2024-05-22 18:19:26] [INFO ] State equation strengthened by 10007 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:19:27] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 98/2799 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2799 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/2801 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:19:30] [INFO ] Deduced a trap composed of 60 places in 2760 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2801 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 10159/12960 variables, 2801/2855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/12960 variables, 10007/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12960 variables, 0/12862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/12962 variables, 2/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/12962 variables, 0/12864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12962/12962 variables, and 12864 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8768 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 2803/2803 constraints, ReadFeed: 10007/10007 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 2700/2701 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2701 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:19:35] [INFO ] Deduced a trap composed of 2 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/2701 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2701 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 98/2799 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2799 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/2801 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2801 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 18:19:39] [INFO ] Deduced a trap composed of 102 places in 3090 ms of which 18 ms to minimize.
[2024-05-22 18:19:42] [INFO ] Deduced a trap composed of 64 places in 3012 ms of which 17 ms to minimize.
[2024-05-22 18:19:45] [INFO ] Deduced a trap composed of 65 places in 2963 ms of which 17 ms to minimize.
BK_TIME_CONFINEMENT_REACHED
--------------------
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
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="CANInsertWithFailure-PT-050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CANInsertWithFailure-PT-050, 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 r069-tall-171620503900133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;