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-167873966100442.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-S10J80, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r313-tall-167873966100442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 01:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 00:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 00:55 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 25K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K 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 13K Feb 26 03:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 03:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 02:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 95K 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 1678891815017

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-S10J80
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-15 14:50:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2023-03-15 14:50:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 14:50:16] [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:50:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 14:50:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 722 ms
[2023-03-15 14:50:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 20 ms.
[2023-03-15 14:50:17] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 197 ms.
[2023-03-15 14:50:17] [INFO ] Unfolded 38 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
[2023-03-15 14:50:17] [INFO ] Reduced 9285 identical enabling conditions.
[2023-03-15 14:50:17] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 14:50:17] [INFO ] Reduced 45 identical enabling conditions.
Deduced a syphon composed of 80 places in 28 ms
Reduce places removed 80 places and 80 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 1234 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 45 ms. (steps per millisecond=22 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) 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 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 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 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 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 19 ms. (steps per millisecond=52 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=8 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 27) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 66 ms. (steps per millisecond=15 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Running SMT prover for 25 properties.
[2023-03-15 14:50:19] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2023-03-15 14:50:19] [INFO ] Computed 192 place invariants in 221 ms
[2023-03-15 14:50:23] [INFO ] [Real]Absence check using 185 positive place invariants in 90 ms returned sat
[2023-03-15 14:50:23] [INFO ] [Real]Absence check using 185 positive and 7 generalized place invariants in 45 ms returned sat
[2023-03-15 14:50:26] [INFO ] After 2383ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:23
[2023-03-15 14:50:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:50:27] [INFO ] After 391ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-15 14:50:27] [INFO ] After 778ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:23
Attempting to minimize the solution found.
Minimization took 225 ms.
[2023-03-15 14:50:27] [INFO ] After 5701ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:23
[2023-03-15 14:50:28] [INFO ] [Nat]Absence check using 185 positive place invariants in 70 ms returned sat
[2023-03-15 14:50:28] [INFO ] [Nat]Absence check using 185 positive and 7 generalized place invariants in 46 ms returned sat
[2023-03-15 14:50:52] [INFO ] After 23225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
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.verifyPossible(DeadlockTester.java:642)
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:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:50:53] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:23
Fused 25 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 531 ms.
Support contains 1413 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 1604 transition count 3388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 1602 transition count 3388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 1602 transition count 3387
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 1601 transition count 3387
Applied a total of 16 rules in 236 ms. Remains 1601 /1614 variables (removed 13) and now considering 3387/3390 (removed 3) transitions.
[2023-03-15 14:50:53] [INFO ] Flow matrix only has 3378 transitions (discarded 9 similar events)
// Phase 1: matrix 3378 rows 1601 cols
[2023-03-15 14:50:53] [INFO ] Computed 182 place invariants in 148 ms
[2023-03-15 14:50:56] [INFO ] Dead Transitions using invariants and state equation in 2631 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 : 1601/1614 places, 2772/3390 transitions.
Applied a total of 0 rules in 68 ms. Remains 1601 /1601 variables (removed 0) and now considering 2772/2772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2945 ms. Remains : 1601/1614 places, 2772/3390 transitions.
Incomplete random walk after 1000000 steps, including 66617 resets, run finished after 9357 ms. (steps per millisecond=106 ) properties (out of 25) seen :24
Incomplete Best-First random walk after 1000001 steps, including 8996 resets, run finished after 2288 ms. (steps per millisecond=437 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:51:08] [INFO ] Flow matrix only has 2763 transitions (discarded 9 similar events)
// Phase 1: matrix 2763 rows 1601 cols
[2023-03-15 14:51:08] [INFO ] Computed 182 place invariants in 64 ms
[2023-03-15 14:51:08] [INFO ] [Real]Absence check using 176 positive place invariants in 56 ms returned sat
[2023-03-15 14:51:08] [INFO ] [Real]Absence check using 176 positive and 6 generalized place invariants in 34 ms returned sat
[2023-03-15 14:51:08] [INFO ] After 317ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:51:08] [INFO ] [Nat]Absence check using 176 positive place invariants in 62 ms returned sat
[2023-03-15 14:51:08] [INFO ] [Nat]Absence check using 176 positive and 6 generalized place invariants in 33 ms returned sat
[2023-03-15 14:51:09] [INFO ] After 999ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:51:09] [INFO ] After 123ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:51:10] [INFO ] Deduced a trap composed of 750 places in 921 ms of which 7 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 756 places in 897 ms of which 2 ms to minimize.
[2023-03-15 14:51:12] [INFO ] Deduced a trap composed of 748 places in 810 ms of which 1 ms to minimize.
[2023-03-15 14:51:13] [INFO ] Deduced a trap composed of 750 places in 781 ms of which 2 ms to minimize.
[2023-03-15 14:51:14] [INFO ] Deduced a trap composed of 758 places in 769 ms of which 1 ms to minimize.
[2023-03-15 14:51:15] [INFO ] Deduced a trap composed of 746 places in 778 ms of which 1 ms to minimize.
[2023-03-15 14:51:16] [INFO ] Deduced a trap composed of 746 places in 794 ms of which 2 ms to minimize.
[2023-03-15 14:51:17] [INFO ] Deduced a trap composed of 738 places in 764 ms of which 2 ms to minimize.
[2023-03-15 14:51:18] [INFO ] Deduced a trap composed of 742 places in 764 ms of which 1 ms to minimize.
[2023-03-15 14:51:19] [INFO ] Deduced a trap composed of 738 places in 800 ms of which 1 ms to minimize.
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 752 places in 757 ms of which 2 ms to minimize.
[2023-03-15 14:51:20] [INFO ] Deduced a trap composed of 744 places in 781 ms of which 1 ms to minimize.
[2023-03-15 14:51:21] [INFO ] Deduced a trap composed of 748 places in 793 ms of which 1 ms to minimize.
[2023-03-15 14:51:22] [INFO ] Deduced a trap composed of 750 places in 758 ms of which 1 ms to minimize.
[2023-03-15 14:51:23] [INFO ] Deduced a trap composed of 728 places in 801 ms of which 1 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 744 places in 802 ms of which 4 ms to minimize.
[2023-03-15 14:51:25] [INFO ] Deduced a trap composed of 746 places in 758 ms of which 2 ms to minimize.
[2023-03-15 14:51:26] [INFO ] Deduced a trap composed of 734 places in 735 ms of which 1 ms to minimize.
[2023-03-15 14:51:27] [INFO ] Deduced a trap composed of 748 places in 742 ms of which 2 ms to minimize.
[2023-03-15 14:51:28] [INFO ] Deduced a trap composed of 760 places in 819 ms of which 2 ms to minimize.
[2023-03-15 14:51:37] [INFO ] Trap strengthening (SAT) tested/added 20/20 trap constraints in 27611 ms
[2023-03-15 14:51:37] [INFO ] After 27792ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:51:37] [INFO ] After 29111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2772/2772 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1601 transition count 2688
Reduce places removed 84 places and 0 transitions.
Iterating post reduction 1 with 84 rules applied. Total rules applied 168 place count 1517 transition count 2688
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 168 place count 1517 transition count 2604
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 336 place count 1433 transition count 2604
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 337 place count 1432 transition count 2603
Iterating global reduction 2 with 1 rules applied. Total rules applied 338 place count 1432 transition count 2603
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 342 place count 1430 transition count 2601
Applied a total of 342 rules in 637 ms. Remains 1430 /1601 variables (removed 171) and now considering 2601/2772 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 637 ms. Remains : 1430/1601 places, 2601/2772 transitions.
Incomplete random walk after 1000000 steps, including 72658 resets, run finished after 11384 ms. (steps per millisecond=87 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6542 resets, run finished after 2270 ms. (steps per millisecond=440 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3234263 steps, run timeout after 39001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 3234263 steps, saw 537385 distinct states, run finished after 39002 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:52:30] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
// Phase 1: matrix 2592 rows 1430 cols
[2023-03-15 14:52:31] [INFO ] Computed 182 place invariants in 64 ms
[2023-03-15 14:52:31] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 14:52:31] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-15 14:52:31] [INFO ] After 268ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:52:31] [INFO ] [Nat]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 14:52:31] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 14:52:36] [INFO ] After 4899ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:52:36] [INFO ] After 78ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:52:37] [INFO ] Deduced a trap composed of 574 places in 640 ms of which 2 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 566 places in 643 ms of which 1 ms to minimize.
[2023-03-15 14:52:38] [INFO ] Deduced a trap composed of 568 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:52:39] [INFO ] Deduced a trap composed of 578 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:52:40] [INFO ] Deduced a trap composed of 570 places in 660 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 572 places in 615 ms of which 1 ms to minimize.
[2023-03-15 14:52:41] [INFO ] Deduced a trap composed of 574 places in 634 ms of which 1 ms to minimize.
[2023-03-15 14:52:42] [INFO ] Deduced a trap composed of 580 places in 631 ms of which 1 ms to minimize.
[2023-03-15 14:52:43] [INFO ] Deduced a trap composed of 582 places in 683 ms of which 1 ms to minimize.
[2023-03-15 14:52:44] [INFO ] Deduced a trap composed of 588 places in 638 ms of which 2 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 568 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:52:45] [INFO ] Deduced a trap composed of 558 places in 600 ms of which 1 ms to minimize.
[2023-03-15 14:52:46] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 2 ms to minimize.
[2023-03-15 14:52:47] [INFO ] Deduced a trap composed of 582 places in 620 ms of which 3 ms to minimize.
[2023-03-15 14:52:48] [INFO ] Deduced a trap composed of 562 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:52:49] [INFO ] Deduced a trap composed of 560 places in 628 ms of which 1 ms to minimize.
[2023-03-15 14:52:50] [INFO ] Deduced a trap composed of 570 places in 604 ms of which 1 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 570 places in 634 ms of which 1 ms to minimize.
[2023-03-15 14:52:51] [INFO ] Deduced a trap composed of 572 places in 623 ms of which 2 ms to minimize.
[2023-03-15 14:52:52] [INFO ] Deduced a trap composed of 582 places in 657 ms of which 1 ms to minimize.
[2023-03-15 14:52:53] [INFO ] Deduced a trap composed of 572 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 586 places in 634 ms of which 1 ms to minimize.
[2023-03-15 14:52:54] [INFO ] Deduced a trap composed of 570 places in 626 ms of which 1 ms to minimize.
[2023-03-15 14:52:55] [INFO ] Deduced a trap composed of 576 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:52:56] [INFO ] Deduced a trap composed of 584 places in 630 ms of which 2 ms to minimize.
[2023-03-15 14:52:57] [INFO ] Deduced a trap composed of 580 places in 651 ms of which 1 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 572 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:52:58] [INFO ] Deduced a trap composed of 574 places in 653 ms of which 1 ms to minimize.
[2023-03-15 14:53:00] [INFO ] Deduced a trap composed of 572 places in 603 ms of which 1 ms to minimize.
[2023-03-15 14:53:03] [INFO ] Deduced a trap composed of 580 places in 619 ms of which 2 ms to minimize.
[2023-03-15 14:53:04] [INFO ] Deduced a trap composed of 574 places in 610 ms of which 1 ms to minimize.
[2023-03-15 14:53:05] [INFO ] Deduced a trap composed of 578 places in 611 ms of which 2 ms to minimize.
[2023-03-15 14:53:05] [INFO ] Deduced a trap composed of 562 places in 643 ms of which 1 ms to minimize.
[2023-03-15 14:53:06] [INFO ] Deduced a trap composed of 574 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:53:07] [INFO ] Deduced a trap composed of 568 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:53:08] [INFO ] Deduced a trap composed of 578 places in 622 ms of which 3 ms to minimize.
[2023-03-15 14:53:17] [INFO ] Trap strengthening (SAT) tested/added 36/36 trap constraints in 40590 ms
[2023-03-15 14:53:17] [INFO ] After 41006ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:53:17] [INFO ] After 46191ms 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 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 69 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 71 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 14:53:17] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:53:17] [INFO ] Invariant cache hit.
[2023-03-15 14:53:19] [INFO ] Implicit Places using invariants in 1487 ms returned []
[2023-03-15 14:53:19] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:53:19] [INFO ] Invariant cache hit.
[2023-03-15 14:53:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:53:25] [INFO ] Implicit Places using invariants and state equation in 6281 ms returned []
Implicit Place search using SMT with State Equation took 7776 ms to find 0 implicit places.
[2023-03-15 14:53:25] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-15 14:53:25] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:53:25] [INFO ] Invariant cache hit.
[2023-03-15 14:53:27] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9482 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7242 resets, run finished after 1244 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:53:28] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:53:28] [INFO ] Invariant cache hit.
[2023-03-15 14:53:28] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 14:53:28] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 14:53:29] [INFO ] After 946ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:53:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:53:29] [INFO ] After 73ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:53:29] [INFO ] After 208ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:53:29] [INFO ] After 1390ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:53:29] [INFO ] [Nat]Absence check using 175 positive place invariants in 42 ms returned sat
[2023-03-15 14:53:29] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-15 14:53:30] [INFO ] After 831ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:53:31] [INFO ] After 646ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 560 places in 657 ms of which 2 ms to minimize.
[2023-03-15 14:53:32] [INFO ] Deduced a trap composed of 566 places in 662 ms of which 1 ms to minimize.
[2023-03-15 14:53:33] [INFO ] Deduced a trap composed of 582 places in 658 ms of which 1 ms to minimize.
[2023-03-15 14:53:34] [INFO ] Deduced a trap composed of 564 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 566 places in 570 ms of which 1 ms to minimize.
[2023-03-15 14:53:35] [INFO ] Deduced a trap composed of 582 places in 586 ms of which 1 ms to minimize.
[2023-03-15 14:53:36] [INFO ] Deduced a trap composed of 580 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:53:37] [INFO ] Deduced a trap composed of 570 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:53:38] [INFO ] Deduced a trap composed of 580 places in 718 ms of which 1 ms to minimize.
[2023-03-15 14:53:39] [INFO ] Deduced a trap composed of 568 places in 658 ms of which 4 ms to minimize.
[2023-03-15 14:53:40] [INFO ] Deduced a trap composed of 558 places in 663 ms of which 3 ms to minimize.
[2023-03-15 14:53:41] [INFO ] Deduced a trap composed of 574 places in 625 ms of which 2 ms to minimize.
[2023-03-15 14:53:41] [INFO ] Deduced a trap composed of 566 places in 653 ms of which 1 ms to minimize.
[2023-03-15 14:53:42] [INFO ] Deduced a trap composed of 568 places in 671 ms of which 1 ms to minimize.
[2023-03-15 14:53:43] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 2 ms to minimize.
[2023-03-15 14:53:44] [INFO ] Deduced a trap composed of 570 places in 640 ms of which 1 ms to minimize.
[2023-03-15 14:53:44] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:53:45] [INFO ] Deduced a trap composed of 574 places in 651 ms of which 2 ms to minimize.
[2023-03-15 14:53:46] [INFO ] Deduced a trap composed of 568 places in 663 ms of which 2 ms to minimize.
[2023-03-15 14:53:47] [INFO ] Deduced a trap composed of 580 places in 615 ms of which 1 ms to minimize.
[2023-03-15 14:53:47] [INFO ] Deduced a trap composed of 570 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:53:48] [INFO ] Deduced a trap composed of 566 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:53:49] [INFO ] Deduced a trap composed of 578 places in 650 ms of which 1 ms to minimize.
[2023-03-15 14:53:50] [INFO ] Deduced a trap composed of 564 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:53:51] [INFO ] Deduced a trap composed of 570 places in 628 ms of which 2 ms to minimize.
[2023-03-15 14:53:51] [INFO ] Deduced a trap composed of 566 places in 606 ms of which 1 ms to minimize.
[2023-03-15 14:53:52] [INFO ] Deduced a trap composed of 578 places in 636 ms of which 1 ms to minimize.
[2023-03-15 14:53:54] [INFO ] Deduced a trap composed of 574 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:53:55] [INFO ] Deduced a trap composed of 570 places in 625 ms of which 1 ms to minimize.
[2023-03-15 14:53:56] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:53:56] [INFO ] Deduced a trap composed of 574 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:53:57] [INFO ] Deduced a trap composed of 570 places in 614 ms of which 1 ms to minimize.
[2023-03-15 14:53:58] [INFO ] Deduced a trap composed of 564 places in 636 ms of which 1 ms to minimize.
[2023-03-15 14:53:59] [INFO ] Deduced a trap composed of 568 places in 625 ms of which 1 ms to minimize.
[2023-03-15 14:53:59] [INFO ] Deduced a trap composed of 586 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:54:00] [INFO ] Deduced a trap composed of 572 places in 804 ms of which 1 ms to minimize.
[2023-03-15 14:54:01] [INFO ] Deduced a trap composed of 572 places in 656 ms of which 1 ms to minimize.
[2023-03-15 14:54:02] [INFO ] Deduced a trap composed of 564 places in 633 ms of which 2 ms to minimize.
[2023-03-15 14:54:03] [INFO ] Deduced a trap composed of 586 places in 656 ms of which 1 ms to minimize.
[2023-03-15 14:54:03] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 1 ms to minimize.
[2023-03-15 14:54:04] [INFO ] Deduced a trap composed of 574 places in 599 ms of which 1 ms to minimize.
[2023-03-15 14:54:05] [INFO ] Deduced a trap composed of 570 places in 628 ms of which 1 ms to minimize.
[2023-03-15 14:54:06] [INFO ] Deduced a trap composed of 570 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:54:06] [INFO ] Deduced a trap composed of 574 places in 628 ms of which 1 ms to minimize.
[2023-03-15 14:54:07] [INFO ] Deduced a trap composed of 570 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:54:09] [INFO ] Deduced a trap composed of 584 places in 688 ms of which 1 ms to minimize.
[2023-03-15 14:54:10] [INFO ] Deduced a trap composed of 572 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:54:12] [INFO ] Deduced a trap composed of 568 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:54:14] [INFO ] Deduced a trap composed of 566 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:54:17] [INFO ] Deduced a trap composed of 564 places in 620 ms of which 1 ms to minimize.
[2023-03-15 14:54:17] [INFO ] Deduced a trap composed of 562 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:54:18] [INFO ] Deduced a trap composed of 572 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:54:19] [INFO ] Deduced a trap composed of 558 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:54:20] [INFO ] Deduced a trap composed of 568 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:54:21] [INFO ] Deduced a trap composed of 574 places in 633 ms of which 1 ms to minimize.
[2023-03-15 14:54:25] [INFO ] Deduced a trap composed of 570 places in 648 ms of which 1 ms to minimize.
[2023-03-15 14:54:29] [INFO ] Deduced a trap composed of 576 places in 655 ms of which 1 ms to minimize.
[2023-03-15 14:54:30] [INFO ] Deduced a trap composed of 568 places in 636 ms of which 2 ms to minimize.
[2023-03-15 14:54:35] [INFO ] Deduced a trap composed of 568 places in 613 ms of which 1 ms to minimize.
[2023-03-15 14:54:44] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 73333 ms
[2023-03-15 14:54:45] [INFO ] After 74954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:54:45] [INFO ] After 76008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 1000000 steps, including 72672 resets, run finished after 11686 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6341 resets, run finished after 2230 ms. (steps per millisecond=448 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3266455 steps, run timeout after 39001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 3266455 steps, saw 542962 distinct states, run finished after 39001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:55:38] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:55:38] [INFO ] Invariant cache hit.
[2023-03-15 14:55:38] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 14:55:38] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 14:55:38] [INFO ] After 301ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:55:39] [INFO ] [Nat]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 14:55:39] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 40 ms returned sat
[2023-03-15 14:55:40] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:55:40] [INFO ] After 747ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:55:41] [INFO ] Deduced a trap composed of 560 places in 585 ms of which 1 ms to minimize.
[2023-03-15 14:55:42] [INFO ] Deduced a trap composed of 566 places in 641 ms of which 1 ms to minimize.
[2023-03-15 14:55:43] [INFO ] Deduced a trap composed of 582 places in 643 ms of which 1 ms to minimize.
[2023-03-15 14:55:44] [INFO ] Deduced a trap composed of 564 places in 696 ms of which 2 ms to minimize.
[2023-03-15 14:55:44] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 1 ms to minimize.
[2023-03-15 14:55:45] [INFO ] Deduced a trap composed of 582 places in 628 ms of which 1 ms to minimize.
[2023-03-15 14:55:46] [INFO ] Deduced a trap composed of 580 places in 659 ms of which 13 ms to minimize.
[2023-03-15 14:55:46] [INFO ] Deduced a trap composed of 570 places in 641 ms of which 2 ms to minimize.
[2023-03-15 14:55:48] [INFO ] Deduced a trap composed of 580 places in 689 ms of which 1 ms to minimize.
[2023-03-15 14:55:48] [INFO ] Deduced a trap composed of 568 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:55:49] [INFO ] Deduced a trap composed of 558 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:55:50] [INFO ] Deduced a trap composed of 574 places in 639 ms of which 1 ms to minimize.
[2023-03-15 14:55:51] [INFO ] Deduced a trap composed of 566 places in 653 ms of which 1 ms to minimize.
[2023-03-15 14:55:52] [INFO ] Deduced a trap composed of 568 places in 631 ms of which 1 ms to minimize.
[2023-03-15 14:55:52] [INFO ] Deduced a trap composed of 570 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:55:53] [INFO ] Deduced a trap composed of 570 places in 621 ms of which 2 ms to minimize.
[2023-03-15 14:55:54] [INFO ] Deduced a trap composed of 568 places in 656 ms of which 1 ms to minimize.
[2023-03-15 14:55:55] [INFO ] Deduced a trap composed of 574 places in 652 ms of which 1 ms to minimize.
[2023-03-15 14:55:55] [INFO ] Deduced a trap composed of 568 places in 661 ms of which 1 ms to minimize.
[2023-03-15 14:55:56] [INFO ] Deduced a trap composed of 580 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:55:57] [INFO ] Deduced a trap composed of 570 places in 631 ms of which 2 ms to minimize.
[2023-03-15 14:55:58] [INFO ] Deduced a trap composed of 566 places in 611 ms of which 1 ms to minimize.
[2023-03-15 14:55:58] [INFO ] Deduced a trap composed of 578 places in 631 ms of which 1 ms to minimize.
[2023-03-15 14:55:59] [INFO ] Deduced a trap composed of 564 places in 617 ms of which 1 ms to minimize.
[2023-03-15 14:56:00] [INFO ] Deduced a trap composed of 570 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:56:01] [INFO ] Deduced a trap composed of 566 places in 621 ms of which 2 ms to minimize.
[2023-03-15 14:56:02] [INFO ] Deduced a trap composed of 578 places in 626 ms of which 14 ms to minimize.
[2023-03-15 14:56:03] [INFO ] Deduced a trap composed of 574 places in 664 ms of which 1 ms to minimize.
[2023-03-15 14:56:05] [INFO ] Deduced a trap composed of 570 places in 620 ms of which 1 ms to minimize.
[2023-03-15 14:56:05] [INFO ] Deduced a trap composed of 568 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:56:06] [INFO ] Deduced a trap composed of 574 places in 623 ms of which 1 ms to minimize.
[2023-03-15 14:56:07] [INFO ] Deduced a trap composed of 570 places in 620 ms of which 2 ms to minimize.
[2023-03-15 14:56:08] [INFO ] Deduced a trap composed of 564 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:56:08] [INFO ] Deduced a trap composed of 568 places in 614 ms of which 1 ms to minimize.
[2023-03-15 14:56:09] [INFO ] Deduced a trap composed of 586 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:56:10] [INFO ] Deduced a trap composed of 572 places in 658 ms of which 1 ms to minimize.
[2023-03-15 14:56:11] [INFO ] Deduced a trap composed of 572 places in 638 ms of which 1 ms to minimize.
[2023-03-15 14:56:11] [INFO ] Deduced a trap composed of 564 places in 643 ms of which 2 ms to minimize.
[2023-03-15 14:56:12] [INFO ] Deduced a trap composed of 586 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:56:13] [INFO ] Deduced a trap composed of 572 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:56:14] [INFO ] Deduced a trap composed of 574 places in 603 ms of which 1 ms to minimize.
[2023-03-15 14:56:14] [INFO ] Deduced a trap composed of 570 places in 635 ms of which 2 ms to minimize.
[2023-03-15 14:56:15] [INFO ] Deduced a trap composed of 570 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 574 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:56:16] [INFO ] Deduced a trap composed of 570 places in 651 ms of which 1 ms to minimize.
[2023-03-15 14:56:18] [INFO ] Deduced a trap composed of 584 places in 614 ms of which 1 ms to minimize.
[2023-03-15 14:56:19] [INFO ] Deduced a trap composed of 572 places in 645 ms of which 1 ms to minimize.
[2023-03-15 14:56:21] [INFO ] Deduced a trap composed of 568 places in 639 ms of which 1 ms to minimize.
[2023-03-15 14:56:23] [INFO ] Deduced a trap composed of 566 places in 628 ms of which 1 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 564 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:56:26] [INFO ] Deduced a trap composed of 562 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:56:27] [INFO ] Deduced a trap composed of 572 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:56:28] [INFO ] Deduced a trap composed of 558 places in 615 ms of which 1 ms to minimize.
[2023-03-15 14:56:29] [INFO ] Deduced a trap composed of 568 places in 626 ms of which 1 ms to minimize.
[2023-03-15 14:56:30] [INFO ] Deduced a trap composed of 574 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:56:33] [INFO ] Deduced a trap composed of 570 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:56:38] [INFO ] Deduced a trap composed of 576 places in 631 ms of which 1 ms to minimize.
[2023-03-15 14:56:39] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2023-03-15 14:56:44] [INFO ] Deduced a trap composed of 568 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:56:53] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 72306 ms
[2023-03-15 14:56:54] [INFO ] After 74018ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:56:54] [INFO ] After 75258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 67 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 89 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 14:56:54] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:56:54] [INFO ] Invariant cache hit.
[2023-03-15 14:56:55] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2023-03-15 14:56:55] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:56:55] [INFO ] Invariant cache hit.
[2023-03-15 14:56:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:57:03] [INFO ] Implicit Places using invariants and state equation in 7658 ms returned []
Implicit Place search using SMT with State Equation took 9114 ms to find 0 implicit places.
[2023-03-15 14:57:03] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-15 14:57:03] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:57:03] [INFO ] Invariant cache hit.
[2023-03-15 14:57:05] [INFO ] Dead Transitions using invariants and state equation in 1438 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10791 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 100000 steps, including 7244 resets, run finished after 1171 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:57:06] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:57:06] [INFO ] Invariant cache hit.
[2023-03-15 14:57:06] [INFO ] [Real]Absence check using 175 positive place invariants in 45 ms returned sat
[2023-03-15 14:57:06] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 14:57:07] [INFO ] After 891ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 14:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:57:07] [INFO ] After 79ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-15 14:57:07] [INFO ] After 206ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:57:07] [INFO ] After 1340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:57:07] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 14:57:07] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-15 14:57:08] [INFO ] After 834ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:57:09] [INFO ] After 682ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:57:10] [INFO ] Deduced a trap composed of 560 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:57:10] [INFO ] Deduced a trap composed of 566 places in 625 ms of which 1 ms to minimize.
[2023-03-15 14:57:11] [INFO ] Deduced a trap composed of 582 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:57:12] [INFO ] Deduced a trap composed of 564 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:57:13] [INFO ] Deduced a trap composed of 566 places in 631 ms of which 1 ms to minimize.
[2023-03-15 14:57:13] [INFO ] Deduced a trap composed of 582 places in 620 ms of which 2 ms to minimize.
[2023-03-15 14:57:14] [INFO ] Deduced a trap composed of 580 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:57:15] [INFO ] Deduced a trap composed of 570 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:57:16] [INFO ] Deduced a trap composed of 580 places in 642 ms of which 1 ms to minimize.
[2023-03-15 14:57:17] [INFO ] Deduced a trap composed of 568 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:57:18] [INFO ] Deduced a trap composed of 558 places in 605 ms of which 1 ms to minimize.
[2023-03-15 14:57:18] [INFO ] Deduced a trap composed of 574 places in 648 ms of which 1 ms to minimize.
[2023-03-15 14:57:19] [INFO ] Deduced a trap composed of 566 places in 633 ms of which 1 ms to minimize.
[2023-03-15 14:57:20] [INFO ] Deduced a trap composed of 568 places in 661 ms of which 1 ms to minimize.
[2023-03-15 14:57:21] [INFO ] Deduced a trap composed of 570 places in 617 ms of which 1 ms to minimize.
[2023-03-15 14:57:21] [INFO ] Deduced a trap composed of 570 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:57:22] [INFO ] Deduced a trap composed of 568 places in 652 ms of which 1 ms to minimize.
[2023-03-15 14:57:23] [INFO ] Deduced a trap composed of 574 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:57:24] [INFO ] Deduced a trap composed of 568 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:57:24] [INFO ] Deduced a trap composed of 580 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:57:25] [INFO ] Deduced a trap composed of 570 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:57:26] [INFO ] Deduced a trap composed of 566 places in 615 ms of which 1 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 578 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:57:27] [INFO ] Deduced a trap composed of 564 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:57:28] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:57:29] [INFO ] Deduced a trap composed of 566 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:57:30] [INFO ] Deduced a trap composed of 578 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:57:31] [INFO ] Deduced a trap composed of 574 places in 613 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 570 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:57:33] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2023-03-15 14:57:34] [INFO ] Deduced a trap composed of 574 places in 634 ms of which 1 ms to minimize.
[2023-03-15 14:57:35] [INFO ] Deduced a trap composed of 570 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:57:36] [INFO ] Deduced a trap composed of 564 places in 630 ms of which 1 ms to minimize.
[2023-03-15 14:57:36] [INFO ] Deduced a trap composed of 568 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:57:37] [INFO ] Deduced a trap composed of 586 places in 636 ms of which 1 ms to minimize.
[2023-03-15 14:57:38] [INFO ] Deduced a trap composed of 572 places in 668 ms of which 1 ms to minimize.
[2023-03-15 14:57:39] [INFO ] Deduced a trap composed of 572 places in 614 ms of which 1 ms to minimize.
[2023-03-15 14:57:39] [INFO ] Deduced a trap composed of 564 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:57:40] [INFO ] Deduced a trap composed of 586 places in 618 ms of which 14 ms to minimize.
[2023-03-15 14:57:41] [INFO ] Deduced a trap composed of 572 places in 626 ms of which 1 ms to minimize.
[2023-03-15 14:57:42] [INFO ] Deduced a trap composed of 574 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:57:42] [INFO ] Deduced a trap composed of 570 places in 640 ms of which 1 ms to minimize.
[2023-03-15 14:57:43] [INFO ] Deduced a trap composed of 570 places in 615 ms of which 2 ms to minimize.
[2023-03-15 14:57:44] [INFO ] Deduced a trap composed of 574 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:57:45] [INFO ] Deduced a trap composed of 570 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:57:46] [INFO ] Deduced a trap composed of 584 places in 632 ms of which 1 ms to minimize.
[2023-03-15 14:57:47] [INFO ] Deduced a trap composed of 572 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:57:49] [INFO ] Deduced a trap composed of 568 places in 647 ms of which 2 ms to minimize.
[2023-03-15 14:57:51] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 4 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 564 places in 609 ms of which 1 ms to minimize.
[2023-03-15 14:57:54] [INFO ] Deduced a trap composed of 562 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:57:55] [INFO ] Deduced a trap composed of 572 places in 599 ms of which 1 ms to minimize.
[2023-03-15 14:57:56] [INFO ] Deduced a trap composed of 558 places in 610 ms of which 1 ms to minimize.
[2023-03-15 14:57:57] [INFO ] Deduced a trap composed of 568 places in 639 ms of which 1 ms to minimize.
[2023-03-15 14:57:58] [INFO ] Deduced a trap composed of 574 places in 608 ms of which 1 ms to minimize.
[2023-03-15 14:58:01] [INFO ] Deduced a trap composed of 570 places in 621 ms of which 1 ms to minimize.
[2023-03-15 14:58:06] [INFO ] Deduced a trap composed of 576 places in 637 ms of which 2 ms to minimize.
[2023-03-15 14:58:07] [INFO ] Deduced a trap composed of 568 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:58:12] [INFO ] Deduced a trap composed of 568 places in 658 ms of which 1 ms to minimize.
[2023-03-15 14:58:21] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 72092 ms
[2023-03-15 14:58:22] [INFO ] After 73929ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 14:58:22] [INFO ] After 75002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 715 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 287590 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 287590 steps, saw 47290 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:58:25] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:58:25] [INFO ] Invariant cache hit.
[2023-03-15 14:58:26] [INFO ] [Real]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-15 14:58:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 14:58:26] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:58:26] [INFO ] [Nat]Absence check using 175 positive place invariants in 46 ms returned sat
[2023-03-15 14:58:26] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 37 ms returned sat
[2023-03-15 14:58:27] [INFO ] After 858ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:58:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:58:27] [INFO ] After 446ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:58:28] [INFO ] Deduced a trap composed of 578 places in 614 ms of which 2 ms to minimize.
[2023-03-15 14:58:29] [INFO ] Deduced a trap composed of 568 places in 627 ms of which 1 ms to minimize.
[2023-03-15 14:58:29] [INFO ] Deduced a trap composed of 576 places in 641 ms of which 1 ms to minimize.
[2023-03-15 14:58:30] [INFO ] Deduced a trap composed of 584 places in 649 ms of which 1 ms to minimize.
[2023-03-15 14:58:31] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 2 ms to minimize.
[2023-03-15 14:58:32] [INFO ] Deduced a trap composed of 570 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:58:32] [INFO ] Deduced a trap composed of 582 places in 695 ms of which 1 ms to minimize.
[2023-03-15 14:58:33] [INFO ] Deduced a trap composed of 576 places in 661 ms of which 1 ms to minimize.
[2023-03-15 14:58:34] [INFO ] Deduced a trap composed of 586 places in 656 ms of which 1 ms to minimize.
[2023-03-15 14:58:35] [INFO ] Deduced a trap composed of 578 places in 655 ms of which 1 ms to minimize.
[2023-03-15 14:58:35] [INFO ] Deduced a trap composed of 578 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:58:36] [INFO ] Deduced a trap composed of 562 places in 640 ms of which 1 ms to minimize.
[2023-03-15 14:58:37] [INFO ] Deduced a trap composed of 578 places in 635 ms of which 1 ms to minimize.
[2023-03-15 14:58:38] [INFO ] Deduced a trap composed of 570 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:58:38] [INFO ] Deduced a trap composed of 568 places in 619 ms of which 2 ms to minimize.
[2023-03-15 14:58:39] [INFO ] Deduced a trap composed of 580 places in 601 ms of which 2 ms to minimize.
[2023-03-15 14:58:42] [INFO ] Deduced a trap composed of 578 places in 646 ms of which 1 ms to minimize.
[2023-03-15 14:58:43] [INFO ] Deduced a trap composed of 578 places in 618 ms of which 1 ms to minimize.
[2023-03-15 14:58:46] [INFO ] Deduced a trap composed of 574 places in 586 ms of which 1 ms to minimize.
[2023-03-15 14:58:47] [INFO ] Deduced a trap composed of 570 places in 662 ms of which 1 ms to minimize.
[2023-03-15 14:58:48] [INFO ] Deduced a trap composed of 574 places in 676 ms of which 1 ms to minimize.
[2023-03-15 14:58:49] [INFO ] Deduced a trap composed of 572 places in 613 ms of which 3 ms to minimize.
[2023-03-15 14:58:50] [INFO ] Deduced a trap composed of 572 places in 662 ms of which 1 ms to minimize.
[2023-03-15 14:58:51] [INFO ] Deduced a trap composed of 560 places in 611 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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:58:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:58:51] [INFO ] After 25181ms 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 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 77 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 14:58:51] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:58:51] [INFO ] Invariant cache hit.
[2023-03-15 14:58:52] [INFO ] Dead Transitions using invariants and state equation in 1415 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1495 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Incomplete random walk after 10000 steps, including 725 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 275612 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 275612 steps, saw 45421 distinct states, run finished after 3002 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 14:58:55] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:58:55] [INFO ] Invariant cache hit.
[2023-03-15 14:58:56] [INFO ] [Real]Absence check using 175 positive place invariants in 48 ms returned sat
[2023-03-15 14:58:56] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 14:58:56] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:58:56] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 14:58:56] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 38 ms returned sat
[2023-03-15 14:58:57] [INFO ] After 835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:58:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:58:57] [INFO ] After 432ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 14:58:58] [INFO ] Deduced a trap composed of 578 places in 609 ms of which 1 ms to minimize.
[2023-03-15 14:58:59] [INFO ] Deduced a trap composed of 568 places in 641 ms of which 1 ms to minimize.
[2023-03-15 14:58:59] [INFO ] Deduced a trap composed of 576 places in 645 ms of which 1 ms to minimize.
[2023-03-15 14:59:00] [INFO ] Deduced a trap composed of 584 places in 664 ms of which 1 ms to minimize.
[2023-03-15 14:59:01] [INFO ] Deduced a trap composed of 570 places in 629 ms of which 1 ms to minimize.
[2023-03-15 14:59:02] [INFO ] Deduced a trap composed of 570 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:59:02] [INFO ] Deduced a trap composed of 582 places in 692 ms of which 1 ms to minimize.
[2023-03-15 14:59:03] [INFO ] Deduced a trap composed of 576 places in 614 ms of which 1 ms to minimize.
[2023-03-15 14:59:04] [INFO ] Deduced a trap composed of 586 places in 617 ms of which 1 ms to minimize.
[2023-03-15 14:59:05] [INFO ] Deduced a trap composed of 578 places in 606 ms of which 1 ms to minimize.
[2023-03-15 14:59:05] [INFO ] Deduced a trap composed of 578 places in 651 ms of which 1 ms to minimize.
[2023-03-15 14:59:06] [INFO ] Deduced a trap composed of 562 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:59:07] [INFO ] Deduced a trap composed of 578 places in 624 ms of which 1 ms to minimize.
[2023-03-15 14:59:08] [INFO ] Deduced a trap composed of 570 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:59:08] [INFO ] Deduced a trap composed of 568 places in 601 ms of which 1 ms to minimize.
[2023-03-15 14:59:10] [INFO ] Deduced a trap composed of 580 places in 641 ms of which 1 ms to minimize.
[2023-03-15 14:59:12] [INFO ] Deduced a trap composed of 578 places in 616 ms of which 1 ms to minimize.
[2023-03-15 14:59:13] [INFO ] Deduced a trap composed of 578 places in 622 ms of which 1 ms to minimize.
[2023-03-15 14:59:17] [INFO ] Deduced a trap composed of 574 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:59:18] [INFO ] Deduced a trap composed of 570 places in 600 ms of which 1 ms to minimize.
[2023-03-15 14:59:18] [INFO ] Deduced a trap composed of 574 places in 638 ms of which 1 ms to minimize.
[2023-03-15 14:59:19] [INFO ] Deduced a trap composed of 572 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:59:21] [INFO ] Deduced a trap composed of 572 places in 607 ms of which 1 ms to minimize.
[2023-03-15 14:59:22] [INFO ] Deduced a trap composed of 9 places in 927 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
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:59:22] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 14:59:22] [INFO ] After 25957ms 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 1430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 63 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1430/1430 places, 2601/2601 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1430/1430 places, 2601/2601 transitions.
Applied a total of 0 rules in 61 ms. Remains 1430 /1430 variables (removed 0) and now considering 2601/2601 (removed 0) transitions.
[2023-03-15 14:59:22] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:59:22] [INFO ] Invariant cache hit.
[2023-03-15 14:59:23] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2023-03-15 14:59:23] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:59:23] [INFO ] Invariant cache hit.
[2023-03-15 14:59:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 14:59:33] [INFO ] Implicit Places using invariants and state equation in 10187 ms returned []
Implicit Place search using SMT with State Equation took 11608 ms to find 0 implicit places.
[2023-03-15 14:59:33] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-15 14:59:33] [INFO ] Flow matrix only has 2592 transitions (discarded 9 similar events)
[2023-03-15 14:59:33] [INFO ] Invariant cache hit.
[2023-03-15 14:59:35] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13153 ms. Remains : 1430/1430 places, 2601/2601 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 1430 transition count 2592
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 1430 transition count 2591
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 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 270 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2580 rows 1418 cols
[2023-03-15 14:59:35] [INFO ] Computed 182 place invariants in 59 ms
[2023-03-15 14:59:35] [INFO ] [Real]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 14:59:35] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 34 ms returned sat
[2023-03-15 14:59:35] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 14:59:36] [INFO ] [Nat]Absence check using 175 positive place invariants in 41 ms returned sat
[2023-03-15 14:59:36] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 36 ms returned sat
[2023-03-15 14:59:37] [INFO ] After 788ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 14:59:37] [INFO ] Deduced a trap composed of 566 places in 571 ms of which 1 ms to minimize.
[2023-03-15 14:59:38] [INFO ] Deduced a trap composed of 576 places in 595 ms of which 1 ms to minimize.
[2023-03-15 14:59:39] [INFO ] Deduced a trap composed of 566 places in 603 ms of which 1 ms to minimize.
[2023-03-15 14:59:39] [INFO ] Deduced a trap composed of 572 places in 605 ms of which 1 ms to minimize.
[2023-03-15 14:59:40] [INFO ] Deduced a trap composed of 566 places in 610 ms of which 1 ms to minimize.
[2023-03-15 14:59:41] [INFO ] Deduced a trap composed of 560 places in 588 ms of which 2 ms to minimize.
[2023-03-15 14:59:41] [INFO ] Deduced a trap composed of 572 places in 592 ms of which 1 ms to minimize.
[2023-03-15 14:59:42] [INFO ] Deduced a trap composed of 574 places in 639 ms of which 1 ms to minimize.
[2023-03-15 14:59:43] [INFO ] Deduced a trap composed of 564 places in 591 ms of which 2 ms to minimize.
[2023-03-15 14:59:44] [INFO ] Deduced a trap composed of 566 places in 626 ms of which 2 ms to minimize.
[2023-03-15 14:59:45] [INFO ] Deduced a trap composed of 566 places in 645 ms of which 2 ms to minimize.
[2023-03-15 14:59:45] [INFO ] Deduced a trap composed of 586 places in 669 ms of which 1 ms to minimize.
[2023-03-15 14:59:46] [INFO ] Deduced a trap composed of 572 places in 612 ms of which 1 ms to minimize.
[2023-03-15 14:59:47] [INFO ] Deduced a trap composed of 576 places in 619 ms of which 1 ms to minimize.
[2023-03-15 14:59:48] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 2 ms to minimize.
[2023-03-15 14:59:48] [INFO ] Deduced a trap composed of 558 places in 652 ms of which 1 ms to minimize.
[2023-03-15 14:59:49] [INFO ] Deduced a trap composed of 560 places in 604 ms of which 1 ms to minimize.
[2023-03-15 14:59:50] [INFO ] Deduced a trap composed of 558 places in 641 ms of which 1 ms to minimize.
[2023-03-15 14:59:50] [INFO ] Deduced a trap composed of 556 places in 637 ms of which 1 ms to minimize.
[2023-03-15 14:59:52] [INFO ] Deduced a trap composed of 564 places in 582 ms of which 1 ms to minimize.
[2023-03-15 14:59:53] [INFO ] Deduced a trap composed of 582 places in 577 ms of which 1 ms to minimize.
[2023-03-15 14:59:53] [INFO ] Deduced a trap composed of 568 places in 597 ms of which 1 ms to minimize.
[2023-03-15 14:59:54] [INFO ] Deduced a trap composed of 580 places in 588 ms of which 1 ms to minimize.
[2023-03-15 14:59:55] [INFO ] Deduced a trap composed of 576 places in 597 ms of which 1 ms to minimize.
[2023-03-15 14:59:56] [INFO ] Deduced a trap composed of 556 places in 584 ms of which 1 ms to minimize.
[2023-03-15 14:59:56] [INFO ] Deduced a trap composed of 558 places in 556 ms of which 1 ms to minimize.
[2023-03-15 14:59:57] [INFO ] Deduced a trap composed of 568 places in 583 ms of which 2 ms to minimize.
[2023-03-15 14:59:58] [INFO ] Deduced a trap composed of 572 places in 593 ms of which 2 ms to minimize.
[2023-03-15 14:59:59] [INFO ] Deduced a trap composed of 574 places in 589 ms of which 1 ms to minimize.
[2023-03-15 14:59:59] [INFO ] Deduced a trap composed of 562 places in 591 ms of which 1 ms to minimize.
[2023-03-15 15:00:00] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 15:00:01] [INFO ] Deduced a trap composed of 574 places in 591 ms of which 2 ms to minimize.
[2023-03-15 15:00:01] [INFO ] Deduced a trap composed of 572 places in 629 ms of which 1 ms to minimize.
[2023-03-15 15:00:02] [INFO ] Deduced a trap composed of 574 places in 545 ms of which 1 ms to minimize.
[2023-03-15 15:00:03] [INFO ] Deduced a trap composed of 558 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:00:03] [INFO ] Deduced a trap composed of 568 places in 567 ms of which 1 ms to minimize.
[2023-03-15 15:00:04] [INFO ] Deduced a trap composed of 564 places in 560 ms of which 1 ms to minimize.
[2023-03-15 15:00:05] [INFO ] Deduced a trap composed of 564 places in 627 ms of which 1 ms to minimize.
[2023-03-15 15:00:05] [INFO ] Deduced a trap composed of 570 places in 551 ms of which 1 ms to minimize.
[2023-03-15 15:00:06] [INFO ] Deduced a trap composed of 570 places in 543 ms of which 1 ms to minimize.
[2023-03-15 15:00:07] [INFO ] Deduced a trap composed of 570 places in 624 ms of which 1 ms to minimize.
[2023-03-15 15:00:07] [INFO ] Deduced a trap composed of 562 places in 629 ms of which 3 ms to minimize.
[2023-03-15 15:00:08] [INFO ] Deduced a trap composed of 570 places in 622 ms of which 1 ms to minimize.
[2023-03-15 15:00:09] [INFO ] Deduced a trap composed of 566 places in 624 ms of which 1 ms to minimize.
[2023-03-15 15:00:10] [INFO ] Deduced a trap composed of 570 places in 629 ms of which 1 ms to minimize.
[2023-03-15 15:00:11] [INFO ] Deduced a trap composed of 590 places in 628 ms of which 1 ms to minimize.
[2023-03-15 15:00:11] [INFO ] Deduced a trap composed of 584 places in 636 ms of which 1 ms to minimize.
[2023-03-15 15:00:12] [INFO ] Deduced a trap composed of 582 places in 637 ms of which 1 ms to minimize.
[2023-03-15 15:00:13] [INFO ] Deduced a trap composed of 570 places in 584 ms of which 1 ms to minimize.
[2023-03-15 15:00:21] [INFO ] Deduced a trap composed of 576 places in 610 ms of which 1 ms to minimize.
[2023-03-15 15:00:22] [INFO ] Deduced a trap composed of 568 places in 574 ms of which 2 ms to minimize.
[2023-03-15 15:00:25] [INFO ] Deduced a trap composed of 554 places in 610 ms of which 1 ms to minimize.
[2023-03-15 15:00:26] [INFO ] Deduced a trap composed of 574 places in 638 ms of which 1 ms to minimize.
[2023-03-15 15:00:27] [INFO ] Deduced a trap composed of 574 places in 600 ms of which 1 ms to minimize.
[2023-03-15 15:00:27] [INFO ] Deduced a trap composed of 574 places in 593 ms of which 1 ms to minimize.
[2023-03-15 15:00:28] [INFO ] Deduced a trap composed of 582 places in 605 ms of which 2 ms to minimize.
[2023-03-15 15:00:29] [INFO ] Deduced a trap composed of 574 places in 601 ms of which 1 ms to minimize.
[2023-03-15 15:00:30] [INFO ] Deduced a trap composed of 560 places in 673 ms of which 1 ms to minimize.
[2023-03-15 15:00:31] [INFO ] Deduced a trap composed of 574 places in 647 ms of which 1 ms to minimize.
[2023-03-15 15:00:32] [INFO ] Deduced a trap composed of 586 places in 673 ms of which 2 ms to minimize.
[2023-03-15 15:00:32] [INFO ] Deduced a trap composed of 562 places in 656 ms of which 1 ms to minimize.
[2023-03-15 15:00:33] [INFO ] Deduced a trap composed of 556 places in 646 ms of which 1 ms to minimize.
[2023-03-15 15:00:34] [INFO ] Deduced a trap composed of 560 places in 666 ms of which 1 ms to minimize.
[2023-03-15 15:00:34] [INFO ] Deduced a trap composed of 570 places in 635 ms of which 1 ms to minimize.
[2023-03-15 15:00:35] [INFO ] Deduced a trap composed of 568 places in 633 ms of which 1 ms to minimize.
[2023-03-15 15:00:36] [INFO ] Deduced a trap composed of 568 places in 626 ms of which 1 ms to minimize.
[2023-03-15 15:00:37] [INFO ] Deduced a trap composed of 566 places in 672 ms of which 2 ms to minimize.
[2023-03-15 15:00:37] [INFO ] Deduced a trap composed of 564 places in 673 ms of which 1 ms to minimize.
[2023-03-15 15:00:38] [INFO ] Deduced a trap composed of 566 places in 669 ms of which 1 ms to minimize.
[2023-03-15 15:00:39] [INFO ] Deduced a trap composed of 562 places in 641 ms of which 1 ms to minimize.
[2023-03-15 15:00:40] [INFO ] Deduced a trap composed of 568 places in 633 ms of which 2 ms to minimize.
[2023-03-15 15:00:40] [INFO ] Deduced a trap composed of 558 places in 650 ms of which 1 ms to minimize.
[2023-03-15 15:00:41] [INFO ] Deduced a trap composed of 554 places in 639 ms of which 1 ms to minimize.
[2023-03-15 15:00:42] [INFO ] Deduced a trap composed of 572 places in 634 ms of which 1 ms to minimize.
[2023-03-15 15:00:42] [INFO ] Deduced a trap composed of 576 places in 625 ms of which 1 ms to minimize.
[2023-03-15 15:00:43] [INFO ] Deduced a trap composed of 570 places in 629 ms of which 1 ms to minimize.
[2023-03-15 15:00:44] [INFO ] Deduced a trap composed of 558 places in 623 ms of which 1 ms to minimize.
[2023-03-15 15:00:46] [INFO ] Deduced a trap composed of 572 places in 645 ms of which 1 ms to minimize.
[2023-03-15 15:00:47] [INFO ] Deduced a trap composed of 576 places in 599 ms of which 1 ms to minimize.
[2023-03-15 15:00:48] [INFO ] Deduced a trap composed of 572 places in 608 ms of which 1 ms to minimize.
[2023-03-15 15:00:48] [INFO ] Deduced a trap composed of 566 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:00:49] [INFO ] Deduced a trap composed of 568 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:00:50] [INFO ] Deduced a trap composed of 560 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:00:50] [INFO ] Deduced a trap composed of 568 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:00:51] [INFO ] Deduced a trap composed of 576 places in 643 ms of which 1 ms to minimize.
[2023-03-15 15:00:52] [INFO ] Deduced a trap composed of 570 places in 591 ms of which 1 ms to minimize.
[2023-03-15 15:00:53] [INFO ] Deduced a trap composed of 570 places in 598 ms of which 1 ms to minimize.
[2023-03-15 15:00:53] [INFO ] Deduced a trap composed of 562 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:00:54] [INFO ] Deduced a trap composed of 568 places in 584 ms of which 1 ms to minimize.
[2023-03-15 15:00:55] [INFO ] Deduced a trap composed of 568 places in 599 ms of which 1 ms to minimize.
[2023-03-15 15:00:55] [INFO ] Deduced a trap composed of 564 places in 588 ms of which 1 ms to minimize.
[2023-03-15 15:00:56] [INFO ] Deduced a trap composed of 576 places in 631 ms of which 2 ms to minimize.
[2023-03-15 15:00:57] [INFO ] Deduced a trap composed of 578 places in 596 ms of which 1 ms to minimize.
[2023-03-15 15:00:57] [INFO ] Deduced a trap composed of 572 places in 607 ms of which 1 ms to minimize.
[2023-03-15 15:00:58] [INFO ] Deduced a trap composed of 556 places in 610 ms of which 2 ms to minimize.
[2023-03-15 15:00:59] [INFO ] Deduced a trap composed of 580 places in 595 ms of which 1 ms to minimize.
[2023-03-15 15:00:59] [INFO ] Deduced a trap composed of 566 places in 621 ms of which 1 ms to minimize.
[2023-03-15 15:01:00] [INFO ] Deduced a trap composed of 562 places in 633 ms of which 1 ms to minimize.
[2023-03-15 15:01:01] [INFO ] Deduced a trap composed of 578 places in 601 ms of which 1 ms to minimize.
[2023-03-15 15:01:01] [INFO ] Deduced a trap composed of 568 places in 652 ms of which 1 ms to minimize.
[2023-03-15 15:01:02] [INFO ] Deduced a trap composed of 562 places in 611 ms of which 1 ms to minimize.
[2023-03-15 15:01:03] [INFO ] Deduced a trap composed of 568 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:01:04] [INFO ] Deduced a trap composed of 560 places in 616 ms of which 2 ms to minimize.
[2023-03-15 15:01:04] [INFO ] Deduced a trap composed of 562 places in 618 ms of which 1 ms to minimize.
[2023-03-15 15:01:05] [INFO ] Deduced a trap composed of 564 places in 595 ms of which 2 ms to minimize.
[2023-03-15 15:01:06] [INFO ] Deduced a trap composed of 568 places in 606 ms of which 1 ms to minimize.
[2023-03-15 15:01:06] [INFO ] Deduced a trap composed of 564 places in 618 ms of which 1 ms to minimize.
[2023-03-15 15:01:07] [INFO ] Deduced a trap composed of 562 places in 595 ms of which 1 ms to minimize.
[2023-03-15 15:01:08] [INFO ] Deduced a trap composed of 554 places in 611 ms of which 1 ms to minimize.
[2023-03-15 15:01:08] [INFO ] Deduced a trap composed of 578 places in 612 ms of which 1 ms to minimize.
[2023-03-15 15:01:09] [INFO ] Deduced a trap composed of 562 places in 601 ms of which 1 ms to minimize.
[2023-03-15 15:01:10] [INFO ] Deduced a trap composed of 568 places in 612 ms of which 1 ms to minimize.
[2023-03-15 15:01:10] [INFO ] Deduced a trap composed of 582 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:01:11] [INFO ] Deduced a trap composed of 582 places in 609 ms of which 2 ms to minimize.
[2023-03-15 15:01:12] [INFO ] Deduced a trap composed of 564 places in 591 ms of which 2 ms to minimize.
[2023-03-15 15:01:12] [INFO ] Deduced a trap composed of 560 places in 600 ms of which 1 ms to minimize.
[2023-03-15 15:01:13] [INFO ] Deduced a trap composed of 558 places in 597 ms of which 2 ms to minimize.
[2023-03-15 15:01:14] [INFO ] Deduced a trap composed of 568 places in 573 ms of which 1 ms to minimize.
[2023-03-15 15:01:14] [INFO ] Deduced a trap composed of 592 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:01:15] [INFO ] Deduced a trap composed of 576 places in 636 ms of which 1 ms to minimize.
[2023-03-15 15:01:16] [INFO ] Deduced a trap composed of 562 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:01:16] [INFO ] Deduced a trap composed of 572 places in 622 ms of which 2 ms to minimize.
[2023-03-15 15:01:17] [INFO ] Deduced a trap composed of 576 places in 619 ms of which 1 ms to minimize.
[2023-03-15 15:01:18] [INFO ] Deduced a trap composed of 572 places in 623 ms of which 1 ms to minimize.
[2023-03-15 15:01:19] [INFO ] Deduced a trap composed of 588 places in 611 ms of which 1 ms to minimize.
[2023-03-15 15:01:19] [INFO ] Deduced a trap composed of 586 places in 630 ms of which 1 ms to minimize.
[2023-03-15 15:01:20] [INFO ] Deduced a trap composed of 576 places in 580 ms of which 1 ms to minimize.
[2023-03-15 15:01:21] [INFO ] Deduced a trap composed of 566 places in 625 ms of which 1 ms to minimize.
[2023-03-15 15:01:21] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:01:22] [INFO ] Deduced a trap composed of 566 places in 584 ms of which 1 ms to minimize.
[2023-03-15 15:01:23] [INFO ] Deduced a trap composed of 570 places in 577 ms of which 2 ms to minimize.
[2023-03-15 15:01:23] [INFO ] Deduced a trap composed of 570 places in 599 ms of which 1 ms to minimize.
[2023-03-15 15:01:24] [INFO ] Deduced a trap composed of 574 places in 588 ms of which 1 ms to minimize.
[2023-03-15 15:01:25] [INFO ] Deduced a trap composed of 572 places in 588 ms of which 2 ms to minimize.
[2023-03-15 15:01:25] [INFO ] Deduced a trap composed of 570 places in 572 ms of which 1 ms to minimize.
[2023-03-15 15:01:26] [INFO ] Deduced a trap composed of 578 places in 606 ms of which 1 ms to minimize.
[2023-03-15 15:01:27] [INFO ] Deduced a trap composed of 578 places in 595 ms of which 1 ms to minimize.
[2023-03-15 15:01:28] [INFO ] Deduced a trap composed of 580 places in 585 ms of which 1 ms to minimize.
[2023-03-15 15:01:30] [INFO ] Deduced a trap composed of 574 places in 594 ms of which 1 ms to minimize.
[2023-03-15 15:03:20] [INFO ] Trap strengthening (SAT) tested/added 139/139 trap constraints in 223952 ms
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.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.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 15:03:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:03:21] [INFO ] After 225025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
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 1430 transition count 2592
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 1430 transition count 2591
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 1429 transition count 2591
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 1429 transition count 2590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 1428 transition count 2590
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 1428 transition count 2580
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 1418 transition count 2580
Applied a total of 33 rules in 432 ms. Remains 1418 /1430 variables (removed 12) and now considering 2580/2601 (removed 21) transitions.
Running SMT prover for 1 properties.
[2023-03-15 15:03:21] [INFO ] Invariant cache hit.
[2023-03-15 15:03:21] [INFO ] [Real]Absence check using 175 positive place invariants in 44 ms returned sat
[2023-03-15 15:03:21] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 15:03:21] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 15:03:21] [INFO ] [Nat]Absence check using 175 positive place invariants in 43 ms returned sat
[2023-03-15 15:03:22] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned sat
[2023-03-15 15:03:22] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 15:03:23] [INFO ] Deduced a trap composed of 564 places in 599 ms of which 1 ms to minimize.
[2023-03-15 15:03:24] [INFO ] Deduced a trap composed of 584 places in 592 ms of which 1 ms to minimize.
[2023-03-15 15:03:24] [INFO ] Deduced a trap composed of 576 places in 608 ms of which 1 ms to minimize.
[2023-03-15 15:03:25] [INFO ] Deduced a trap composed of 574 places in 636 ms of which 2 ms to minimize.
[2023-03-15 15:03:26] [INFO ] Deduced a trap composed of 570 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:03:26] [INFO ] Deduced a trap composed of 570 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:03:27] [INFO ] Deduced a trap composed of 564 places in 683 ms of which 1 ms to minimize.
[2023-03-15 15:03:28] [INFO ] Deduced a trap composed of 564 places in 612 ms of which 2 ms to minimize.
[2023-03-15 15:03:29] [INFO ] Deduced a trap composed of 570 places in 631 ms of which 1 ms to minimize.
[2023-03-15 15:03:29] [INFO ] Deduced a trap composed of 558 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:03:30] [INFO ] Deduced a trap composed of 580 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:03:31] [INFO ] Deduced a trap composed of 566 places in 602 ms of which 1 ms to minimize.
[2023-03-15 15:03:31] [INFO ] Deduced a trap composed of 564 places in 622 ms of which 1 ms to minimize.
[2023-03-15 15:03:32] [INFO ] Deduced a trap composed of 576 places in 615 ms of which 1 ms to minimize.
[2023-03-15 15:03:33] [INFO ] Deduced a trap composed of 562 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:03:34] [INFO ] Deduced a trap composed of 566 places in 607 ms of which 1 ms to minimize.
[2023-03-15 15:03:35] [INFO ] Deduced a trap composed of 590 places in 590 ms of which 1 ms to minimize.
[2023-03-15 15:03:36] [INFO ] Deduced a trap composed of 562 places in 589 ms of which 1 ms to minimize.
[2023-03-15 15:03:36] [INFO ] Deduced a trap composed of 582 places in 578 ms of which 1 ms to minimize.
[2023-03-15 15:03:37] [INFO ] Deduced a trap composed of 570 places in 582 ms of which 1 ms to minimize.
[2023-03-15 15:03:38] [INFO ] Deduced a trap composed of 570 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:03:38] [INFO ] Deduced a trap composed of 572 places in 560 ms of which 1 ms to minimize.
[2023-03-15 15:03:39] [INFO ] Deduced a trap composed of 564 places in 604 ms of which 1 ms to minimize.
[2023-03-15 15:03:40] [INFO ] Deduced a trap composed of 566 places in 599 ms of which 2 ms to minimize.
[2023-03-15 15:03:40] [INFO ] Deduced a trap composed of 566 places in 580 ms of which 1 ms to minimize.
[2023-03-15 15:03:41] [INFO ] Deduced a trap composed of 570 places in 579 ms of which 1 ms to minimize.
[2023-03-15 15:03:42] [INFO ] Deduced a trap composed of 578 places in 576 ms of which 1 ms to minimize.
[2023-03-15 15:03:43] [INFO ] Deduced a trap composed of 574 places in 570 ms of which 1 ms to minimize.
[2023-03-15 15:03:44] [INFO ] Deduced a trap composed of 574 places in 590 ms of which 1 ms to minimize.
[2023-03-15 15:03:45] [INFO ] Deduced a trap composed of 578 places in 584 ms of which 1 ms to minimize.
[2023-03-15 15:03:46] [INFO ] Deduced a trap composed of 558 places in 585 ms of which 2 ms to minimize.
[2023-03-15 15:03:46] [INFO ] Deduced a trap composed of 576 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:03:47] [INFO ] Deduced a trap composed of 572 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:03:48] [INFO ] Deduced a trap composed of 564 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:03:48] [INFO ] Deduced a trap composed of 578 places in 586 ms of which 1 ms to minimize.
[2023-03-15 15:03:49] [INFO ] Deduced a trap composed of 560 places in 569 ms of which 1 ms to minimize.
[2023-03-15 15:03:49] [INFO ] Deduced a trap composed of 568 places in 559 ms of which 1 ms to minimize.
[2023-03-15 15:03:50] [INFO ] Deduced a trap composed of 562 places in 561 ms of which 1 ms to minimize.
[2023-03-15 15:03:51] [INFO ] Deduced a trap composed of 574 places in 555 ms of which 1 ms to minimize.
[2023-03-15 15:03:51] [INFO ] Deduced a trap composed of 576 places in 596 ms of which 2 ms to minimize.
[2023-03-15 15:03:52] [INFO ] Deduced a trap composed of 564 places in 628 ms of which 1 ms to minimize.
[2023-03-15 15:03:53] [INFO ] Deduced a trap composed of 568 places in 638 ms of which 1 ms to minimize.
[2023-03-15 15:03:53] [INFO ] Deduced a trap composed of 560 places in 567 ms of which 2 ms to minimize.
[2023-03-15 15:03:54] [INFO ] Deduced a trap composed of 582 places in 587 ms of which 1 ms to minimize.
[2023-03-15 15:03:55] [INFO ] Deduced a trap composed of 580 places in 569 ms of which 1 ms to minimize.
[2023-03-15 15:03:56] [INFO ] Deduced a trap composed of 568 places in 628 ms of which 1 ms to minimize.
[2023-03-15 15:03:56] [INFO ] Deduced a trap composed of 574 places in 622 ms of which 1 ms to minimize.
[2023-03-15 15:03:57] [INFO ] Deduced a trap composed of 552 places in 619 ms of which 1 ms to minimize.
[2023-03-15 15:03:58] [INFO ] Deduced a trap composed of 558 places in 628 ms of which 2 ms to minimize.
[2023-03-15 15:03:58] [INFO ] Deduced a trap composed of 584 places in 628 ms of which 1 ms to minimize.
[2023-03-15 15:03:59] [INFO ] Deduced a trap composed of 570 places in 618 ms of which 1 ms to minimize.
[2023-03-15 15:04:00] [INFO ] Deduced a trap composed of 564 places in 634 ms of which 1 ms to minimize.
[2023-03-15 15:04:00] [INFO ] Deduced a trap composed of 568 places in 617 ms of which 2 ms to minimize.
[2023-03-15 15:04:01] [INFO ] Deduced a trap composed of 574 places in 618 ms of which 1 ms to minimize.
[2023-03-15 15:04:02] [INFO ] Deduced a trap composed of 566 places in 620 ms of which 1 ms to minimize.
[2023-03-15 15:04:02] [INFO ] Deduced a trap composed of 566 places in 623 ms of which 2 ms to minimize.
[2023-03-15 15:04:03] [INFO ] Deduced a trap composed of 566 places in 617 ms of which 1 ms to minimize.
[2023-03-15 15:04:04] [INFO ] Deduced a trap composed of 572 places in 592 ms of which 2 ms to minimize.
[2023-03-15 15:04:05] [INFO ] Deduced a trap composed of 574 places in 573 ms of which 1 ms to minimize.
[2023-03-15 15:04:05] [INFO ] Deduced a trap composed of 564 places in 615 ms of which 1 ms to minimize.
[2023-03-15 15:04:06] [INFO ] Deduced a trap composed of 576 places in 637 ms of which 1 ms to minimize.
[2023-03-15 15:04:07] [INFO ] Deduced a trap composed of 576 places in 582 ms of which 1 ms to minimize.
[2023-03-15 15:04:07] [INFO ] Deduced a trap composed of 576 places in 625 ms of which 2 ms to minimize.
[2023-03-15 15:04:08] [INFO ] Deduced a trap composed of 566 places in 619 ms of which 1 ms to minimize.
[2023-03-15 15:04:09] [INFO ] Deduced a trap composed of 560 places in 625 ms of which 1 ms to minimize.
[2023-03-15 15:04:09] [INFO ] Deduced a trap composed of 560 places in 621 ms of which 1 ms to minimize.
[2023-03-15 15:04:10] [INFO ] Deduced a trap composed of 570 places in 623 ms of which 1 ms to minimize.
[2023-03-15 15:04:11] [INFO ] Deduced a trap composed of 558 places in 621 ms of which 1 ms to minimize.
[2023-03-15 15:04:11] [INFO ] Deduced a trap composed of 574 places in 573 ms of which 1 ms to minimize.
[2023-03-15 15:04:12] [INFO ] Deduced a trap composed of 570 places in 554 ms of which 1 ms to minimize.
[2023-03-15 15:04:13] [INFO ] Deduced a trap composed of 566 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:04:13] [INFO ] Deduced a trap composed of 564 places in 555 ms of which 1 ms to minimize.
[2023-03-15 15:04:14] [INFO ] Deduced a trap composed of 564 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:04:15] [INFO ] Deduced a trap composed of 580 places in 605 ms of which 1 ms to minimize.
[2023-03-15 15:04:15] [INFO ] Deduced a trap composed of 558 places in 593 ms of which 1 ms to minimize.
[2023-03-15 15:04:16] [INFO ] Deduced a trap composed of 584 places in 603 ms of which 1 ms to minimize.
[2023-03-15 15:04:17] [INFO ] Deduced a trap composed of 582 places in 590 ms of which 2 ms to minimize.
[2023-03-15 15:04:18] [INFO ] Deduced a trap composed of 572 places in 564 ms of which 1 ms to minimize.
[2023-03-15 15:04:27] [INFO ] Deduced a trap composed of 560 places in 602 ms of which 2 ms to minimize.
[2023-03-15 15:07:06] [INFO ] Trap strengthening (SAT) tested/added 79/79 trap constraints in 224001 ms
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.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:07:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 15:07:06] [INFO ] After 225018ms 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 1010382 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (COL), instance S10J80
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 1678892828427

--------------------
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-S10J80"
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-S10J80, 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-167873966100442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 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 ;