Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r313-tall-167873966100437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is PolyORBNT-COL-S10J60, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100437
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.4K Feb 26 00:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 00:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 00:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 00:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 01:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 01:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1678891767878

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBNT-COL-S10J60
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:49:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:49:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:49:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 14:49:29] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:49:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 747 ms
[2023-03-15 14:49:30] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 20 ms.
[2023-03-15 14:49:30] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 187 ms.
[2023-03-15 14:49:30] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:49:30] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:49:30] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:49:30] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 60 places in 30 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 1205 ms. (steps per millisecond=8 ) properties (out of 36) seen :6
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 124 ms. (steps per millisecond=8 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-03-15 14:49:32] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-15 14:49:32] [INFO ] Computed 152 place invariants in 164 ms
[2023-03-15 14:49:35] [INFO ] [Real]Absence check using 145 positive place invariants in 60 ms returned sat
[2023-03-15 14:49:35] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 14:49:40] [INFO ] After 4424ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:15
[2023-03-15 14:49:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:49:40] [INFO ] After 285ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-15 14:49:40] [INFO ] After 611ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:15
Attempting to minimize the solution found.
Minimization took 204 ms.
[2023-03-15 14:49:41] [INFO ] After 6588ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:15
[2023-03-15 14:49:41] [INFO ] [Nat]Absence check using 145 positive place invariants in 52 ms returned sat
[2023-03-15 14:49:41] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2023-03-15 14:50:04] [INFO ] After 22429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:50:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:50:06] [INFO ] After 25097ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:15
Parikh walk visited 0 properties in 561 ms.
Support contains 1065 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 18 place count 1220 transition count 2806
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 1220 transition count 2805
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1217 transition count 2803
Applied a total of 24 rules in 293 ms. Remains 1217 /1234 variables (removed 17) and now considering 2803/2810 (removed 7) transitions.
[2023-03-15 14:50:07] [INFO ] Flow matrix only has 2794 transitions (discarded 9 similar events)
// Phase 1: matrix 2794 rows 1217 cols
[2023-03-15 14:50:07] [INFO ] Computed 142 place invariants in 113 ms
[2023-03-15 14:50:08] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1217/1234 places, 2188/2810 transitions.
Applied a total of 0 rules in 45 ms. Remains 1217 /1217 variables (removed 0) and now considering 2188/2188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2252 ms. Remains : 1217/1234 places, 2188/2810 transitions.
Incomplete random walk after 1000000 steps, including 66949 resets, run finished after 7953 ms. (steps per millisecond=125 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 1000001 steps, including 9557 resets, run finished after 1998 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:50:19] [INFO ] Flow matrix only has 2179 transitions (discarded 9 similar events)
// Phase 1: matrix 2179 rows 1217 cols
[2023-03-15 14:50:19] [INFO ] Computed 142 place invariants in 63 ms
[2023-03-15 14:50:19] [INFO ] [Real]Absence check using 136 positive place invariants in 37 ms returned sat
[2023-03-15 14:50:19] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 28 ms returned sat
[2023-03-15 14:50:19] [INFO ] After 224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:50:19] [INFO ] [Nat]Absence check using 136 positive place invariants in 36 ms returned sat
[2023-03-15 14:50:19] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 29 ms returned sat
[2023-03-15 14:50:20] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:50:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:29] [INFO ] After 9031ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:50:29] [INFO ] After 9909ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 2188/2188 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 1217 transition count 2126
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 1155 transition count 2126
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 124 place count 1155 transition count 2062
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 252 place count 1091 transition count 2062
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 254 place count 1090 transition count 2061
Applied a total of 254 rules in 245 ms. Remains 1090 /1217 variables (removed 127) and now considering 2061/2188 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 1090/1217 places, 2061/2188 transitions.
Incomplete random walk after 1000000 steps, including 72708 resets, run finished after 10446 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7116 resets, run finished after 2006 ms. (steps per millisecond=498 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3846139 steps, run timeout after 36001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 3846139 steps, saw 644650 distinct states, run finished after 36002 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:17] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2023-03-15 14:51:18] [INFO ] Computed 142 place invariants in 66 ms
[2023-03-15 14:51:18] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 14:51:18] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:51:18] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:18] [INFO ] [Nat]Absence check using 135 positive place invariants in 33 ms returned sat
[2023-03-15 14:51:18] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-15 14:51:18] [INFO ] After 562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:20] [INFO ] After 1156ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 434 places in 465 ms of which 2 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 440 places in 460 ms of which 1 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 434 places in 454 ms of which 3 ms to minimize.
[2023-03-15 14:51:22] [INFO ] Deduced a trap composed of 438 places in 454 ms of which 2 ms to minimize.
[2023-03-15 14:51:22] [INFO ] Deduced a trap composed of 440 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 444 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:51:24] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 1 ms to minimize.
[2023-03-15 14:51:24] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 430 places in 469 ms of which 1 ms to minimize.
[2023-03-15 14:51:26] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:51:26] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:51:27] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:51:27] [INFO ] Deduced a trap composed of 442 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:51:28] [INFO ] Deduced a trap composed of 442 places in 428 ms of which 1 ms to minimize.
[2023-03-15 14:51:29] [INFO ] Deduced a trap composed of 438 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:51:29] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:51:30] [INFO ] Deduced a trap composed of 436 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:51:30] [INFO ] Deduced a trap composed of 434 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:51:31] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:51:32] [INFO ] Deduced a trap composed of 448 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:51:32] [INFO ] Deduced a trap composed of 432 places in 450 ms of which 2 ms to minimize.
[2023-03-15 14:51:33] [INFO ] Deduced a trap composed of 444 places in 450 ms of which 1 ms to minimize.
[2023-03-15 14:51:33] [INFO ] Deduced a trap composed of 438 places in 454 ms of which 0 ms to minimize.
[2023-03-15 14:51:34] [INFO ] Deduced a trap composed of 444 places in 439 ms of which 1 ms to minimize.
[2023-03-15 14:51:35] [INFO ] Deduced a trap composed of 432 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:51:35] [INFO ] Deduced a trap composed of 436 places in 422 ms of which 2 ms to minimize.
[2023-03-15 14:51:36] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:51:37] [INFO ] Deduced a trap composed of 446 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:51:37] [INFO ] Deduced a trap composed of 442 places in 443 ms of which 0 ms to minimize.
[2023-03-15 14:51:38] [INFO ] Deduced a trap composed of 440 places in 418 ms of which 0 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 430 places in 434 ms of which 1 ms to minimize.
[2023-03-15 14:51:39] [INFO ] Deduced a trap composed of 451 places in 456 ms of which 1 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 446 places in 420 ms of which 4 ms to minimize.
[2023-03-15 14:51:40] [INFO ] Deduced a trap composed of 446 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:51:42] [INFO ] Deduced a trap composed of 438 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 438 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:51:43] [INFO ] Deduced a trap composed of 432 places in 432 ms of which 0 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:51:44] [INFO ] Deduced a trap composed of 444 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:51:45] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:51:46] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:51:47] [INFO ] Deduced a trap composed of 450 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:51:49] [INFO ] Deduced a trap composed of 434 places in 428 ms of which 1 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 432 places in 427 ms of which 2 ms to minimize.
[2023-03-15 14:51:50] [INFO ] Deduced a trap composed of 428 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:51:54] [INFO ] Deduced a trap composed of 444 places in 444 ms of which 1 ms to minimize.
[2023-03-15 14:51:56] [INFO ] Deduced a trap composed of 460 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:51:59] [INFO ] Deduced a trap composed of 438 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:52:08] [INFO ] Trap strengthening (SAT) tested/added 49/49 trap constraints in 48718 ms
[2023-03-15 14:52:09] [INFO ] After 50078ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:52:09] [INFO ] After 50846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 14:52:09] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:52:09] [INFO ] Invariant cache hit.
[2023-03-15 14:52:10] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-15 14:52:10] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:52:10] [INFO ] Invariant cache hit.
[2023-03-15 14:52:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:17] [INFO ] Implicit Places using invariants and state equation in 6951 ms returned []
Implicit Place search using SMT with State Equation took 7867 ms to find 0 implicit places.
[2023-03-15 14:52:17] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-15 14:52:17] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:52:17] [INFO ] Invariant cache hit.
[2023-03-15 14:52:18] [INFO ] Dead Transitions using invariants and state equation in 1057 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9086 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7315 resets, run finished after 1162 ms. (steps per millisecond=86 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:52:19] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:52:19] [INFO ] Invariant cache hit.
[2023-03-15 14:52:19] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2023-03-15 14:52:19] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:52:20] [INFO ] After 523ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:52:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:20] [INFO ] After 170ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:52:20] [INFO ] After 280ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:20] [INFO ] After 980ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:20] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:52:20] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 14:52:21] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:21] [INFO ] After 390ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:21] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 2 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 442 places in 452 ms of which 1 ms to minimize.
[2023-03-15 14:52:22] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:52:23] [INFO ] Deduced a trap composed of 446 places in 488 ms of which 1 ms to minimize.
[2023-03-15 14:52:24] [INFO ] Deduced a trap composed of 454 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:52:24] [INFO ] Deduced a trap composed of 442 places in 434 ms of which 1 ms to minimize.
[2023-03-15 14:52:25] [INFO ] Deduced a trap composed of 442 places in 424 ms of which 4 ms to minimize.
[2023-03-15 14:52:25] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 1 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 444 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:52:26] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 0 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 452 places in 415 ms of which 0 ms to minimize.
[2023-03-15 14:52:27] [INFO ] Deduced a trap composed of 440 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 452 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:52:28] [INFO ] Deduced a trap composed of 432 places in 445 ms of which 12 ms to minimize.
[2023-03-15 14:52:29] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:52:29] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 0 ms to minimize.
[2023-03-15 14:52:30] [INFO ] Deduced a trap composed of 440 places in 425 ms of which 3 ms to minimize.
[2023-03-15 14:52:30] [INFO ] Deduced a trap composed of 424 places in 444 ms of which 13 ms to minimize.
[2023-03-15 14:52:31] [INFO ] Deduced a trap composed of 432 places in 449 ms of which 1 ms to minimize.
[2023-03-15 14:52:32] [INFO ] Deduced a trap composed of 436 places in 437 ms of which 0 ms to minimize.
[2023-03-15 14:52:32] [INFO ] Deduced a trap composed of 440 places in 432 ms of which 1 ms to minimize.
[2023-03-15 14:52:34] [INFO ] Deduced a trap composed of 440 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:52:34] [INFO ] Deduced a trap composed of 442 places in 431 ms of which 1 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 450 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:52:35] [INFO ] Deduced a trap composed of 444 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:52:36] [INFO ] Deduced a trap composed of 434 places in 426 ms of which 0 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 448 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 450 places in 435 ms of which 1 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 452 places in 427 ms of which 0 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 454 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 444 places in 439 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 440 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 438 places in 433 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 445 places in 451 ms of which 1 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 447 places in 462 ms of which 1 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 439 places in 446 ms of which 1 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 453 places in 442 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 438 places in 432 ms of which 1 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 448 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 446 places in 421 ms of which 0 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 448 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 452 places in 434 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 440 places in 431 ms of which 1 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 455 places in 433 ms of which 0 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 447 places in 452 ms of which 1 ms to minimize.
[2023-03-15 14:52:59] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 38289 ms
[2023-03-15 14:52:59] [INFO ] After 38746ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:52:59] [INFO ] After 39470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72614 resets, run finished after 10800 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7230 resets, run finished after 2021 ms. (steps per millisecond=494 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3857304 steps, run timeout after 36001 ms. (steps per millisecond=107 ) properties seen :{}
Probabilistic random walk after 3857304 steps, saw 646578 distinct states, run finished after 36001 ms. (steps per millisecond=107 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:53:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:53:48] [INFO ] Invariant cache hit.
[2023-03-15 14:53:48] [INFO ] [Real]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:53:48] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:53:48] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:53:48] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:53:49] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-15 14:53:49] [INFO ] After 578ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:53:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:53:50] [INFO ] After 610ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:53:50] [INFO ] Deduced a trap composed of 446 places in 453 ms of which 1 ms to minimize.
[2023-03-15 14:53:51] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:53:51] [INFO ] Deduced a trap composed of 444 places in 449 ms of which 1 ms to minimize.
[2023-03-15 14:53:52] [INFO ] Deduced a trap composed of 444 places in 434 ms of which 1 ms to minimize.
[2023-03-15 14:53:52] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:53:53] [INFO ] Deduced a trap composed of 438 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:53:53] [INFO ] Deduced a trap composed of 436 places in 413 ms of which 0 ms to minimize.
[2023-03-15 14:53:54] [INFO ] Deduced a trap composed of 448 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:53:55] [INFO ] Deduced a trap composed of 444 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:53:55] [INFO ] Deduced a trap composed of 436 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:53:56] [INFO ] Deduced a trap composed of 442 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:53:56] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:53:57] [INFO ] Deduced a trap composed of 434 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:53:58] [INFO ] Deduced a trap composed of 442 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:53:58] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:53:59] [INFO ] Deduced a trap composed of 452 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:53:59] [INFO ] Deduced a trap composed of 446 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:54:00] [INFO ] Deduced a trap composed of 444 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:54:01] [INFO ] Deduced a trap composed of 456 places in 412 ms of which 1 ms to minimize.
[2023-03-15 14:54:01] [INFO ] Deduced a trap composed of 454 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:54:02] [INFO ] Deduced a trap composed of 430 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:54:03] [INFO ] Deduced a trap composed of 446 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:54:03] [INFO ] Deduced a trap composed of 448 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:54:04] [INFO ] Deduced a trap composed of 453 places in 444 ms of which 1 ms to minimize.
[2023-03-15 14:54:04] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:54:05] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 0 ms to minimize.
[2023-03-15 14:54:05] [INFO ] Deduced a trap composed of 440 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:54:07] [INFO ] Deduced a trap composed of 444 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:54:08] [INFO ] Deduced a trap composed of 442 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:54:10] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:54:11] [INFO ] Deduced a trap composed of 446 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:54:12] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 1 ms to minimize.
[2023-03-15 14:54:14] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:54:14] [INFO ] Deduced a trap composed of 443 places in 450 ms of which 1 ms to minimize.
[2023-03-15 14:54:17] [INFO ] Deduced a trap composed of 428 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:54:20] [INFO ] Deduced a trap composed of 432 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:54:29] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 38796 ms
[2023-03-15 14:54:29] [INFO ] After 39544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:54:29] [INFO ] After 40306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 44 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 14:54:29] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:54:29] [INFO ] Invariant cache hit.
[2023-03-15 14:54:30] [INFO ] Implicit Places using invariants in 843 ms returned []
[2023-03-15 14:54:30] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:54:30] [INFO ] Invariant cache hit.
[2023-03-15 14:54:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:54:37] [INFO ] Implicit Places using invariants and state equation in 7508 ms returned []
Implicit Place search using SMT with State Equation took 8354 ms to find 0 implicit places.
[2023-03-15 14:54:37] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-15 14:54:37] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:54:37] [INFO ] Invariant cache hit.
[2023-03-15 14:54:38] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9556 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 100000 steps, including 7251 resets, run finished after 1096 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:54:39] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:54:39] [INFO ] Invariant cache hit.
[2023-03-15 14:54:40] [INFO ] [Real]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 14:54:40] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:54:40] [INFO ] After 521ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:54:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:54:40] [INFO ] After 177ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:54:40] [INFO ] After 285ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:54:40] [INFO ] After 954ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:54:40] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 14:54:40] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:54:41] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:54:41] [INFO ] After 378ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:54:42] [INFO ] Deduced a trap composed of 442 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:54:42] [INFO ] Deduced a trap composed of 442 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:54:43] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 1 ms to minimize.
[2023-03-15 14:54:43] [INFO ] Deduced a trap composed of 446 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:54:44] [INFO ] Deduced a trap composed of 454 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:54:44] [INFO ] Deduced a trap composed of 442 places in 436 ms of which 2 ms to minimize.
[2023-03-15 14:54:45] [INFO ] Deduced a trap composed of 442 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:54:45] [INFO ] Deduced a trap composed of 438 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:54:46] [INFO ] Deduced a trap composed of 444 places in 419 ms of which 2 ms to minimize.
[2023-03-15 14:54:46] [INFO ] Deduced a trap composed of 442 places in 422 ms of which 0 ms to minimize.
[2023-03-15 14:54:47] [INFO ] Deduced a trap composed of 452 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:54:47] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:54:48] [INFO ] Deduced a trap composed of 452 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:54:48] [INFO ] Deduced a trap composed of 432 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:54:49] [INFO ] Deduced a trap composed of 444 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:54:49] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:54:50] [INFO ] Deduced a trap composed of 440 places in 417 ms of which 1 ms to minimize.
[2023-03-15 14:54:51] [INFO ] Deduced a trap composed of 424 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:54:51] [INFO ] Deduced a trap composed of 432 places in 441 ms of which 1 ms to minimize.
[2023-03-15 14:54:52] [INFO ] Deduced a trap composed of 436 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:54:53] [INFO ] Deduced a trap composed of 440 places in 412 ms of which 1 ms to minimize.
[2023-03-15 14:54:54] [INFO ] Deduced a trap composed of 440 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:54:54] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:54:55] [INFO ] Deduced a trap composed of 450 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:54:56] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:54:56] [INFO ] Deduced a trap composed of 434 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:54:57] [INFO ] Deduced a trap composed of 438 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:54:57] [INFO ] Deduced a trap composed of 448 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:54:58] [INFO ] Deduced a trap composed of 450 places in 415 ms of which 0 ms to minimize.
[2023-03-15 14:54:58] [INFO ] Deduced a trap composed of 452 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:54:59] [INFO ] Deduced a trap composed of 454 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:55:00] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:55:00] [INFO ] Deduced a trap composed of 440 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:55:01] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:55:01] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:55:03] [INFO ] Deduced a trap composed of 445 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:55:03] [INFO ] Deduced a trap composed of 447 places in 435 ms of which 1 ms to minimize.
[2023-03-15 14:55:04] [INFO ] Deduced a trap composed of 439 places in 449 ms of which 1 ms to minimize.
[2023-03-15 14:55:04] [INFO ] Deduced a trap composed of 453 places in 442 ms of which 1 ms to minimize.
[2023-03-15 14:55:05] [INFO ] Deduced a trap composed of 442 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:55:07] [INFO ] Deduced a trap composed of 438 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:55:07] [INFO ] Deduced a trap composed of 448 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:55:08] [INFO ] Deduced a trap composed of 446 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:55:08] [INFO ] Deduced a trap composed of 448 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:55:09] [INFO ] Deduced a trap composed of 452 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:55:09] [INFO ] Deduced a trap composed of 440 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:55:10] [INFO ] Deduced a trap composed of 455 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:55:10] [INFO ] Deduced a trap composed of 447 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:55:19] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 37688 ms
[2023-03-15 14:55:19] [INFO ] After 38124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:55:19] [INFO ] After 38824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 746 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 316615 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316615 steps, saw 51626 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:55:22] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:55:22] [INFO ] Invariant cache hit.
[2023-03-15 14:55:22] [INFO ] [Real]Absence check using 135 positive place invariants in 32 ms returned sat
[2023-03-15 14:55:22] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:55:23] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:55:23] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 14:55:23] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-15 14:55:23] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:55:24] [INFO ] After 605ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:24] [INFO ] Deduced a trap composed of 446 places in 452 ms of which 1 ms to minimize.
[2023-03-15 14:55:25] [INFO ] Deduced a trap composed of 442 places in 446 ms of which 1 ms to minimize.
[2023-03-15 14:55:26] [INFO ] Deduced a trap composed of 442 places in 417 ms of which 1 ms to minimize.
[2023-03-15 14:55:26] [INFO ] Deduced a trap composed of 442 places in 408 ms of which 1 ms to minimize.
[2023-03-15 14:55:26] [INFO ] Deduced a trap composed of 436 places in 417 ms of which 1 ms to minimize.
[2023-03-15 14:55:27] [INFO ] Deduced a trap composed of 442 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:55:27] [INFO ] Deduced a trap composed of 438 places in 416 ms of which 1 ms to minimize.
[2023-03-15 14:55:28] [INFO ] Deduced a trap composed of 444 places in 412 ms of which 1 ms to minimize.
[2023-03-15 14:55:28] [INFO ] Deduced a trap composed of 452 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:55:29] [INFO ] Deduced a trap composed of 434 places in 443 ms of which 0 ms to minimize.
[2023-03-15 14:55:30] [INFO ] Deduced a trap composed of 434 places in 423 ms of which 1 ms to minimize.
[2023-03-15 14:55:30] [INFO ] Deduced a trap composed of 444 places in 415 ms of which 1 ms to minimize.
[2023-03-15 14:55:31] [INFO ] Deduced a trap composed of 432 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:55:31] [INFO ] Deduced a trap composed of 436 places in 427 ms of which 2 ms to minimize.
[2023-03-15 14:55:32] [INFO ] Deduced a trap composed of 444 places in 418 ms of which 0 ms to minimize.
[2023-03-15 14:55:32] [INFO ] Deduced a trap composed of 438 places in 431 ms of which 1 ms to minimize.
[2023-03-15 14:55:33] [INFO ] Deduced a trap composed of 438 places in 423 ms of which 0 ms to minimize.
[2023-03-15 14:55:34] [INFO ] Deduced a trap composed of 438 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:55:34] [INFO ] Deduced a trap composed of 446 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:55:35] [INFO ] Deduced a trap composed of 454 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:55:35] [INFO ] Deduced a trap composed of 440 places in 421 ms of which 1 ms to minimize.
[2023-03-15 14:55:36] [INFO ] Deduced a trap composed of 436 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:55:36] [INFO ] Deduced a trap composed of 432 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:55:37] [INFO ] Deduced a trap composed of 444 places in 417 ms of which 1 ms to minimize.
[2023-03-15 14:55:39] [INFO ] Deduced a trap composed of 444 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:55:40] [INFO ] Deduced a trap composed of 452 places in 431 ms of which 1 ms to minimize.
[2023-03-15 14:55:40] [INFO ] Deduced a trap composed of 448 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:41] [INFO ] Deduced a trap composed of 452 places in 408 ms of which 1 ms to minimize.
[2023-03-15 14:55:42] [INFO ] Deduced a trap composed of 446 places in 435 ms of which 1 ms to minimize.
[2023-03-15 14:55:42] [INFO ] Deduced a trap composed of 440 places in 433 ms of which 1 ms to minimize.
[2023-03-15 14:55:43] [INFO ] Deduced a trap composed of 434 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:43] [INFO ] Deduced a trap composed of 432 places in 423 ms of which 0 ms to minimize.
[2023-03-15 14:55:44] [INFO ] Deduced a trap composed of 438 places in 409 ms of which 1 ms to minimize.
[2023-03-15 14:55:44] [INFO ] Deduced a trap composed of 446 places in 411 ms of which 0 ms to minimize.
[2023-03-15 14:55:45] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:46] [INFO ] Deduced a trap composed of 444 places in 414 ms of which 1 ms to minimize.
[2023-03-15 14:55:46] [INFO ] Deduced a trap composed of 448 places in 428 ms of which 1 ms to minimize.
[2023-03-15 14:55:47] [INFO ] Deduced a trap composed of 440 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:55:48] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 23644 ms
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:55:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:55:48] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 14:55:48] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:55:48] [INFO ] Invariant cache hit.
[2023-03-15 14:55:49] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1082 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Incomplete random walk after 10000 steps, including 735 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 316228 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :{}
Probabilistic random walk after 316228 steps, saw 51572 distinct states, run finished after 3001 ms. (steps per millisecond=105 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:55:52] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:55:52] [INFO ] Invariant cache hit.
[2023-03-15 14:55:52] [INFO ] [Real]Absence check using 135 positive place invariants in 31 ms returned sat
[2023-03-15 14:55:52] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-15 14:55:52] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:55:52] [INFO ] [Nat]Absence check using 135 positive place invariants in 28 ms returned sat
[2023-03-15 14:55:52] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2023-03-15 14:55:53] [INFO ] After 575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:55:53] [INFO ] After 579ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:54] [INFO ] Deduced a trap composed of 446 places in 441 ms of which 1 ms to minimize.
[2023-03-15 14:55:54] [INFO ] Deduced a trap composed of 442 places in 431 ms of which 1 ms to minimize.
[2023-03-15 14:55:55] [INFO ] Deduced a trap composed of 442 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:55] [INFO ] Deduced a trap composed of 442 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:55:56] [INFO ] Deduced a trap composed of 436 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:56] [INFO ] Deduced a trap composed of 442 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:55:57] [INFO ] Deduced a trap composed of 438 places in 419 ms of which 1 ms to minimize.
[2023-03-15 14:55:57] [INFO ] Deduced a trap composed of 444 places in 418 ms of which 1 ms to minimize.
[2023-03-15 14:55:58] [INFO ] Deduced a trap composed of 452 places in 421 ms of which 0 ms to minimize.
[2023-03-15 14:55:59] [INFO ] Deduced a trap composed of 434 places in 445 ms of which 1 ms to minimize.
[2023-03-15 14:55:59] [INFO ] Deduced a trap composed of 434 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:56:00] [INFO ] Deduced a trap composed of 444 places in 426 ms of which 2 ms to minimize.
[2023-03-15 14:56:00] [INFO ] Deduced a trap composed of 432 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:56:01] [INFO ] Deduced a trap composed of 436 places in 433 ms of which 0 ms to minimize.
[2023-03-15 14:56:01] [INFO ] Deduced a trap composed of 444 places in 421 ms of which 0 ms to minimize.
[2023-03-15 14:56:02] [INFO ] Deduced a trap composed of 438 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:56:02] [INFO ] Deduced a trap composed of 438 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:56:03] [INFO ] Deduced a trap composed of 438 places in 426 ms of which 1 ms to minimize.
[2023-03-15 14:56:03] [INFO ] Deduced a trap composed of 446 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:56:04] [INFO ] Deduced a trap composed of 454 places in 442 ms of which 1 ms to minimize.
[2023-03-15 14:56:05] [INFO ] Deduced a trap composed of 440 places in 429 ms of which 1 ms to minimize.
[2023-03-15 14:56:05] [INFO ] Deduced a trap composed of 436 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:56:06] [INFO ] Deduced a trap composed of 432 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:56:06] [INFO ] Deduced a trap composed of 444 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:56:09] [INFO ] Deduced a trap composed of 444 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:56:09] [INFO ] Deduced a trap composed of 452 places in 435 ms of which 0 ms to minimize.
[2023-03-15 14:56:10] [INFO ] Deduced a trap composed of 448 places in 438 ms of which 1 ms to minimize.
[2023-03-15 14:56:10] [INFO ] Deduced a trap composed of 452 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:56:11] [INFO ] Deduced a trap composed of 446 places in 448 ms of which 0 ms to minimize.
[2023-03-15 14:56:12] [INFO ] Deduced a trap composed of 440 places in 447 ms of which 1 ms to minimize.
[2023-03-15 14:56:13] [INFO ] Deduced a trap composed of 434 places in 436 ms of which 1 ms to minimize.
[2023-03-15 14:56:13] [INFO ] Deduced a trap composed of 432 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:56:14] [INFO ] Deduced a trap composed of 438 places in 428 ms of which 0 ms to minimize.
[2023-03-15 14:56:14] [INFO ] Deduced a trap composed of 446 places in 420 ms of which 1 ms to minimize.
[2023-03-15 14:56:15] [INFO ] Deduced a trap composed of 440 places in 427 ms of which 1 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 444 places in 422 ms of which 3 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 448 places in 430 ms of which 1 ms to minimize.
[2023-03-15 14:56:17] [INFO ] Deduced a trap composed of 440 places in 422 ms of which 1 ms to minimize.
[2023-03-15 14:56:17] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 23664 ms
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 14:56:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:56:17] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 46 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 48 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2023-03-15 14:56:17] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:56:17] [INFO ] Invariant cache hit.
[2023-03-15 14:56:18] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-15 14:56:18] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:56:18] [INFO ] Invariant cache hit.
[2023-03-15 14:56:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:56:23] [INFO ] Implicit Places using invariants and state equation in 5283 ms returned []
Implicit Place search using SMT with State Equation took 6102 ms to find 0 implicit places.
[2023-03-15 14:56:23] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-15 14:56:23] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2023-03-15 14:56:23] [INFO ] Invariant cache hit.
[2023-03-15 14:56:24] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7256 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 196 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2040 rows 1078 cols
[2023-03-15 14:56:25] [INFO ] Computed 142 place invariants in 33 ms
[2023-03-15 14:56:25] [INFO ] [Real]Absence check using 135 positive place invariants in 30 ms returned sat
[2023-03-15 14:56:25] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-15 14:56:25] [INFO ] After 542ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 438 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 519 ms
[2023-03-15 14:56:26] [INFO ] After 1105ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:56:26] [INFO ] After 1336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:56:26] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:56:26] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-15 14:56:27] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 438 places in 408 ms of which 8 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 438 places in 408 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 436 places in 408 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 430 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 446 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 434 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 444 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 444 places in 389 ms of which 1 ms to minimize.
[2023-03-15 14:56:31] [INFO ] Deduced a trap composed of 444 places in 399 ms of which 1 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:56:32] [INFO ] Deduced a trap composed of 434 places in 383 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 440 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 424 places in 385 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 438 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 440 places in 389 ms of which 1 ms to minimize.
[2023-03-15 14:56:34] [INFO ] Deduced a trap composed of 446 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 440 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:56:35] [INFO ] Deduced a trap composed of 458 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 442 places in 403 ms of which 1 ms to minimize.
[2023-03-15 14:56:36] [INFO ] Deduced a trap composed of 444 places in 401 ms of which 1 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 446 places in 404 ms of which 1 ms to minimize.
[2023-03-15 14:56:37] [INFO ] Deduced a trap composed of 444 places in 412 ms of which 1 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 434 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 440 places in 405 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 438 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 436 places in 412 ms of which 0 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:56:40] [INFO ] Deduced a trap composed of 442 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:56:41] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 0 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:56:42] [INFO ] Deduced a trap composed of 436 places in 385 ms of which 1 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:56:43] [INFO ] Deduced a trap composed of 444 places in 390 ms of which 0 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 448 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 448 places in 387 ms of which 1 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 434 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:56:45] [INFO ] Deduced a trap composed of 434 places in 401 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 442 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:56:46] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 434 places in 386 ms of which 0 ms to minimize.
[2023-03-15 14:56:47] [INFO ] Deduced a trap composed of 444 places in 383 ms of which 0 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 450 places in 403 ms of which 1 ms to minimize.
[2023-03-15 14:56:48] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 442 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:56:49] [INFO ] Deduced a trap composed of 430 places in 398 ms of which 0 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 0 ms to minimize.
[2023-03-15 14:56:50] [INFO ] Deduced a trap composed of 454 places in 401 ms of which 1 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 426 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 442 places in 404 ms of which 1 ms to minimize.
[2023-03-15 14:56:51] [INFO ] Deduced a trap composed of 440 places in 409 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:56:56] [INFO ] Deduced a trap composed of 454 places in 399 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 436 places in 409 ms of which 1 ms to minimize.
[2023-03-15 14:56:57] [INFO ] Deduced a trap composed of 438 places in 388 ms of which 1 ms to minimize.
[2023-03-15 14:56:58] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:56:59] [INFO ] Deduced a trap composed of 450 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:56:59] [INFO ] Deduced a trap composed of 446 places in 402 ms of which 1 ms to minimize.
[2023-03-15 14:57:09] [INFO ] Trap strengthening (SAT) tested/added 61/61 trap constraints in 42166 ms
[2023-03-15 14:57:09] [INFO ] After 42853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:57:09] [INFO ] After 43048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1090 transition count 2052
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 1090 transition count 2051
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1089 transition count 2051
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1089 transition count 2050
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1088 transition count 2050
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1088 transition count 2040
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1078 transition count 2040
Applied a total of 33 rules in 187 ms. Remains 1078 /1090 variables (removed 12) and now considering 2040/2061 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 14:57:09] [INFO ] Invariant cache hit.
[2023-03-15 14:57:09] [INFO ] [Real]Absence check using 135 positive place invariants in 34 ms returned sat
[2023-03-15 14:57:09] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:57:09] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:57:09] [INFO ] [Nat]Absence check using 135 positive place invariants in 29 ms returned sat
[2023-03-15 14:57:09] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-15 14:57:10] [INFO ] After 552ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:57:11] [INFO ] Deduced a trap composed of 420 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:57:11] [INFO ] Deduced a trap composed of 440 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:57:11] [INFO ] Deduced a trap composed of 438 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:57:12] [INFO ] Deduced a trap composed of 446 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:12] [INFO ] Deduced a trap composed of 438 places in 393 ms of which 1 ms to minimize.
[2023-03-15 14:57:13] [INFO ] Deduced a trap composed of 436 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:13] [INFO ] Deduced a trap composed of 440 places in 397 ms of which 0 ms to minimize.
[2023-03-15 14:57:14] [INFO ] Deduced a trap composed of 432 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:15] [INFO ] Deduced a trap composed of 430 places in 401 ms of which 0 ms to minimize.
[2023-03-15 14:57:15] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:16] [INFO ] Deduced a trap composed of 432 places in 405 ms of which 0 ms to minimize.
[2023-03-15 14:57:16] [INFO ] Deduced a trap composed of 440 places in 403 ms of which 1 ms to minimize.
[2023-03-15 14:57:17] [INFO ] Deduced a trap composed of 436 places in 401 ms of which 1 ms to minimize.
[2023-03-15 14:57:17] [INFO ] Deduced a trap composed of 434 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:18] [INFO ] Deduced a trap composed of 444 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:57:18] [INFO ] Deduced a trap composed of 436 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:18] [INFO ] Deduced a trap composed of 426 places in 402 ms of which 1 ms to minimize.
[2023-03-15 14:57:19] [INFO ] Deduced a trap composed of 434 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:19] [INFO ] Deduced a trap composed of 428 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:20] [INFO ] Deduced a trap composed of 442 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:57:20] [INFO ] Deduced a trap composed of 436 places in 401 ms of which 2 ms to minimize.
[2023-03-15 14:57:21] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:21] [INFO ] Deduced a trap composed of 440 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:22] [INFO ] Deduced a trap composed of 438 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:22] [INFO ] Deduced a trap composed of 424 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:23] [INFO ] Deduced a trap composed of 434 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:23] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:57:24] [INFO ] Deduced a trap composed of 436 places in 393 ms of which 1 ms to minimize.
[2023-03-15 14:57:24] [INFO ] Deduced a trap composed of 448 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:25] [INFO ] Deduced a trap composed of 432 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:25] [INFO ] Deduced a trap composed of 424 places in 406 ms of which 0 ms to minimize.
[2023-03-15 14:57:26] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:26] [INFO ] Deduced a trap composed of 440 places in 399 ms of which 1 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 1 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 448 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:57:28] [INFO ] Deduced a trap composed of 434 places in 393 ms of which 1 ms to minimize.
[2023-03-15 14:57:28] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:29] [INFO ] Deduced a trap composed of 436 places in 396 ms of which 0 ms to minimize.
[2023-03-15 14:57:29] [INFO ] Deduced a trap composed of 430 places in 383 ms of which 1 ms to minimize.
[2023-03-15 14:57:30] [INFO ] Deduced a trap composed of 450 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:57:30] [INFO ] Deduced a trap composed of 428 places in 385 ms of which 0 ms to minimize.
[2023-03-15 14:57:31] [INFO ] Deduced a trap composed of 434 places in 392 ms of which 0 ms to minimize.
[2023-03-15 14:57:31] [INFO ] Deduced a trap composed of 422 places in 410 ms of which 1 ms to minimize.
[2023-03-15 14:57:32] [INFO ] Deduced a trap composed of 444 places in 412 ms of which 1 ms to minimize.
[2023-03-15 14:57:32] [INFO ] Deduced a trap composed of 420 places in 413 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 440 places in 405 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 430 places in 424 ms of which 1 ms to minimize.
[2023-03-15 14:57:34] [INFO ] Deduced a trap composed of 436 places in 397 ms of which 0 ms to minimize.
[2023-03-15 14:57:35] [INFO ] Deduced a trap composed of 454 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:35] [INFO ] Deduced a trap composed of 440 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:36] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:36] [INFO ] Deduced a trap composed of 442 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 446 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 446 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 446 places in 410 ms of which 1 ms to minimize.
[2023-03-15 14:57:38] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:38] [INFO ] Deduced a trap composed of 428 places in 407 ms of which 1 ms to minimize.
[2023-03-15 14:57:39] [INFO ] Deduced a trap composed of 426 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:39] [INFO ] Deduced a trap composed of 430 places in 388 ms of which 1 ms to minimize.
[2023-03-15 14:57:40] [INFO ] Deduced a trap composed of 426 places in 402 ms of which 1 ms to minimize.
[2023-03-15 14:57:40] [INFO ] Deduced a trap composed of 440 places in 396 ms of which 1 ms to minimize.
[2023-03-15 14:57:41] [INFO ] Deduced a trap composed of 438 places in 386 ms of which 1 ms to minimize.
[2023-03-15 14:57:41] [INFO ] Deduced a trap composed of 446 places in 395 ms of which 2 ms to minimize.
[2023-03-15 14:57:42] [INFO ] Deduced a trap composed of 448 places in 391 ms of which 0 ms to minimize.
[2023-03-15 14:57:43] [INFO ] Deduced a trap composed of 444 places in 396 ms of which 0 ms to minimize.
[2023-03-15 14:57:43] [INFO ] Deduced a trap composed of 448 places in 388 ms of which 1 ms to minimize.
[2023-03-15 14:57:43] [INFO ] Deduced a trap composed of 448 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:44] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:44] [INFO ] Deduced a trap composed of 442 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:57:45] [INFO ] Deduced a trap composed of 444 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:57:45] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:46] [INFO ] Deduced a trap composed of 450 places in 399 ms of which 1 ms to minimize.
[2023-03-15 14:57:46] [INFO ] Deduced a trap composed of 444 places in 411 ms of which 1 ms to minimize.
[2023-03-15 14:57:47] [INFO ] Deduced a trap composed of 438 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:47] [INFO ] Deduced a trap composed of 442 places in 385 ms of which 1 ms to minimize.
[2023-03-15 14:57:48] [INFO ] Deduced a trap composed of 430 places in 397 ms of which 0 ms to minimize.
[2023-03-15 14:57:48] [INFO ] Deduced a trap composed of 444 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 444 places in 402 ms of which 0 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 454 places in 399 ms of which 0 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 440 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:57:50] [INFO ] Deduced a trap composed of 442 places in 393 ms of which 0 ms to minimize.
[2023-03-15 14:57:50] [INFO ] Deduced a trap composed of 446 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:51] [INFO ] Deduced a trap composed of 436 places in 394 ms of which 1 ms to minimize.
[2023-03-15 14:57:51] [INFO ] Deduced a trap composed of 444 places in 400 ms of which 1 ms to minimize.
[2023-03-15 14:57:52] [INFO ] Deduced a trap composed of 432 places in 403 ms of which 1 ms to minimize.
[2023-03-15 14:57:52] [INFO ] Deduced a trap composed of 446 places in 393 ms of which 1 ms to minimize.
[2023-03-15 14:57:53] [INFO ] Deduced a trap composed of 434 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:53] [INFO ] Deduced a trap composed of 442 places in 385 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 434 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 440 places in 395 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 444 places in 382 ms of which 0 ms to minimize.
[2023-03-15 14:57:55] [INFO ] Deduced a trap composed of 444 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:55] [INFO ] Deduced a trap composed of 440 places in 390 ms of which 1 ms to minimize.
[2023-03-15 14:57:56] [INFO ] Deduced a trap composed of 444 places in 425 ms of which 1 ms to minimize.
[2023-03-15 14:57:56] [INFO ] Deduced a trap composed of 438 places in 397 ms of which 1 ms to minimize.
[2023-03-15 14:57:57] [INFO ] Deduced a trap composed of 440 places in 393 ms of which 1 ms to minimize.
[2023-03-15 14:57:57] [INFO ] Deduced a trap composed of 428 places in 383 ms of which 1 ms to minimize.
[2023-03-15 14:57:58] [INFO ] Deduced a trap composed of 452 places in 388 ms of which 1 ms to minimize.
[2023-03-15 14:57:58] [INFO ] Deduced a trap composed of 446 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:57:59] [INFO ] Deduced a trap composed of 440 places in 388 ms of which 1 ms to minimize.
[2023-03-15 14:57:59] [INFO ] Deduced a trap composed of 440 places in 384 ms of which 1 ms to minimize.
[2023-03-15 14:57:59] [INFO ] Deduced a trap composed of 438 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:58:00] [INFO ] Deduced a trap composed of 440 places in 394 ms of which 0 ms to minimize.
[2023-03-15 14:58:00] [INFO ] Deduced a trap composed of 448 places in 386 ms of which 0 ms to minimize.
[2023-03-15 14:58:01] [INFO ] Deduced a trap composed of 436 places in 398 ms of which 1 ms to minimize.
[2023-03-15 14:58:01] [INFO ] Deduced a trap composed of 444 places in 384 ms of which 1 ms to minimize.
[2023-03-15 14:58:02] [INFO ] Deduced a trap composed of 430 places in 391 ms of which 1 ms to minimize.
[2023-03-15 14:58:02] [INFO ] Deduced a trap composed of 440 places in 384 ms of which 1 ms to minimize.
[2023-03-15 14:58:03] [INFO ] Deduced a trap composed of 436 places in 391 ms of which 0 ms to minimize.
[2023-03-15 14:58:03] [INFO ] Deduced a trap composed of 436 places in 393 ms of which 0 ms to minimize.
[2023-03-15 14:58:04] [INFO ] Deduced a trap composed of 442 places in 392 ms of which 1 ms to minimize.
[2023-03-15 14:58:04] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 1 ms to minimize.
[2023-03-15 14:58:05] [INFO ] Deduced a trap composed of 438 places in 387 ms of which 1 ms to minimize.
[2023-03-15 15:00:54] [INFO ] Trap strengthening (SAT) tested/added 113/113 trap constraints in 224263 ms
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:273)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 15:00:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:00:54] [INFO ] After 225021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Unable to solve all queries for examination QuasiLiveness. Remains :1 assertions to prove.
No /home/mcc/execution/QuasiLiveness.xml examination file found. Proceeding without properties.
Parsed 38 properties from file /home/mcc/execution/QuasiLiveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 685528 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J60
Examination QuasiLiveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/QuasiLive.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 48 places, 38 transitions, 140 arcs.
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P12)>=1)))
(potential((tk(P3)>=1) & (tk(P6)>=1) & (tk(P7)>=1)))
(potential((tk(P3)>=1) & (tk(P10)>=1) & (tk(P8)>=1)))
(potential((tk(P3)>=1) & (tk(P11)>=1) & (tk(P9)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P13)>=1)))
(potential((tk(P1)>=1) & (tk(P5)>=1) & (tk(P14)>=1)))
(potential((tk(P16)>=1) & (tk(P46)>=1)))
(potential((tk(P4)>=1)))
(potential((tk(P17)>=1)))
(potential((tk(P23)>=1)))
(potential((tk(P18)>=1)))
(potential((tk(P19)>=1)))
(potential((tk(P20)>=1)))
(potential((tk(P21)>=1)))
(potential((tk(P22)>=1)))
(potential((tk(P36)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P26)>=1) & (tk(P25)>=1) & (tk(P24)>=1)))
(potential((tk(P33)>=1) & (tk(P28)>=1)))
(potential((tk(P15)>=1) & (tk(P29)>=1)))
(potential((tk(P15)>=1) & (tk(P30)>=1)))
(potential((tk(P15)>=1) & (tk(P31)>=1)))
(potential((tk(P15)>=1) & (tk(P32)>=1)))
(potential((tk(P26)>=1) & (tk(P34)>=1) & (tk(P35)>=1) & (tk(P37)>=1)))
(potential((tk(P37)>=1) & (tk(P38)>=1) & (tk(P25)>=1)))
(potential((tk(P2)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P39)>=1) & (tk(P45)>=1)))
(potential((tk(P39)>=1) & (tk(P46)>=1)))
(potential((tk(P40)>=1)))
(potential((tk(P27)>=1) & (tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P41)>=1)))
FORMULA QuasiLiveness FALSE TECHNIQUES IMPLICIT_RELATION DECISION_DIAGRAMS SATURATION

BK_STOP 1678892456303

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -rebuildPNML
WARNING:
No initial marking given, assuming zero
within model automodel built in file model.sm near line 245

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="PolyORBNT-COL-S10J60"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5348"
echo " Executing tool smartxred"
echo " Input is PolyORBNT-COL-S10J60, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r313-tall-167873966100437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;